activity
19962017
most citedStructure of Growing Networks: Exact Solution of the Barabasi--Albert's Model

1.3k citations · 2.9k across the 22 of their papers we have counts for

collaborators

22 papers

cond-mat.dis-nn2017

Real space renormalization group for Ising Spin Glass and other glassy models. I. Disordered Ising model. General formalism

A. N. Samukhin

Here is the first part of the summary of my work on random Ising model using real-space renormalization group (RSRG), also known as a Migdal-Kadanoff one. This approximate renormal…

cond-mat.stat-mech2008★ 58 cited

Organization of modular networks

S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin +1

We examine the global organization of heterogeneous equilibrium networks consisting of a number of well distinguished interconnected parts--``communities'' or modules. We develop a…

cond-mat.stat-mech2007★ 128 cited

Laplacian spectra of complex networks and random walks on them: Are scale-free architectures really important?

A. N. Samukhin, S. N. Dorogovtsev, J. F. F. Mendes

We study the Laplacian operator of an uncorrelated random network and, as an application, consider hopping processes (diffusion, random walks, signal propagation, etc.) on networks…

cond-mat.stat-mech2005★ 25 cited

Organization of complex networks without multiple connections

S. N. Dorogovtsev, J. F. F. Mendes, A. M. Povolotsky +1

We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these…

cond-mat.stat-mech2003★ 284 cited

Spectra of complex networks

S. N. Dorogovtsev, A. V. Goltsev, J. F. F. Mendes +1

We propose a general approach to the description of spectra of complex networks. For the spectra of networks with uncorrelated vertices (and a local tree-like structure), exact equ…

cond-mat.stat-mech2002★ 81 cited

Metric structure of random networks

S. N. Dorogovtsev, J. F. F. Mendes, A. N. Samukhin

We propose a consistent approach to the statistics of the shortest paths in random graphs with a given degree distribution. This approach goes further than a usual tree ansatz and…