2.3k citations · 3.3k across the 37 of their papers we have counts for
3 papers · 2 filters
How to generate a random growing network
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin
We propose a construction procedure which generates a wide class of random evolving networks with fat-tailed degree distributions and an arbitrary clustering. This procedure applie…
How to construct a correlated net
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin
(a) We propose a ``static'' construction procedure for random networks with given correlations of the degrees of the nearest-neighbor vertices. This is an equilibrium graph, maxima…
Accelerated growth of networks
S. N. Dorogovtsev, J. F. F. Mendes
In many real growing networks the mean number of connections per vertex increases with time. The Internet, the Word Wide Web, collaboration networks, and many others display this b…