CENTRALITY ESTIMATION IN LARGE NETWORKS

DOI10.1142/S0218127407018403MaRDI QIDQ5900142zbMATH OpenFDO

Authors Regino Criado, Benito Hernández-Bermejo, Miguel Romance

Publication date 4 July 2008

Published in International Journal of Bifurcation and Chaos in Applied Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0218127407018403

zbMATH Keywords

network costNetwork efficiencynetwork vulnerabilitysubway networks

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Network design and communication in computer systems (68M10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Stochastic network models in operations research (90B15)

Recommendations

• Time-based estimation of vulnerable points in the Munich subway network
• Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information
• Scale-free analysis of subway networks
• Rapid transit network design considering risk aversion

Cites work

• A faster algorithm for betweenness centrality*
• Authoritative sources in a hyperlinked environment
• Collective dynamics of `small-world' networks
• Fast Approximation of Centrality
• scientific article; zbMATH DE number 3691151 (Why is no real title available?)
• Random Graphs
• The centrality index of a graph
• The degree sequence of a scale-free random graph process

Cited in

(21)

• Efficiency of star-like graphs and the Atlanta subway network
• Is the Boston subway a small-world network?
• The synchronized dynamics of time-varying networks
• Complex Network analysis of the robustness of the Hanoi, Vietnam bus network
• Transferability of collective transportation line networks from a topological and passenger demand perspective
• Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information
• Structural vulnerability and robustness in complex networks: different approaches and relationships between them
• Real world graph efficiency
• Information transfer efficiency based small-world assessment methodology for metro networks
• A NODE-BASED MULTISCALE VULNERABILITY OF COMPLEX NETWORKS
• Time-based estimation of vulnerable points in the Munich subway network
• A faster algorithm to update betweenness centrality after node alteration
• Safety and efficiency analysis of a railway network
• Evolving efficiency and robustness of the international oil trade network
• Scale-free analysis of subway networks
• Approximating Betweenness Centrality in Fully Dynamic Networks
• Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees
• The road most travelled: the impact of urban road infrastructure on supply chain network vulnerability
• Robustness assessment of public transport networks in various graph representations: systematic review, decision support, and case study
• Compared analysis of metro networks supported by graph theory
• Asymptotic estimates for efficiency, vulnerability and cost for random networks

This page was built for publication: CENTRALITY ESTIMATION IN LARGE NETWORKS

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