Topological structure and the H-index in complex networks

Abstract

The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets of nodes having the same $H(n)$, within the annealed network approximation. The connection between the Hirsch indices and the degree is highlighted. Numerical tests in synthetic uncorrelated networks and real-world correlated ones validate the findings. We also test the use of the Hirsch index for the identification of influential spreaders in networks, finding that it is in general outperformed by the recently introduced Non-Backtracking centrality.

9 pages, 8 figures

References in corpus (24)

• Emergence of scaling in random networks
• An index to quantify an individual's scientific research output
• Assortative mixing in networks
• The diameter of the world wide web
• Epidemic processes in complex networks
• Identification of influential spreaders in complex networks
• Evolution of networks
• Specificity and stability in topology of protein networks
• Critical phenomena in complex networks
• Self-similar community structure in organisations
• Dynamical and correlation properties of the Internet
• Vital nodes identification in complex networks
• Community Structure in Jazz
• Generation of uncorrelated random scale-free networks
• k-core organization of complex networks
• Localization and Spreading of Diseases in Complex Networks
• Localization and centrality in networks
• Cut-offs and finite size effects in scale-free networks
• k-core (bootstrap) percolation on complex networks: Critical phenomena and nonlocal effects
• A measure of individual role in collective dynamics
• Competing activation mechanisms in epidemics on networks
• Langevin approach for the dynamics of the contact process on annealed scale-free networks
• Leveraging percolation theory to single out influential spreaders in networks
• On the numerical study of percolation and epidemic critical properties in networks

Cited by in corpus (4)

• Fast influencers in complex networks
• Influencers identification in complex networks through reaction-diffusion dynamics
• Randomizing growing networks with a time-respecting null model
• Fast asynchronous updating algorithms for k-shell indices