Local leaders in random networks
Local leaders in random networks
复制标题
DOI：
10.1103/physreve.77.036114
复制
发表时间：
2008-03-01
影响因子：
2.4
通讯作者：
Lambiotte, Renaud
中科院分区：
文献类型：
--
作者：
Blondel, Vincent D.;Guillaume, Jean-Loup;Lambiotte, Renaud
我们考虑随机不相关网络中的本地领导者，即，节点的度高于或等于其所有邻居的度。一个解析表达式被发现的概率为度k的节点是一个本地的领导者。这个量显示出从高度数节点是局部领导者的情况到它们不是局部领导者的情况的转变，当度分布的尾部表现得像幂律，类似于k（-gamma c），gamma（c）= 3。通过计算机模拟验证了理论结果，并讨论了有限尺寸效应的重要性。
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 similar to k(-gamma c) with gamma(c) = 3. Theoretical results are verified by computer simulations, and the importance of finite-size effects is discussed.