Lobby index in networks

Abstract

We propose a new node centrality measure in networks, the lobby index, which is inspired by Hirsch's h-index. It is shown that in scale free networks the l-index has power tail with exponent square of the exponent of the degree distribution one. Properties of the l-index and extensions are discussed.

The revised version eliminates a calculation error in the distribution of the l-index and its consequences in the exponent estimates

References in corpus (6)

• An index to quantify an individual's scientific research output
• Mean-field theory for scale-free random networks
• Connectivity of Growing Random Networks
• Fuzzy communities and the concept of bridgeness in complex networks
• Accurately modeling the Internet topology
• Correlations among centrality measures in complex networks

Cited by in corpus (11)

• Vital nodes identification in complex networks
• Community landscapes: an integrative approach to determine overlapping network module hierarchy, identify key nodes and predict network dynamics
• A Survey on Centrality Metrics and Their Implications in Network Resilience
• Leveraging local h-index to identify and rank influential spreaders in networks
• The Dynamics of Vehicular Networks in Urban Environments
• Lobby index as a network centrality measure
• A Network Science perspective of Graph Convolutional Networks: A survey
• Network connectivity under a probabilistic node failure model
• Fast asynchronous updating algorithms for k-shell indices
• Hirsch index as a network centrality measure
• CARL-DTN: Context Adaptive Reinforcement Learning based Routing Algorithm in Delay Tolerant Network