Incorporating auxiliary information in betweenness measure for input-output networks

DOI10.1016/J.PHYSA.2022.128200MaRDI QIDQ2096770zbMATH OpenOpenAlexFDO

Authors Shiying Xiao, Jun Yan, Panpan Zhang

Publication date 11 November 2022

Published in Physica A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.physa.2022.128200

zbMATH Keywords

auxiliary informationbetweenness centralityDijkstra's algorithminput-output analysisstrongest pathsupply chain

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Statistical mechanics, structure of matter (82-XX)

Recommendations

• Assortativity measures for weighted and directed networks
• Dynamical topology of highly aggregated input-output networks
• Centrality measures in networks
• Input–output-based measures of systemic importance
• New Centrality Measures in Networks

Cites work

• A faster algorithm for betweenness centrality*
• A note on two problems in connexion with graphs
• Approximating Betweenness Centrality
• Better approximation of betweenness centrality
• CENTRALITY ESTIMATION IN LARGE NETWORKS
• Dynamical topology of highly aggregated input-output networks
• Fast approximation of betweenness centrality through sampling
• Input-Output Analysis
• Input-output networks offer new insights of economic structure
• KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation
• Stability and Continuity of Centrality Measures in Weighted Graphs

Cited in

(2)

• ionet
• Rank-based assortativity for weighted, directed networks

Describes a project that uses

Uses Software

• KADABRA
• R
• GitHub

This page was built for publication: Incorporating auxiliary information in betweenness measure for input-output networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096770)