On the limiting behavior of parameter-dependent network centrality measures
From MaRDI portal
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Matrix exponential and similar functions of matrices (15A16) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
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.
Recommendations
Cites work
- A new status index derived from sociometric analysis
- Analyzing complex networks through correlations in centrality measurements
- Authoritative sources in a hyperlinked environment
- Block Gauss and anti-Gauss quadrature with application to networks
- Complex networks: structure and dynamics
- Complex networks. Structure, robustness and function.
- Dynamical Processes on Complex Networks
- Eigenspaces of graphs
- Fast matrix computations for pairwise and columnwise commute times and Katz scores
- Functional centrality in graphs
- Functions of Matrices
- Google's PageRank and beyond. The science of search engine rankings
- scientific article; zbMATH DE number 4049940 (Why is no real title available?)
- scientific article; zbMATH DE number 52076 (Why is no real title available?)
- scientific article; zbMATH DE number 2019639 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- scientific article; zbMATH DE number 1866312 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Limits and the Index of a Square Matrix
- Link Analysis: Hubs and Authorities on the World Wide Web
- Local estimates for eigenvector-like centralities of complex networks
- Network analysis via partial spectral factorization and Gauss quadrature
- Network analysis. Methodological foundations.
- Network properties revealed through matrix functions
- Networks. An introduction.
- On the properties of von Neumann kernels for link analysis
- Quadrature rule-based bounds for functions of adjacency matrices
- Random alpha PageRank
- Ranking hubs and authorities using matrix functions
- Sensitivity and stability of ranking vectors
- The Structure and Function of Complex Networks
- Who's \#1? The science of rating and ranking
Cited in
(43)- Gaussianization of the spectra of graphs and networks. Theory and applications
- Local community detection in dynamic graphs using personalized centrality
- On the exponential generating function for non-backtracking walks
- On the -nonbacktracking centrality for complex networks: existence and limit cases
- Walk entropy and walk-regularity
- Tackling information asymmetry in networks: a new entropy-based ranking index
- Orthogonal expansion of network functions
- Strategic connections in a hierarchical society: wedge between observed and fundamental valuations
- Structural heterogeneity and evolutionary dynamics on complex networks
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- Influence measures in subnetworks using vertex centrality
- Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations
- On the convergence of the minimally irreducible Markov chain method with applications to PageRank
- Local and consistent centrality measures in parameterized networks
- Subgraph centrality and walk-regularity
- Analysis of directed networks via the matrix exponential
- Network descriptors based on betweenness centrality and transmission and their extremal values
- Social interactions and the prophylaxis of SI epidemics on networks
- Edge modification criteria for enhancing the communicability of digraphs
- Risk-dependent centrality in economic and financial networks
- Updating and downdating techniques for optimizing network communicability
- Centrality analysis for modified lattices
- The deformed graph Laplacian and its applications to network centrality analysis
- What network topology can tell in election prediction
- Exploring the “Middle Earth” of network spectra via a Gaussian matrix function
- A Theory for Backtrack-Downweighted Walks
- Mittag-Leffler functions and their applications in network science
- Three hypergraph eigenvector centralities
- Accounting for the role of long walks on networks via a new matrix function
- Beyond non-backtracking: non-cycling network centrality measures
- Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization
- Non-backtracking alternating walks
- Eigenvector-based centrality measures for temporal networks
- Matrix functions in network analysis
- Centrality-Based Traffic Restriction in Delayed Epidemic Networks
- Sensitivity of Matrix Function Based Network Communicability Measures: Computational Methods and A Priori Bounds
- An Edge Centrality Measure Based on the Kemeny Constant
- Degree centrality and root finding in growing random networks
- A Fast Monte Carlo Algorithm for Evaluating Matrix Functions with Application in Complex Networks
- Branching processes reveal influential nodes in social networks
- Updating Katz centrality by counting walks
- Generic network sparsification via hybrid edge sampling
- Walk based Laplacians for modeling diffusion on complex networks
This page was built for publication: On the limiting behavior of parameter-dependent network centrality measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256535)
