Advertisement

A Centrality Measure for Directed Networks: m-Ranking Method

  • Reji Kumar
  • Shibu Manuel
Chapter
Part of the Lecture Notes in Social Networks book series (LNSN)

Abstract

Understanding the importance of actors (or nodes) in complex networks is an area in social network research. Importance of nodes is interpreted in different ways in different context. If the focus of research is on the spreading of information, then nodes which can spread information throughout the network in a faster pace than any other nodes is important. In the study of spread of disease or virus in a network, the nodes which are at minimum distance from all other nodes are most important. Depending upon the number of direct and indirect connections that each node has in a network, its participation in the spreading varies. Indirect connections specify the nodes that are at two steps, three steps, etc., away from a node. Research for potential spreaders in undirected networks is almost saturated. But in the study of spreading of information, directed networks are more important than undirected networks. In section two of this paper we review some widely used methods to identify important nodes in an undirected network. We also discuss methods which produce similar results for directed networks as well. Wherever necessary we make comparisons of the methods and point out advantages of one method over the other. In section three we propose a method that helps to rank the nodes in a directed network, which takes into account the relative importance of all nodes and directed edges in it.

Notes

Acknowledgements

The first author acknowledges the financial support given by UGC by sanctioning the major research project No. 40-243/2011 SR.

References

  1. 1.
    F. Brauer, P. van den Driessche, J. Wu (eds.), Mathematical Epidemiology (Springer, Berlin, 2008)Google Scholar
  2. 2.
    F.B. Cohen, A Short Course on Computer Virus (Wiley, New York, 1994)Google Scholar
  3. 3.
    N. Deo, Graph Theory with Applications to Engineering and Computer Science (PHI, New Delhi, 1997)Google Scholar
  4. 4.
    L.C. Freeman, A set of measures of centrality based on betweenness. Sociometry 40, 35–41 (1977)CrossRefGoogle Scholar
  5. 5.
    L.C. Freeman, Centrality in social networks conceptual clarification. Soc. Netw. 1(3), 215–239 (1979)CrossRefGoogle Scholar
  6. 6.
    A. Garas, F. Schweitzer, S. Havlin, A k-shell decomposition for weighted networks. New J. Phys. 14 (2012). http://dx.doi.org/10.1088/1367-2630/14/8/083030
  7. 7.
    E. Katz, P.F. Lazarsfield, Personal Influence: The Part Played by People in the Flow of Mass Communications (New Brunswick, Transaction Publishers, 1955)Google Scholar
  8. 8.
    J.O. Kephart, G.B. Sorkin, D.M. Chess, S.R. White, Fighting computer viruses. Sci. Am. 277(5), 56–61 (1997)CrossRefGoogle Scholar
  9. 9.
    M. Kitsak, L.K. Gallos, S. Havlin, F. Liljeros, L. Muchnik, H.E. Stanley, H.A. Makse, Identification of influential spreaders in complex networks. Nat. Phys. 6(11), 888–893 (2010)CrossRefGoogle Scholar
  10. 10.
    J. Liu, Z. Ren, Ranking the spreading influence in complex networks. Physica A 392, 4154–4159 (2013)CrossRefGoogle Scholar
  11. 11.
    S. Manuel, K. Reji Kumar, An improved k-shell decomposition for complex networks based on potential edge weights. Int. J. Appl. Math. Sci. 9(2), 163–168 (2016)Google Scholar
  12. 12.
    M.E.J. Newman, Spread of epidemic disease on networks, Phys. Rev. E 66(1), 016–128 (2002)CrossRefGoogle Scholar
  13. 13.
    T. Opsahl, F. Agneessens, Node centrality in weighted networks: generalizing degree and shortest paths. Soc. Netw. 32, 245–251 (2010)CrossRefGoogle Scholar
  14. 14.
    K. Reji Kumar, S. Manuel, Spreading information in complex networks: a modified method, in Proceedings of International Conference on Emerging Technological Trends, ICETT 2016, Bangalore, IEEE Digital Explore LibraryGoogle Scholar
  15. 15.
    K. Reji Kumar, S. Manuel, The m-ranking of nodes in complex networks, in Proceedings of COMSNETS 2017, Bangalore, IEEE Digital Explore LibraryGoogle Scholar
  16. 16.
    O. Sims, R.P. Gilles, Critical nodes in directed networks, 1 Feb 2014. arXiv:1401.0655v2 [cs.SI]Google Scholar
  17. 17.
    Z. Wang, Y. Zhao, Fast ranking influential nodes in complex networks using a k-shell iteration factor. Phys. A 461, 171–181 (2016)CrossRefGoogle Scholar
  18. 18.
    B. Wei, J. Liu, Y. Deng, Weighted k-shell decomposition for complex networks based on potential edge weights. Physica A 420, 277–285 (2015)CrossRefGoogle Scholar
  19. 19.
    D.B. West, Introduction to Graph Theory (Prentice Hall, New Delhi, 2006)Google Scholar
  20. 20.
    D.R. White, S.P. Borgatti, Betweenness centrality measures for directed graphs. Soc. Netw. 16, 335–346 (1994)CrossRefGoogle Scholar
  21. 21.
    A. Zeng, C. Zhang, Ranking spreaders by decomposing complex networks. Phys. Lett. A 377, 1031–1035 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2019

Authors and Affiliations

  • Reji Kumar
    • 1
  • Shibu Manuel
    • 2
  1. 1.P. G. Department of MathematicsN. S. S. CollegeCherthalaIndia
  2. 2.Department of MathematicsSt. Dominic’s CollegeKanjirapallyIndia

Personalised recommendations