Approximating Betweenness Centrality in Large Evolving Networks

@article{Bergamini2015ApproximatingBC,
  title={Approximating Betweenness Centrality in Large Evolving Networks},
  author={E. Bergamini and Henning Meyerhenke and C. Staudt},
  journal={ArXiv},
  year={2015},
  volume={abs/1409.6241}
}
  • E. Bergamini, Henning Meyerhenke, C. Staudt
  • Published 2015
  • Mathematics, Computer Science, Physics
  • ArXiv
  • Betweenness centrality ranks the importance of nodes by their participation in all shortest paths of the network. Therefore computing exact betweenness values is impractical in large networks. For static networks, approximation based on randomly sampled paths has been shown to be significantly faster in practice. However, for dynamic networks, no approximation algorithm for betweenness centrality is known that improves on static recomputation. We address this deficit by proposing two… CONTINUE READING
    52 Citations
    Approximating Betweenness Centrality in Fully Dynamic Networks
    • 21
    • PDF
    Scaling Betweenness Centrality in Dynamic Graphs
    • A. Tripathy, Oded Green
    • Computer Science
    • 2018 IEEE High Performance extreme Computing Conference (HPEC)
    • 2018
    • 1
    Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
    • 24
    • PDF
    Improving the Betweenness Centrality of a Node by Adding Links
    • 16
    • PDF
    Fully Dynamic Betweenness Centrality Maintenance on Massive Networks
    • 38
    • Highly Influenced
    • PDF
    Fast approximation of betweenness centrality through sampling
    • 98
    • PDF

    References

    SHOWING 1-10 OF 27 REFERENCES
    Approximating Betweenness Centrality
    • 301
    • PDF
    Fast approximation of betweenness centrality through sampling
    • 60
    • Highly Influential
    A Fast Algorithm for Streaming Betweenness Centrality
    • Oded Green, R. McColl, David A. Bader
    • Mathematics, Computer Science
    • 2012 International Conference on Privacy, Security, Risk and Trust and 2012 International Confernece on Social Computing
    • 2012
    • 84
    • Highly Influential
    • PDF
    Betweenness Centrality - Incremental and Faster
    • 42
    • Highly Influential
    • PDF
    Better Approximation of Betweenness Centrality
    • 206
    • PDF
    Incremental algorithm for updating betweenness centrality in dynamically growing networks
    • 60
    • PDF
    QUBE: a quick algorithm for updating betweenness centrality
    • 86
    • PDF
    Scalable online betweenness centrality in evolving graphs
    • 62
    • Highly Influential
    • PDF
    Centrality Estimation in Large Networks
    • 288
    • PDF
    A faster algorithm for betweenness centrality
    • 3,139
    • Highly Influential
    • PDF