Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Lu GX, Li BQ, Wang LJ (2015) Some new properties for degree-based graph entropies. Entropy 17(12):8217–8227
Mowshowitz A, Dehmer M (2012) Entropy and the complexity of graphs revisited. Entropy 14(3):559–570
Cao SJ, Dehmer M, Shi YT (2014) Extremality of degree-based graph entropies. Inf Sci 278:22–33
Bianconi G (2013) Statistical mechanics of multiplex networks: entropy and overlap. Phys Rev E Stat Nonlin Soft Matter Phys 87(6):062806
Rajaram R, Castellani B (2016) An entropy based measure for comparing distributions of complexity. Phys A 453:35–43
Chen ZQ, Dehmer M, Shi YT (2014) A note on distance-based graph entropies. Entropy 16(10):5416–5427
Chakrabarti CG, Chakrabarty I (2005) Shannon entropy: axiomatic characterization and application. Int J Math Math Sci 17:2847–2854
Chen ZQ, Dehmer M, Shi YT (2015) Bounds for degree-based network entropies. Appl Math Comput 265:983–993
Safara MH, Sorkhoh IY, Farahat HM, Mahdi KA (2011) On maximizing the entropy of complex networks. Procedia Computer Science 5:480–488
Anand K, Bianconi G (2009) Entropy measures for networks: toward an information theory of complex topologies. Phys Rev E 80(4 Pt 2):045102
Zhang Q, Li MZ, Du YX, Deng Y (2014) Local structure entropy of complex networks. Comput Sci
Xu XL, Hu XF, He XY (2013) Degree dependence entropy descriptor for complex networks. Adv Manufact 1(3):284–287
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–452
Acknowledgements
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).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhang, Z., Zhang, Z., Ma, W., Zhou, H. (2018). Research on Shortest Paths-Based Entropy of Weighted Complex Networks. In: Jia, L., Qin, Y., Suo, J., Feng, J., Diao, L., An, M. (eds) Proceedings of the 3rd International Conference on Electrical and Information Technologies for Rail Transportation (EITRT) 2017. EITRT 2017. Lecture Notes in Electrical Engineering, vol 482. Springer, Singapore. https://doi.org/10.1007/978-981-10-7986-3_79
Download citation
DOI: https://doi.org/10.1007/978-981-10-7986-3_79
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-7985-6
Online ISBN: 978-981-10-7986-3
eBook Packages: EnergyEnergy (R0)