Skip to main content
SpringerLink
Log in

Approximation and Updation of Betweenness Centrality in Dynamic Complex Networks

  • Conference paper
  • First Online:
Computational Intelligence: Theories, Applications and Future Directions - Volume I

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 798))

Abstract

A large network frequently evolves in nature; hence, it is necessary to update the betweenness centrality efficiently. Previously, the complexity for updated betweenness centrality is found \(O(n^3)\), where n is the number of the nodes in the network. It is hard to find a network with static size. To calculate, betweenness centrality for the evolving network is a nontrivial task due to high complexity. The betweenness centrality of all the nodes should be recomputed. Brendes proposed an algorithm for calculating updated betweenness centrality for the static networks with complexity, O(nm), where m is the total number of edges. A method QUBE was proposed which efficiently reduces the search space by finding candidate set of nodes and compute the betweenness centrality of the candidate nodes whose betweenness centrality need to be updated when any edge/node is inserted/deleted in the network. We have proposed a new algorithm which updates the betweenness centrality of a candidate set of nodes only with the approximation method. In the present investigations, a method is suggested to recompute the betweenness centrality for k number of nodes in the network, \((k < n)\), without actually recomputing the betweenness centrality for all the nodes. It is found that the time complexity of proposed algorithm is lower than the existing algorithms.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Brandes, U.: A faster algorithm for betweenness centrality. J. Math. Sociology pp. 163–177 (2001)

    Article  Google Scholar 

  2. Newman, M.E.: A measure of betweenness centrality based on random walks. Social networks pp. 39–54 (2005)

    Article  Google Scholar 

  3. Friedkin, N.E.: Theoretical foundations for centrality measures. Am. J. Sociology pp. 1478–1504 (1991)

    Article  Google Scholar 

  4. Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry pp. 35–41 (1977)

    Article  Google Scholar 

  5. Agarwal, M., Singh, R.R., Chaudhary, S., Iyengar, S.: Bolt: Efficient betweenness ordering in almost linear time. arXiv preprint arXiv:1409.6470 (2014)

  6. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to algorithm the mit press. Massachusetts, Cambridge (1990)

    MATH  Google Scholar 

  7. Pinney, J.W., Westhead, D.R.: Betweenness-based decomposition methods for social and biological networks. Interdisciplinary statistics and bioinformatics pp. 87–90 (2006)

    Google Scholar 

  8. Girvan, M., Newman, M.E.: Community structure in social and biological networks. Proceedings of the national academy of sciences pp. 7821–7826 (2002)

    Article  MathSciNet  Google Scholar 

  9. Bader, D.A., Kintali, S., Madduri, K., Mihail, M.: Approximating betweenness centrality. In: Algorithms and Models for the Web-Graph, pp. 124–137 (2007)

    Google Scholar 

  10. Gkorou, D., Pouwelse, J., Epema, D., Kielmann, T., van Kreveld, M., Niessen, W.: Efficient approximate computation of betweenness centrality. In: 16th Annual conference of the Advanced School for Computing and Imaging (ASCI 2010) (2010)

    Google Scholar 

  11. Goel, K., Singh, R.R., Iyengar, S., et al.: A faster algorithm to update betweenness centrality after node alteration. In: Algorithms and Models for the Web Graph, pp. 170–184 (2013)

    Google Scholar 

  12. Kas, M., Wachs, M., Carley, K.M., Carley, L.R.: Incremental algorithm for updating betweenness centrality in dynamically growing networks. In: Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining. pp. 33–40 (2013)

    Google Scholar 

  13. Nasre, M., Pontecorvi, M., Ramachandran, V.: Betweenness centrality-incremental and faster. Math. Found. Compu. Sci. 2014, 577–588 (2014)

    MathSciNet  MATH  Google Scholar 

  14. Riondato, M., Kornaropoulos, E.M.: Fast approximation of betweenness centrality through sampling. In: Proceedings of the 7th ACM International Conference on Web Search and Data Mining pp. 413–422 (2014)

    Google Scholar 

  15. Chehreghani, M.H.: An efficient algorithm for approximate betweenness centrality computation. Comput. J. p. bxu003 (2014)

    Google Scholar 

  16. Agarwal, M., Singh, R.R., Chaudhary, S., Iyengar, S.: An efficient estimation of a node’s betweenness. In: Complex Networks VI, pp. 111–121 (2015)

    Google Scholar 

  17. Lee, M.J., Lee, J., Park, J.Y., Choi, R.H., Chung, C.W.: Qube: a quick algorithm for updating betweenness centrality. In: Proceedings of the 21st international conference on World Wide Web. pp. 351–360 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, National Institute of Technology, Delhi, 110040, India

    Prity Kumari & Anurag Singh

Authors
  1. Prity Kumari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anurag Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Anurag Singh .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India

    Nishchal K. Verma

  2. Department of Aerospace Engineering, Indian Institute of Technology Kanpur, Kanpur, Uttar Pradesh, India

    A. K. Ghosh

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kumari, P., Singh, A. (2019). Approximation and Updation of Betweenness Centrality in Dynamic Complex Networks. In: Verma, N., Ghosh, A. (eds) Computational Intelligence: Theories, Applications and Future Directions - Volume I. Advances in Intelligent Systems and Computing, vol 798. Springer, Singapore. https://doi.org/10.1007/978-981-13-1132-1_3

Download citation

Publish with us

Policies and ethics

Search

Navigation