{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:45:46Z","timestamp":1766137546456,"version":"build-2065373602"},"reference-count":36,"publisher":"MDPI AG","issue":"11","license":[{"start":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T00:00:00Z","timestamp":1605139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["No.~2017YFE0117500"],"award-info":[{"award-number":["No.~2017YFE0117500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>As network data increases, it is more common than ever for researchers to analyze a set of networks rather than a single network and measure the difference between networks by developing a number of network comparison methods. Network comparison is able to quantify dissimilarity between networks by comparing the structural topological difference of networks. Here, we propose a kind of measures for network comparison based on the shortest path distribution combined with node centrality, capturing the global topological difference with local features. Based on the characterized path distributions, we define and compare network distance between networks to measure how dissimilar the two networks are, and the network entropy to characterize a typical network system. We find that the network distance is able to discriminate networks generated by different models. Combining more information on end nodes along a path can further amplify the dissimilarity of networks. The network entropy is able to detect tipping points in the evolution of synthetic networks. Extensive numerical simulations reveal the effectivity of the proposed measure in network reduction of multilayer networks, and identification of typical system states in temporal networks as well.<\/jats:p>","DOI":"10.3390\/e22111287","type":"journal-article","created":{"date-parts":[[2020,11,12]],"date-time":"2020-11-12T20:17:52Z","timestamp":1605212272000},"page":"1287","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Path-Based Distribution Measure for Network Comparison"],"prefix":"10.3390","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7078-4352","authenticated-orcid":false,"given":"Bing","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwen","family":"Sun","sequence":"additional","affiliation":[{"name":"School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuexing","family":"Han","sequence":"additional","affiliation":[{"name":"School of Computer Engineering and Science, Shanghai University, Shanghai 200444, China"},{"name":"Shanghai Institute for Advanced Communication and Data Science, Shanghai University, Shanghai 200444, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,11,12]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","article-title":"Statistical mechanics of complex networks","volume":"74","author":"Albert","year":"2002","journal-title":"Rev. Mod. Phys."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.physrep.2005.10.009","article-title":"Complex networks: Structure and dynamics","volume":"424","author":"Boccaletti","year":"2006","journal-title":"Phys. Rep."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S003614450342480","article-title":"The structure and function of complex networks","volume":"45","author":"Newman","year":"2003","journal-title":"SIAM Rev."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.neuroimage.2017.11.016","article-title":"Comparing multilayer brain networks between groups: Introducing graph metrics and recommendations","volume":"166","author":"Mandke","year":"2018","journal-title":"NeuroImage"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"4746","DOI":"10.1038\/s41598-018-23152-5","article-title":"An ANOVA approach for statistical comparisons of brain networks","volume":"8","author":"Fraiman","year":"2018","journal-title":"Sci. Rep."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-018-37534-2","article-title":"Detecting sequences of system states in temporal networks","volume":"9","author":"Masuda","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_7","first-page":"1","article-title":"Structural reducibility of multilayer networks","volume":"6","author":"Nicosia","year":"2015","journal-title":"Nat. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Van Wijk, B.C., Stam, C.J., and Daffertshofer, A. (2010). Comparing brain networks of different size and connectivity density using graph theory. PLoS ONE, 5.","DOI":"10.1371\/journal.pone.0013701"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"971","DOI":"10.1214\/18-AOAS1176","article-title":"Tracking network dynamics: A survey using graph distances","volume":"12","author":"Donnat","year":"2018","journal-title":"Ann. Appl. Stat."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1038\/physci235060b0","article-title":"Distance between Sets","volume":"235","author":"Levandowsky","year":"1972","journal-title":"Nat. Phys. Ence"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1109\/TSMC.1983.6313167","article-title":"A distance measure between attributed relational graphs for pattern recognition","volume":"SMC-13","author":"Sanfeliu","year":"1983","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1016\/S0167-8655(01)00022-8","article-title":"Graph distances using graph union","volume":"22","author":"Wallis","year":"2001","journal-title":"Pattern Recognit. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s10044-008-0141-y","article-title":"A survey of graph edit distance","volume":"13","author":"Gao","year":"2010","journal-title":"Pattern Anal. Appl."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Jurman, G., Visintainer, R., Riccadonna, S., Filosi, M., and Furlanello, C. (2015, January 19\u201321). The HIM glocal metric and kernel for network comparison and classification. Proceedings of the 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), Paris, France.","DOI":"10.1109\/DSAA.2015.7344816"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"395","DOI":"10.3934\/nhm.2008.3.395","article-title":"Spectral plot properties: Towards a qualitative classification of networks","volume":"3","author":"Banerjee","year":"2017","journal-title":"Netw. Heterog. Media"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","article-title":"A Comprehensive Survey of Graph Embedding: Problems, Techniques, and Applications","volume":"30","author":"Cai","year":"2018","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Shrivastava, A., and Li, P. (2014, January 17\u201320). A new space for comparing graphs. Proceedings of the 2014 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), Beijing, China.","DOI":"10.1109\/ASONAM.2014.6921561"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/s41598-019-38869-0","article-title":"Assessing diversity in multiplex networks","volume":"9","author":"Carpi","year":"2019","journal-title":"Sci. Rep."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/ncomms13928","article-title":"Quantification of network structural dissimilarities","volume":"8","author":"Schieber","year":"2017","journal-title":"Nat. Commun."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.physa.2016.11.036","article-title":"A layer reduction based community detection algorithm on multiplex networks","volume":"471","author":"Wang","year":"2017","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s41109-019-0156-x","article-title":"An information-theoretic, all-scales approach to comparing networks","volume":"4","author":"Bagrow","year":"2019","journal-title":"Appl. Netw. Sci."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Stella, M., and De Domenico, M. (2018). Distance entropy cartography characterises centrality in complex networks. Entropy, 20.","DOI":"10.3390\/e20040268"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"5416","DOI":"10.3390\/e16105416","article-title":"A Note on Distance-based Graph Entropies","volume":"16","author":"Chen","year":"2014","journal-title":"Entropy"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Zenil, H., Kiani, N.A., and Tegner, J. (2018). A Review of Graph and Network Complexity from an Algorithmic Information Perspective. Entropy, 20.","DOI":"10.3390\/e20080551"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1978","journal-title":"Soc. Netw."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Meghanathan, N. (2015, January 27\u201330). Correlation Coefficient Analysis of Centrality Metrics for Complex Network Graphs. Proceedings of the 4th Computer Science On-line Conference: Intelligent Systems in Cybernetics and Automation Theory (CSOC 2015), Zlin, Czech Republic.","DOI":"10.1007\/978-3-319-18503-3_2"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ins.2010.08.041","article-title":"A history of graph entropy measures","volume":"181","author":"Dehmer","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1016\/j.physa.2004.07.011","article-title":"Robustness and network evolution\u2014An entropic principle","volume":"346","author":"Demetrius","year":"2005","journal-title":"Phys. A Stat. Mech. Its Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"1858","DOI":"10.1109\/TIT.2003.813506","article-title":"A new metric for probability distributions","volume":"49","author":"Endres","year":"2003","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_31","first-page":"3286","article-title":"On random graphs. I","volume":"4","year":"1959","journal-title":"Publ. Math."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2019small-world\u2019 networks","volume":"393","author":"Watts","year":"1998","journal-title":"Nature"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of scaling in random networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"ref_34","first-page":"683","article-title":"Modern multidimensional scaling: Theory and applications","volume":"64","author":"Kiers","year":"1999","journal-title":"Psychometrika"},{"key":"ref_35","first-page":"021069","article-title":"Algorithmic Complexity of Multiplex Networks","volume":"10","author":"Santoro","year":"2020","journal-title":"Phys. Rev. X"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1093\/comnet\/cnu016","article-title":"Multilayer networks","volume":"2","author":"Kivela","year":"2014","journal-title":"J. Complex Netw."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/11\/1287\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T10:32:42Z","timestamp":1760178762000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/11\/1287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,12]]},"references-count":36,"journal-issue":{"issue":"11","published-online":{"date-parts":[[2020,11]]}},"alternative-id":["e22111287"],"URL":"https:\/\/doi.org\/10.3390\/e22111287","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2020,11,12]]}}}