corner
corner

Phys. Rev. E 77, 036114 (2008) [5 pages]

Local leaders in random networks

Download: PDF (122 kB) Buy this article Export: BibTeX or EndNote (RIS)

Vincent D. Blondel1, Jean-Loup Guillaume2, Julien M. Hendrickx1, Cristobald de Kerchove1, and Renaud Lambiotte1,3
1Department of Mathematical Engineering, Université catholique de Louvain, 4 avenue Georges Lemaitre, B-1348 Louvain-la-Neuve, Belgium
2LIP6 (UMR 7606 CNRS), Université Pierre & Marie Curie, 4 place Jussieu, 75005 Paris, France
3GRAPES, Université de Liège, Sart-Tilman, B-4000 Liège, Belgium

Received 27 July 2007; published 13 March 2008

We consider local leaders in random uncorrelated networks, i.e., nodes whose degree is higher than or equal to the degree of all their neighbors. An analytical expression is found for the probability for a node of degree k to be a local leader. This quantity is shown to exhibit a transition from a situation where high-degree nodes are local leaders to a situation where they are not, when the tail of the degree distribution behaves like the power law kγc with γc=3. Theoretical results are verified by computer simulations, and the importance of finite-size effects is discussed.

© 2008 The American Physical Society

URL:
http://link.aps.org/doi/10.1103/PhysRevE.77.036114
DOI:
10.1103/PhysRevE.77.036114
PACS:
89.75.Fb, 89.75.Hc, 87.23.Ge, 05.90.+m