A variant of the current flow betweenness centrality and its application in urban networks

DOI10.1016/j.amc.2018.11.032zbMath1428.90029OpenAlexW2902685460WikidataQ128822582 ScholiaQ128822582MaRDI QIDQ2008542

Leandro Tortosa, Taras Agryzkov, José-Francisco Vicent

Publication date: 26 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/87150

zbMATH Keywords

spatial networksrandom-walk betweennessurban networkscurrent flow betweennessurban centrality measures

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items

Graph regularization centrality ⋮ Extending the Adapted PageRank Algorithm centrality model for urban street networks using non-local random walks ⋮ A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game

Cites Work

• An algorithm for ranking the nodes of an urban network based on the concept of PageRank vector
• Network analysis. Methodological foundations.
• Identification of influential spreaders based on classified neighbors in real-world complex networks
• Social Network Data Analytics
• Approximations of the Generalized Inverse of the Graph Laplacian Matrix
• STACS 2005
• A Recurring Theorem on Determinants