Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications pp 323–332Cite as

Neighborhood Topology to Discover Influential Nodes in a Complex Network

  • Conference paper
  • First Online:

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

Abstract

This paper addresses the issue of distinguishing influential nodes in the complex network. The k-shell index features embeddedness of a node in the network based upon its number of links with other nodes. This index filters out the most influential nodes with higher values for this index, however, fails to discriminate their scores with good resolution, hence results in assigning same scores to the nodes belonging to same k-shell set. Extending this index with neighborhood coreness of a node and also featuring topological connections between its neighbors, our proposed method can express the nodes influence score precisely and can offer distributed and monotonic rank orders than other node ordering methods.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. Tan, Y.J., Wu, J. and Deng, H.Z.: Evaluation method for node importance based on node contraction in complex networks. Systems Engineering-Theory & Practice, 11(11), pp. 79–83(2006).

    Google Scholar 

  2. Wang, L. and Zhang, J.J.: Centralization of complex networks. Complex systems and complexity science, 3(1), pp. 13–20 (2006).

    Google Scholar 

  3. He, N., Li, D.Y., Gan, W. and Zhu, X.: Mining vital nodes in complex networks. Computer Science, 34(12), pp. 1–5 (2007).

    Google Scholar 

  4. Sun, R. and Luo, W.B.: Review on evaluation of node importance in public opinion. Jisuanji Yingyong Yanjiu, 29(10), pp. 3606–3608 (2012).

    Google Scholar 

  5. Kitsak, M., Gallos, L.K., Havlin, S., Liljeros, F., Muchnik, L., Stanley, H.E. and Makse, H.A.: Identification of influential spreaders in complex networks. Nature physics, 6(11), pp. 888–893 (2010).

    Google Scholar 

  6. Jiang, X., Sun, X. and Zhuge, H.: Graph-based algorithms for ranking researchers: not all swans are white!. Scientometrics, 96(3), pp. 743–759 (2013).

    Google Scholar 

  7. Lü, L., Zhang, Y.C., Yeung, C.H. and Zhou, T.: Leaders in social networks, the delicious case. PloS one, 6(6), p.e21202 (2011).

    Google Scholar 

  8. Albert, R., Jeong, H. and Barabási, A.L.: Error and attack tolerance of complex networks. Nature, 406(6794), pp. 378–382 (2000).

    Google Scholar 

  9. Feng, X., Sharma, A., Srivastava, J., Wu, S. and Tang, Z.: Social network regularized Sparse Linear Model for Top-N recommendation. Engineering Applications of Artificial Intelligence, 51, pp. 5–15 (2016).

    Google Scholar 

  10. Ma, L.L., Ma, C. and Zhang, H.F.: Identifying influential spreaders in complex networks based on gravity formula. arXiv preprint arXiv:1505.02476 (2015).

  11. Page, L., Brin, S., Motwani, R. and Winograd, T.: The PageRank Citation Ranking: Bringing Order to the Web (1999). In Stanford InfoLab.

    Google Scholar 

  12. Kleinberg, J.M.: Authoritative sources in a hyperlinked environment. Journal of the ACM (JACM), 46(5), pp. 604–632 (1999).

    Google Scholar 

  13. Chen, D., Lü, L., Shang, M.S., Zhang, Y.C. and Zhou, T.: Identifying influential nodes in complex networks. Physica a: Statistical mechanics and its applications, 391(4), pp. 1777–1787 (2012).

    Google Scholar 

  14. Zeng, A. and Zhang, C.J.: Ranking spreaders by decomposing complex networks. Physics Letters A, 377(14), pp. 1031–1035 (2013).

    Google Scholar 

  15. Liu, J.G., Ren, Z.M. and Guo, Q.: Ranking the spreading influence in complex networks. Physica A: Statistical Mechanics and its Applications, 392(18), pp. 4154–4159 (2013).

    Google Scholar 

  16. Bae, J. and Kim, S.: Identifying and ranking influential spreaders in complex networks by neighborhood coreness. Physica A: Statistical Mechanics and its Applications, 395, pp. 549–559 (2014).

    Google Scholar 

  17. Gao, S., Ma, J., Chen, Z., Wang, G. and Xing, C.: Ranking the spreading ability of nodes in complex networks based on local structure. Physica A: Statistical Mechanics and its Applications, 403, pp. 130–147 (2014).

    Google Scholar 

  18. Lawyer, G.: Understanding the influence of all nodes in a network. Scientific Reports, (2015) 5.

    Google Scholar 

  19. Narayanam, R. and Narahari, Y.: A shapley value-based approach to discover influential nodes in social networks. Automation Science and Engineering, IEEE Transactions on, 8(1), pp. 130–147 (2011).

    Google Scholar 

  20. Keeling, M.J. and Eames, K.T.: Networks and epidemic models. Journal of the Royal Society Interface, 2(4), pp. 295–307 (2005).

    Google Scholar 

  21. Albert, R. and Barabási, A.L.: Statistical mechanics of complex networks. Reviews of modern physics, 74(1), (2002), p. 47.

    Google Scholar 

  22. Sabidussi, G.: The centrality index of a graph. Psychometrika, 31(4), pp. 581–603 (1966).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Jamia Millia Islamia, New Delhi, India

    Chandni Saxena, M. N. Doja & Tanvir Ahmad

Authors
  1. Chandni Saxena
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. N. Doja
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tanvir Ahmad
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Chandni Saxena or Tanvir Ahmad .

Editor information

Editors and Affiliations

  1. ANITS, Prof., Comp. Sci. & Engg. Dept. ANITS, Visakhapatnam, Andhra Pradesh, India

    Suresh Chandra Satapathy

  2. Dept. of ECE, Shri Ramswaroop Mem. Group of Prof. Clg Dept. of ECE, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

  3. SCIS, University of Hyderabad , Hyderabad, India

    Siba K. Udgata

  4. KIIT University, School of Computer Engineering KIIT University, Bhubaneswar, Odisha, India

    Prasant Kumar Pattnaik

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Saxena, C., Doja, M.N., Ahmad, T. (2017). Neighborhood Topology to Discover Influential Nodes in a Complex Network. In: Satapathy, S., Bhateja, V., Udgata, S., Pattnaik, P. (eds) Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications . Advances in Intelligent Systems and Computing, vol 515. Springer, Singapore. https://doi.org/10.1007/978-981-10-3153-3_32

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3153-3_32

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3152-6

  • Online ISBN: 978-981-10-3153-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation