On the limiting behavior of parameter-dependent network centrality measures

Abstract

We consider a broad class of walk-based, parameterized node centrality measures for network analysis. These measures are expressed in terms of functions of the adjacency matrix and generalize various well-known centrality indices, including Katz and subgraph centrality. We show that the parameter can be "tuned" to interpolate between degree and eigenvector centrality, which appear as limiting cases. Our analysis helps explain certain correlations often observed between the rankings obtained using different centrality measures, and provides some guidance for the tuning of parameters. We also highlight the roles played by the spectral gap of the adjacency matrix and by the number of triangles in the network. Our analysis covers both undirected and directed networks, including weighted ones. A brief discussion of PageRank is also given.

First 22 pages are the paper, pages 22-38 are the supplementary materials

References in corpus (1)

• Functional centrality in graphs

Cited by in corpus (21)

• Centrality measures for graphons: Accounting for uncertainty in networks
• Current Flow Group Closeness Centrality for Complex Networks
• A general centrality framework based on node navigability
• Continuous-Time Quantum Search on Balanced Trees
• Mittag-Leffler functions and their applications in network science
• Fast computation of matrix function-based centrality measures for layer-coupled multiplex networks
• Orientations and matrix function-based centralities in multiplex network analysis of urban public transport
• Network connectivity under a probabilistic node failure model
• Localization of eigenvector centrality in networks with a cut vertex
• Measuring nodes centrality when local and global measures overlap
• Exploring the "Middle Earth" of Network Spectra via a Gaussian Matrix Function
• A QUBO formulation for top-$\tau$ eigencentrality nodes
• Tackling information asymmetry in networks: a new entropy-based ranking index
• A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
• Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
• Potential gain as a centrality measure
• Influence measures in subnetworks using vertex centrality
• Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
• Spectral Ranking of Causal Influence in Complex Systems
• Walk based Laplacians for Modeling Diffusion on Complex Networks
• Network Sparsification via Degree- and Subgraph-based Edge Sampling