arXiv Analytics

Sign in

arXiv:cond-mat/0505193AbstractReferencesReviewsResources

Organization of complex networks without multiple connections

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

Published 2005-05-08, updated 2005-09-23Version 2

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 networks contain a core of highly interconnected vertices. The number of vertices in this core varies in the range between $const N^{1/2}$ and $const N^{2/3}$, where $N$ is the number of vertices in a network. At the birth point of the core, we obtain the size-dependent cut-off of the distribution of the number of connections and find that its position differs from earlier estimates.

Related articles: Most relevant | Search more
arXiv:1010.4702 [cond-mat.stat-mech] (Published 2010-10-22)
Spectral Perturbation and Reconstructability of Complex Networks
arXiv:1003.5583 [cond-mat.stat-mech] (Published 2010-03-29, updated 2010-05-26)
Bootstrap Percolation on Complex Networks
arXiv:0903.2584 [cond-mat.stat-mech] (Published 2009-03-14, updated 2009-09-26)
Curvature and temperature of complex networks