Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/29974
Title: | Degree-dependent intervertex separation in complex networks |
Author: | Dorogovtsev, S. N. Mendes, J. F. F. Oliveira, J. G. |
Issue Date: | May-2006 |
Publisher: | American Physical Society |
Abstract: | We study the mean length (l)(k) of the shortest paths between a vertex of degree k and other vertices in growing networks, where correlations are essential. In a number of deterministic scale-free networks we observe a power-law correction to a logarithmic dependence, (l)(k) = A ln[N/k((gamma-1)/2)]-Ck(gamma-1)/N+ in a wide range of network sizes. Here N is the number of vertices in the network, gamma is the degree distribution exponent, and the coefficients A and C depend on a network. We compare this law with a corresponding (l)(k) dependence obtained for random scale-free networks growing through the preferential attachment mechanism. In stochastic and deterministic growing trees with an exponential degree distribution, we observe a linear dependence on degree, (l)(k)approximately A ln N-Ck. We compare our findings for growing networks with those for uncorrelated graphs. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/29974 |
DOI: | 10.1103/PhysRevE.73.056122 |
ISSN: | 2470-0045 |
Publisher Version: | https://journals.aps.org/pre/abstract/10.1103/PhysRevE.73.056122 |
Appears in Collections: | DFis - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
PhysRevE.73.056122.06.pdf | 110.37 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.