Skip to main content
SpringerLink
Log in

Link segmentation entropy for measuring the network complexity

  • Original Article
  • Published:
Social Network Analysis and Mining Aims and scope Submit manuscript

Abstract

Measuring the network complexity has been addressed in many studies in graph theory. In the context of complex networks, a class of complexity measures has been proposed based on structure entropy. Although the proposed measures can quantify the complexity of different networks, they are mainly focused on the nodes structural properties and ignore the links information. This is while the link analysis plays a crucial role in studying and comprehension of different types of complex networks. In this paper, we propose to employ the similarity-based link prediction measures to capture the links information and quantify it as an entropy measure. The findings of the experimental study based on several synthetic as well as real-world networks demonstrate the validity and effectiveness of the proposed complexity measure.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  • Adamic Lada A, Adar Eytan (2003) Friends and neighbors on the web. Soc netw 25(3):211–230

    Article  Google Scholar 

  • Ahmad Iftikhar et al (2020) Missing link prediction using common neighbor and centrality based parameterized algorithm. Sci rep 10(1):1–9

    MathSciNet  Google Scholar 

  • Albert Réka, Barabási Albert-László (2002) Statistical mechanics of complex networks. Reviews of modern physics 74(1):47

    Article  MathSciNet  MATH  Google Scholar 

  • Anwar, Raheel, Muhammad Irfan Yousuf, and Muhammad Abid. (2021) Uniform Preferential Selection Model for Generating Scale-free Networks. Methodology and Computing in Applied Probability : 1-22

  • Backes André Ricardo, Casanova Dalcimar, Bruno Odemir Martinez (2013) Texture analysis and classification: A complex network-based approach. Inform Sci 219:168–180

    Article  Google Scholar 

  • Barabâsi Albert-Laszlo et al (2002) Evolution of the social network of scientific collaborations. Phys A: Stat mech its appl 311(3–4):590–614

    Article  MathSciNet  MATH  Google Scholar 

  • Bonchev, Danail, and Gregory A. Buck. 2005 Quantitative measures of network complexity. Complexity in chemistry biology and ecology. Springer Boston MA: 191-235

  • Duan Shuyu, Wen Tao, Jiang Wen (2019) A new information dimension of complex network based on Rényi entropy. Phys A: Stat Mech its Appl 516:529–542

    Article  MATH  Google Scholar 

  • Elahe Nasiri, Kamal Berahmand, Yuefeng Li (2021) A new link prediction in multiplex networks using topologically biased random walks. Chaos Solitons Fractals 151:111230

    Article  Google Scholar 

  • Fan, Changjun, et al. 2019 Learning to identify high betweenness centrality nodes from scratch: A novel graph neural network approach. Proceedings of the 28th ACM International Conference on Information and Knowledge Management

  • Gomez-Pilar Javier et al (2018) Quantification of graph complexity based on the edge weight distribution balance: application to brain networks. Int j neural syst 28(01):1750032

    Article  Google Scholar 

  • Goryashko Alexander, Samokhine Leonid, Bocharov Pavel (2019) About complexity of complex networks. Appl Net Sci 4(1):1–21

    Google Scholar 

  • Hahn Klaus, Massopust Peter R, Prigarin Sergei (2016) A new method to measure complexity in binary or weighted networks and applications to functional connectivity in the human brain. BMC bioinform 17(1):1–18

    Article  Google Scholar 

  • Huang Zhiming, Yang Lin, Jiang Wen (2019) Uncertainty measurement with belief entropy on the interference effect in the quantum-like Bayesian networks. Appl Math Comput 347:417–428

    MathSciNet  MATH  Google Scholar 

  • Kumar Ajay et al (2020) Link prediction techniques, applications, and performance: A survey. Phys A: Stat Mech its Appl 553:124289

    Article  MathSciNet  MATH  Google Scholar 

  • Lei Mingli, Liu Lirong, Wei Daijun (2019) An improved method for measuring the complexity in complex networks based on structure entropy. IEEE Access 7:159190–159198

    Article  Google Scholar 

  • Lin Dan et al (2020) Modeling and understanding ethereum transaction records via a complex network approach. IEEE Transact Circuit Syst II Express Briefs 67(11):2737–2741

    Google Scholar 

  • Linyuan Lü, Ci-Hang Jin, Tao Zhou (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E 80(4):046122

    Article  Google Scholar 

  • Ma Tinghuai et al (2020) LGIEM: Global and local node influence based community detection. Future Genera Comput Syst 105:533–546

    Article  Google Scholar 

  • Meng Cai, Ying Cui, Stanley H (2017) Eugene stanley analysis and evaluation of the entropy indices of a static network structure. Sci rep 7(1):1–10

    Google Scholar 

  • Morzy, Mikołaj, Tomasz Kajdanowicz, and Przemysław Kazienko. (2017) On measuring the complexity of networks: Kolmogorov complexity versus entropy. Complexity 2017

  • Rajaram Rajeev, Castellani Brian (2016) An entropy based measure for comparing distributions of complexity. Phys A: Stat Mech its Appl 453:35–43

    Article  MathSciNet  MATH  Google Scholar 

  • Rubinov Mikail, Sporns Olaf (2010) Complex network measures of brain connectivity: uses and interpretations. Neuroimage 52(3):1059–1069

    Article  Google Scholar 

  • Shakibian Hadi, Charkari Nasrollah Moghadam (2018) Statistical similarity measures for link prediction in heterogeneous complex networks. Phys a: Stat mech its appl 501:248–263

    Article  Google Scholar 

  • Shakibian Hadi, Charkari Nasrollah Moghadam, Jalili Saeed (2018) Multi-kernel one class link prediction in heterogeneous complex networks. Appl Intel 48(10):3411–3428

    Article  Google Scholar 

  • Sneddon Robert (2007) The tsallis entropy of natural information. Phys A: Stat Mech its Appl 386(1):101–118

    Article  Google Scholar 

  • Tao Wen, Wen Jiang (2019) Measuring the complexity of complex network by Tsallis entropy. Phys A: Stat Mech its Appl 526:121054

    Article  Google Scholar 

  • Wang Bing et al (2006) Entropy optimization of scale-free networks’ robustness to random failures. Phys A: Stat Mech its Appl 363(2):591–596

    Article  Google Scholar 

  • Wang Bing et al (2021) A new structure entropy of complex networks based on nonextensive statistical mechanics and similarity of nodes. Math Biosci Eng 18(4):3718–3732

    Article  MATH  Google Scholar 

  • Wen Tao, Jiang Wen (2018) An information dimension of weighted complex networks. Phys A: Stat Mech its Appl 501:388–399

    Article  MathSciNet  MATH  Google Scholar 

  • Wu Yue et al (2013) Local shannon entropy measure with statistical tests for image randomness. Inform Sci 222:323–342

    Article  MathSciNet  MATH  Google Scholar 

  • Yin Likang, Deng Yong (2018) Toward uncertainty of weighted networks: An entropy-based model. Phys A: Stat Mech its Appl 508:176–186

    Article  Google Scholar 

  • Zenil Hector, Kiani Narsis A, Tegnér Jesper (2018) A review of graph and network complexity from an algorithmic information perspective. Entropy 20(8):551

    Article  Google Scholar 

  • Zhang Qi, Li Meizhu, Deng Yong (2016) A new structure entropy of complex networks based on nonextensive statistical mechanics. Int J Mod Phys C 27(10):1650118

    Article  MathSciNet  Google Scholar 

  • Zhang, Qi, Meizhu Li, and Yong Deng. (2014) A betweenness structure entropy of complex networks. arXiv preprint arXiv:1407.0097

  • Zhou Tao, Lú Linyuan, Zhang Yi-Cheng (2009) Predicting missing links via local information. Europ Phys J B 71(4):623–630

    Article  MATH  Google Scholar 

  • Zhu Qian et al (2018) Optimization of cascading failure on complex network based on NNIA. Phys A: Stat Mech its Appl 501:42–51

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Faculty of Engineering, Alzahra University, Tehran, Iran

    Hadi Shakibian

  2. Faculty of Electrical and Computer Engineering, Tarbiat Modares University, Tehran, Iran

    Nasrollah Moghadam Charkari

Authors
  1. Hadi Shakibian
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nasrollah Moghadam Charkari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hadi Shakibian.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shakibian, H., Charkari, N.M. Link segmentation entropy for measuring the network complexity. Soc. Netw. Anal. Min. 12, 85 (2022). https://doi.org/10.1007/s13278-022-00918-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13278-022-00918-4

Keywords

Search

Navigation