Skip to Main content Skip to Navigation
Conference papers

Degree-correlation of Scale-free graphs

Abstract : Barabási and Albert [1] suggested modeling scale-free networks by the following random graph process: one node is added at a time and is connected to an earlier node chosen with probability proportional to its degree. A recent empirical study of Newman [5] demonstrates existence of degree-correlation between degrees of adjacent nodes in real-world networks. Here we define the \textitdegree correlation―-correlation of the degrees in a pair of adjacent nodes―-for a random graph process. We determine asymptotically the joint probability distribution for node-degrees, $d$ and $d'$, of adjacent nodes for every $0≤d≤ d'≤n^1 / 5$, and use this result to show that the model of Barabási and Albert does not generate degree-correlation. Our theorem confirms the result in [KR01], obtained by using the mean-field heuristic approach.
Complete list of metadata

Cited literature [7 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184363
Contributor : Coordination Episciences Iam <>
Submitted on : Friday, August 14, 2015 - 11:37:31 AM
Last modification on : Friday, May 21, 2021 - 5:58:04 PM
Long-term archiving on: : Sunday, November 15, 2015 - 11:00:56 AM

File

dmAE0148.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01184363, version 1

Collections

Citation

Zoran Nikoloski, Narsingh Deo, Ludek Kucera. Degree-correlation of Scale-free graphs. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.239-244. ⟨hal-01184363⟩

Share

Metrics

Record views

377

Files downloads

711