On the Limiting Behavior of Parameter-Dependent Network Centrality Measures

DOI10.1137/130950550zbMath1314.05113arXiv1312.6722OpenAlexW3106147091WikidataQ56486273 ScholiaQ56486273MaRDI QIDQ5256535

Christine Klymko, Michele Benzi

Publication date: 18 June 2015

Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.6722

zbMATH Keywords

adjacency matrixspectral gapnetwork analysismatrix functionscentralityPageRankcommunicability

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Matrix exponential and similar functions of matrices (15A16)

Related Items (35)

On the convergence of the minimally irreducible Markov chain method with applications to PageRank ⋮ Gaussianization of the spectra of graphs and networks. Theory and applications ⋮ Updating and Downdating Techniques for Optimizing Network Communicability ⋮ Influence measures in subnetworks using vertex centrality ⋮ Local community detection in dynamic graphs using personalized centrality ⋮ Social interactions and the prophylaxis of SI epidemics on networks ⋮ On the exponential generating function for non-backtracking walks ⋮ Centrality Analysis for Modified Lattices ⋮ Subgraph centrality and walk-regularity ⋮ 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 ⋮ Analysis of directed networks via the matrix exponential ⋮ An Edge Centrality Measure Based on the Kemeny Constant ⋮ The Deformed Graph Laplacian and Its Applications to Network Centrality Analysis ⋮ On the \(\alpha\)-nonbacktracking centrality for complex networks: existence and limit cases ⋮ Risk-Dependent Centrality in Economic and Financial Networks ⋮ Vertex distinction with subgraph centrality: a proof of Estrada's conjecture and some generalizations ⋮ What network topology can tell in election prediction ⋮ Walk entropy and walk-regularity ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Accounting for the role of long walks on networks via a new matrix function ⋮ Beyond non-backtracking: non-cycling network centrality measures ⋮ Tackling information asymmetry in networks: a new entropy-based ranking index ⋮ Eigenvector-Based Centrality Measures for Temporal Networks ⋮ Orthogonal expansion of network functions ⋮ Edge Modification Criteria for Enhancing the Communicability of Digraphs ⋮ Functionability in complex networks: Leading nodes for the transition from structural to functional networks through remote asynchronization ⋮ Strategic connections in a hierarchical society: wedge between observed and fundamental valuations ⋮ Structural heterogeneity and evolutionary dynamics on complex networks ⋮ Non-Backtracking Alternating Walks ⋮ Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels ⋮ A Theory for Backtrack-Downweighted Walks ⋮ Mittag--Leffler Functions and their Applications in Network Science ⋮ Three Hypergraph Eigenvector Centralities

Uses Software

• sgcen

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local estimates for eigenvector-like centralities of complex networks
• Quadrature rule-based bounds for functions of adjacency matrices
• Ranking hubs and authorities using matrix functions
• On the properties of von Neumann kernels for link analysis
• Network analysis. Methodological foundations.
• Complex networks: structure and dynamics
• A new status index derived from sociometric analysis
• Network Analysis via Partial Spectral Factorization and Gauss Quadrature
• Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores
• Network Properties Revealed through Matrix Functions
• Random Alpha PageRank
• Sensitivity and Stability of Ranking Vectors
• Authoritative sources in a hyperlinked environment
• Analyzing complex networks through correlations in centrality measurements
• Functional centrality in graphs
• Dynamical Processes on Complex Networks
• The Structure and Function of Complex Networks
• Link Analysis: Hubs and Authorities on the World Wide Web
• Block Gauss and Anti-Gauss Quadrature with Application to Networks
• Functions of Matrices
• Limits and the Index of a Square Matrix
• Networks

This page was built for publication: On the Limiting Behavior of Parameter-Dependent Network Centrality Measures