52 citations · 89 across the 7 of their papers we have counts for
15 papers
Minimal models of weighted scale-free networks
S. N. Dorogovtsev, J. F. F. Mendes
We consider a class of simple, non-trivial models of evolving weighted scale-free networks. The network evolution in these models is determined by attachment of new vertices to end…
Preferential compactness of networks
M. J. Alava, S. N. Dorogovtsev
We introduce evolving networks where new vertices preferentially connect to the more central parts of a network. This makes such networks compact. Finite networks grown under the p…
The shortest path to complex networks
S. N. Dorogovtsev, J. F. F. Mendes
1. The birth of network science. 2. What are random networks? 3. Adjacency matrix. 4. Degree distribution. 5. What are simple networks? Classical random graphs. 6. Birth of the gia…
Networks with desired correlations
S. N. Dorogovtsev
We discuss a simple method of constructing correlated random networks, which was recently proposed by M. Bogu~n'a and R. Pastor-Satorras (cond-mat/0306072). The result of this cons…
Modern architecture of random graphs: Constructions and correlations
S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin
1. Basic constructions. 2. Equilibrium and nonequilibrium networks. 3. Equilibrium uncorrelated networks. 4. Nonequilibrium nongrowing scale-free nets. 5. Types of correlations. 6.…
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…