An Edge Centrality Measure Based on the Kemeny Constant

DOI10.1137/22m1486728zbMath1516.05201arXiv2203.06459MaRDI QIDQ6158484

Unnamed Author, Dario Andrea Bini, Beatrice Meini, Unnamed Author, Federico Poloni

Publication date: 31 May 2023

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

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

zbMATH Keywords

Markov chainKemeny constantnetwork theorycentrality measure

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Distance in graphs (05C12) Connectivity (05C40)

Related Items

On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limits for the characteristic roots of a matrix. VII
• Quadrature rule-based bounds for functions of adjacency matrices
• A note on finding the bridges of a graph
• Ranking hubs and authorities using matrix functions
• Edge importance in a network via line graphs and the matrix exponential
• On randomized trace estimates for indefinite matrices with an application to determinants
• Handbook of Linear Algebra
• A Google-like model of road network dynamics and its application to regulation and control
• Kemeny's Constant and the Random Surfer
• Community structure in social and biological networks
• Analysis of Markov Influence Graphs
• On the Limiting Behavior of Parameter-Dependent Network Centrality Measures
• Über ein Paradoxon aus der Verkehrsplanung
• STACS 2005
• Traffic modelling framework for electric vehicles