CENTRALITY ESTIMATION IN LARGE NETWORKS

DOI10.1142/S0218127407018403zbMath1143.05304MaRDI QIDQ5900143

Ulrik Brandes, Christian Pich

Publication date: 4 July 2008

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

zbMATH Keywords

complex networksapproximate computationbetweenness centrality

Mathematics Subject Classification ID

Applications of graph theory (05C90) Neural networks for/in biological studies, artificial life and related topics (92B20) Equilibrium statistical mechanics (82B99) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

The parallel computing of node centrality based on GPU ⋮ Fully-Dynamic Approximation of Betweenness Centrality ⋮ Effect of linear mixing in EEG on synchronization and complex network measures studied using the Kuramoto model ⋮ Local community detection in dynamic graphs using personalized centrality ⋮ A Faster Algorithm to Update Betweenness Centrality after Node Alteration ⋮ Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter ⋮ Some results on approximate 1-median selection in metric spaces ⋮ Heuristical top-\(k\): fast estimation of centralities in complex networks ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ Fast approximation of betweenness centrality through sampling ⋮ Efficient algorithms for updating betweenness centrality in fully dynamic graphs ⋮ Efficient Computation of Time-Dependent Centralities in Air Transportation Networks ⋮ Incorporating auxiliary information in betweenness measure for input-output networks

Cites Work

• Unnamed Item
• 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