CENTRALITY ESTIMATION IN LARGE NETWORKS

DOI10.1142/S0218127407018403zbMath1163.68310MaRDI QIDQ5900142

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

Publication date: 4 July 2008

Published in: International Journal of Bifurcation and Chaos (Search for Journal in Brave)

zbMATH Keywords

network vulnerabilitysubway networksnetwork costNetwork efficiency

Mathematics Subject Classification ID

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

Related Items (9)

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 ⋮ Analytical estimates and proof of the scale-free character of efficiency and improvement in Barabási-Albert trees ⋮ Evolving efficiency and robustness of the international oil trade network ⋮ The road most travelled: the impact of urban road infrastructure on supply chain network vulnerability ⋮ A Faster Algorithm to Update Betweenness Centrality After Node Alteration ⋮ The synchronized dynamics of time-varying networks ⋮ Approximating Betweenness Centrality in Fully Dynamic Networks ⋮ Transferability of collective transportation line networks from a topological and passenger demand perspective

Cites Work

• The centrality index of a graph
• The degree sequence of a scale-free random graph process
• A faster algorithm for betweenness centrality*
• Authoritative sources in a hyperlinked environment
• Fast Approximation of Centrality
• Collective dynamics of ‘small-world’ networks
• Random Graphs
• Unnamed Item

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