A measure of betweenness centrality based on random walks

2005/01/01 by M.E. J. Newman · 10 citations

paper · doi:10.1016/j.socnet.2004.11.009

Cited by

• Cortical mechanisms for transsaccadic vision: Extrinsic and intrinsic feature updating
• Enhanced Pruning for Distributed Closeness Centrality under Multi-Packet Messaging
• Efficient Algorithms for Computing Random Walk Centrality
• Evolution of Conditional Entropy for Diffusion Dynamics on Graphs
• UniqueRank: Identifying Important and Difficult-to-Replace Nodes in Attributed Graphs
• Perception of own centrality in social networks
• Predicting First-Passage Dynamics in Disordered Systems Exactly: Application to Sparse Networks
• Prioritising domestic locations for marine biosecurity management within a regional vessel network
• Semantic Network Analysis of Achievement Standards in Physics of 2022 Revised Curriculum
• INSPIRE-GNN: Intelligent Sensor Placement to Improve Sparse Bicycling Network Prediction via Reinforcement Learning Boosted Graph Neural Networks