52 citations · 74 across the 4 of their papers we have counts for
8 papers · 1 filter
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…
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…
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…
Language as an Evolving Word Web
S. N. Dorogovtsev, J. F. F. Mendes
Human language can be described as a complex network of linked words. In such a treatment, each distinct word in language is a vertex of this web, and neighboring words in sentence…