Origin of degree correlations in the Internet and other networks
- 15 August 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review E
- Vol. 68 (2) , 026112
- https://doi.org/10.1103/physreve.68.026112
Abstract
It has been argued that the observed anticorrelation between the degrees of adjacent vertices in the network representation of the Internet has its origin in the restriction that no two vertices have more than one edge connecting them. Here, we propose a formalism for modeling ensembles of graphs with single edges only and derive values for the exponents and correlation coefficients characterizing them. Our results confirm that the conjectured mechanism does indeed give rise to correlations of the kind seen in the Internet, although only a part of the measured correlation can be accounted for in this way.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- Mixing patterns in networksPhysical Review E, 2003
- The Structure and Function of Complex NetworksSIAM Review, 2003
- Assortative Mixing in NetworksPhysical Review Letters, 2002
- Evolution of networksAdvances in Physics, 2002
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Dynamical and Correlation Properties of the InternetPhysical Review Letters, 2001
- Exploring complex networksNature, 2001
- The Size of the Giant Component of a Random Graph with a Given Degree SequenceCombinatorics, Probability and Computing, 1998
- On the precise number of (0,1)-matrices in A(R,S)Discrete Mathematics, 1998
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978