Research on Shortest Paths-Based Entropy of Weighted Complex Networks

  • Zundong Zhang
  • Zhaoran Zhang
  • Weixin Ma
  • Huijuan Zhou
Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 482)


In order to provide a new measure for the structural characteristics of complex networks, a new shortest paths-based entropy (SPE) is proposed to describe the influence of degree and shortest path on network characteristics in this paper . The novel measurement based on shortest paths of node pairs and weights of edges. Many different approaches to measuring the complexity of networks have been developed. Most existing measurements unable to apply in weighted network that consider only one characteristic of complex networks such as degree or betweenness centrality. To some extent, the shortest paths-based entropy overcome the inadequacies of other network entropy descriptors. The method combines node degrees with shortest paths. For the purpose of proving the reasonableness of this method, we carry on a contrast analysis of the SPEs of different type networks, including: ER random network, BA scale-free network, WS small-world network and grid network. The results show that shortest paths-based entropy of complex networks is meaningful to evaluation of networks.


Complex networks Contrast analysis Shortest Paths-based entropy (SPE) 



This paper is supported by The Chinese the State 13 Five-year Scientific and Technological Support Project (2016YFB1200402), The Big-Data Based Beijing Road Traffic Congestion Reduction Decision Support Project (PXM2016014212000036) and The Project of The Innovation and Collaboration Capital Center for World Urban Transport Improvement (PXM2016014212000030).


  1. 1.
    Lu GX, Li BQ, Wang LJ (2015) Some new properties for degree-based graph entropies. Entropy 17(12):8217–8227CrossRefGoogle Scholar
  2. 2.
    Mowshowitz A, Dehmer M (2012) Entropy and the complexity of graphs revisited. Entropy 14(3):559–570MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Cao SJ, Dehmer M, Shi YT (2014) Extremality of degree-based graph entropies. Inf Sci 278:22–33MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Bianconi G (2013) Statistical mechanics of multiplex networks: entropy and overlap. Phys Rev E Stat Nonlin Soft Matter Phys 87(6):062806CrossRefGoogle Scholar
  5. 5.
    Rajaram R, Castellani B (2016) An entropy based measure for comparing distributions of complexity. Phys A 453:35–43MathSciNetCrossRefGoogle Scholar
  6. 6.
    Chen ZQ, Dehmer M, Shi YT (2014) A note on distance-based graph entropies. Entropy 16(10):5416–5427MathSciNetCrossRefGoogle Scholar
  7. 7.
    Chakrabarti CG, Chakrabarty I (2005) Shannon entropy: axiomatic characterization and application. Int J Math Math Sci 17:2847–2854MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Chen ZQ, Dehmer M, Shi YT (2015) Bounds for degree-based network entropies. Appl Math Comput 265:983–993MathSciNetGoogle Scholar
  9. 9.
    Safara MH, Sorkhoh IY, Farahat HM, Mahdi KA (2011) On maximizing the entropy of complex networks. Procedia Computer Science 5:480–488CrossRefGoogle Scholar
  10. 10.
    Anand K, Bianconi G (2009) Entropy measures for networks: toward an information theory of complex topologies. Phys Rev E 80(4 Pt 2):045102CrossRefGoogle Scholar
  11. 11.
    Zhang Q, Li MZ, Du YX, Deng Y (2014) Local structure entropy of complex networks. Comput SciGoogle Scholar
  12. 12.
    Xu XL, Hu XF, He XY (2013) Degree dependence entropy descriptor for complex networks. Adv Manufact 1(3):284–287CrossRefGoogle Scholar
  13. 13.
    Zhang Q, Li MZ, Deng Y (2016) A new structure entropy of complex networks based on nonextensive statistical mechanics. Int J Mod Phys C 27(10):440–452MathSciNetGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  • Zundong Zhang
    • 1
  • Zhaoran Zhang
    • 1
  • Weixin Ma
    • 1
  • Huijuan Zhou
    • 1
  1. 1.Beijing Key Lab of Urban Road Transportation Intelligent Control TechnologyNorth China University of TechnologyBeijingPeople’s Republic of China

Personalised recommendations