Answers are grounded in this paper and cite their sources.
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(-gamma(c)) with gamma(c)=3 . Theoretical results are verified by computer simulations, and the importance of finite-size effects is discussed.
No takes yet. Share an insight, caveat, or question.
Blondel et al. (2008) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: