3.2k citations · 16k across the 104 of their papers we have counts for
6 papers · 1 filter
Degree-dependent intervertex separation in complex networks
S. N. Dorogovtsev, J. F. F. Mendes, J. G. Oliveira
We study the mean length of the shortest paths between a vertex of degree and other vertices in growing networks, where correlations are essential. In a number of det…
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…
Complex networks created by aggregation
M. J. Alava, S. N. Dorogovtsev
We study aggregation as a mechanism for the creation of complex networks. In this evolution process vertices merge together, which increases the number of highly connected hubs. We…
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…
Self-organization of collaboration networks
Jose J. Ramasco, S. N. Dorogovtsev, Romualdo Pastor-Satorras
We study collaboration networks in terms of evolving, self-organizing bipartite graph models. We propose a model of a growing network, which combines preferential edge attachment w…