2016/07/01 by Onuttom Narayan, Narayan, O., Iraj Saniee +1
Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Physical sciences #Opinion Dynamics and Social Influence #Physics and Society (physics.soc-ph) #Statistical Mechanics (cond-mat.stat-mech) #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.1607.00121
openalex publication_date 2016/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The betweenness centrality of graphs using random walk paths instead of geodesics is studied. A scaling collapse with no adjustable parameters is obtained as the graph size N is varied; the scaling curve depends on the graph model. A normalized random betweenness, that counts each walk passing through a node only once, is also defined. It is argued to be more useful and seen to have simpler scaling behavior. In particular, the probability for a random walk on a preferential attachment graph to pass through the root node is found to tend to unity as N→∞.