Zobrazeno 1 - 10
of 182
pro vyhledávání: '"Vigna, Sebastiano"'
In the study of the behavior of centrality measures with respect to network modifications, score monotonicity means that adding an arc increases the centrality score of the target of the arc; rank monotonicity means that adding an arc improves the im
Externí odkaz:
http://arxiv.org/abs/2309.00519
Autor:
Esfahani, Mohsen Koohi, Boldi, Paolo, Vandierendonck, Hans, Kilpatrick, Peter, Vigna, Sebastiano
Progress in High-Performance Computing in general, and High-Performance Graph Processing in particular, is highly dependent on the availability of publicly-accessible, relevant, and realistic data sets. To ensure continuation of this progress, we (i)
Externí odkaz:
http://arxiv.org/abs/2308.16744
Is it always beneficial to create a new relationship (have a new follower/friend) in a social network? This question can be formally stated as a property of the centrality measure that defines the importance of the actors of the network. Score monoto
Externí odkaz:
http://arxiv.org/abs/2207.06218
We study the problem of score and rank monotonicity for spectral ranking methods, such as eigenvector centrality and PageRank, in the case of undirected networks. Score monotonicity means that adding an edge increases the score at both ends of the ed
Externí odkaz:
http://arxiv.org/abs/2202.01044
Autor:
Blackman, David, Vigna, Sebastiano
We describe a new statistical test for pseudorandom number generators (PRNGs). Our test can find bias induced by dependencies among the Hamming weights of the outputs of a PRNG, even for PRNGs that pass state-of-the-art tests of the same kind from th
Externí odkaz:
http://arxiv.org/abs/2108.13061
Autor:
Steele, Guy, Vigna, Sebastiano
Congruential pseudorandom number generators rely on good multipliers, that is, integers that have good performance with respect to the spectral test. We provide lists of multipliers with a good lattice structure up to dimension eight and up to lag ei
Externí odkaz:
http://arxiv.org/abs/2001.05304
Autor:
Vigna, Sebastiano
When the Mersenne Twister made his first appearance in 1997 it was a powerful example of how linear maps on $\mathbf F_2$ could be used to generate pseudorandom numbers. In particular, the easiness with which generators with long periods could be def
Externí odkaz:
http://arxiv.org/abs/1910.06437
A minimal perfect hash function bijectively maps a key set $S$ out of a universe $U$ into the first $|S|$ natural numbers. Minimal perfect hash functions are used, for example, to map irregularly-shaped keys, such as string, in a compact space so tha
Externí odkaz:
http://arxiv.org/abs/1910.06416
Autor:
Marchini, Stefano, Vigna, Sebastiano
The Fenwick tree is a classical implicit data structure that stores an array in such a way that modifying an element, accessing an element, computing a prefix sum and performing a predecessor search on prefix sums all take logarithmic time. We introd
Externí odkaz:
http://arxiv.org/abs/1904.12370
Autor:
Blackman, David, Vigna, Sebastiano
$\mathbf F_2$-linear pseudorandom number generators are very popular due to their high speed, to the ease with which generators with a sizable state space can be created, and to their provable theoretical properties. However, they suffer from linear
Externí odkaz:
http://arxiv.org/abs/1805.01407