Geodesic
Degree-correlation of Scale-free graphs
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2005_special_250_a15,
     author = {Nikoloski, Zoran and Deo, Narsingh and Kucera, Ludek},
     title = {Degree-correlation of {Scale-free} graphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)},
     year = {2005},
     doi = {10.46298/dmtcs.3406},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3406/}
}
TY  - JOUR
AU  - Nikoloski, Zoran
AU  - Deo, Narsingh
AU  - Kucera, Ludek
TI  - Degree-correlation of Scale-free graphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2005
VL  - DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3406/
DO  - 10.46298/dmtcs.3406
LA  - en
ID  - DMTCS_2005_special_250_a15
ER  - 
%0 Journal Article
%A Nikoloski, Zoran
%A Deo, Narsingh
%A Kucera, Ludek
%T Degree-correlation of Scale-free graphs
%J Discrete mathematics & theoretical computer science
%D 2005
%V DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3406/
%R 10.46298/dmtcs.3406
%G en
%F DMTCS_2005_special_250_a15
Nikoloski, Zoran; Deo, Narsingh; Kucera, Ludek. Degree-correlation of Scale-free graphs. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) (2005). doi : 10.46298/dmtcs.3406. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3406/

Cité par Sources :