{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:21:48Z","timestamp":1750220508131,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,4,19]],"date-time":"2021-04-19T00:00:00Z","timestamp":1618790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,4,19]]},"DOI":"10.1145\/3442381.3449804","type":"proceedings-article","created":{"date-parts":[[2021,6,3]],"date-time":"2021-06-03T19:03:16Z","timestamp":1622746996000},"page":"3699-3710","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Bridging the Gap between von Neumann Graph Entropy and Structural Information: Theory and Applications"],"prefix":"10.1145","author":[{"given":"Xuecheng","family":"Liu","sequence":"first","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]},{"given":"Luoyi","family":"Fu","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]},{"given":"Xinbing","family":"Wang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}]}],"member":"320","published-online":{"date-parts":[[2021,6,3]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2011-05393-6"},{"volume-title":"Computer Analysis of Images and Patterns","author":"Bai Lu","key":"e_1_3_2_1_2_1","unstructured":"Lu Bai and Edwin\u00a0 R. Hancock . 2011. Graph clustering using the Jensen-Shannon kernel . In Computer Analysis of Images and Patterns . Springer , Berlin , 394\u2013401. Lu Bai and Edwin\u00a0R. Hancock. 2011. Graph clustering using the Jensen-Shannon kernel. In Computer Analysis of Images and Patterns. Springer, Berlin, 394\u2013401."},{"key":"e_1_3_2_1_3_1","volume-title":"Emergence of scaling in random networks. Science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. Science 286, 5439 ( 1999 ), 509\u2013512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. Science 286, 5439 (1999), 509\u2013512."},{"volume-title":"Quantitative Measures of Network Complexity","author":"Bonchev Danail","key":"e_1_3_2_1_4_1","unstructured":"Danail Bonchev and Gregory\u00a0 A. Buck . 2005. Quantitative Measures of Network Complexity . Springer , Boston , 191\u2013235. Danail Bonchev and Gregory\u00a0A. Buck. 2005. Quantitative Measures of Network Complexity. Springer, Boston, 191\u2013235."},{"key":"e_1_3_2_1_5_1","volume-title":"The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states. Annals of Combinatorics10","author":"Braunstein L.","year":"2006","unstructured":"Samuel\u00a0 L. Braunstein , Sibasish Ghosh , and Simone Severini . 2006. The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states. Annals of Combinatorics10 ( 2006 ), 291\u2013317. Samuel\u00a0L. Braunstein, Sibasish Ghosh, and Simone Severini. 2006. The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states. Annals of Combinatorics10 (2006), 291\u2013317."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.79.052311"},{"volume-title":"ICML.","author":"Chen Pin-Yu","key":"e_1_3_2_1_7_1","unstructured":"Pin-Yu Chen , Lingfei Wu , Sijia Liu , and Indika Rajapakse . 2019. Fast incremental von Neumann graph entropy computation: theory, algorithm, and applications . In ICML. Long Beach , California, USA , 1091\u20131101. Pin-Yu Chen, Lingfei Wu, Sijia Liu, and Indika Rajapakse. 2019. Fast incremental von Neumann graph entropy computation: theory, algorithm, and applications. In ICML. Long Beach, California, USA, 1091\u20131101."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.09.031"},{"volume-title":"Spectral Graph Theory","author":"Chung Fan","key":"e_1_3_2_1_9_1","unstructured":"Fan R.\u00a0K. Chung . 1997. Spectral Graph Theory . American Mathematical Society . Fan R.\u00a0K. Chung. 1997. Spectral Graph Theory. American Mathematical Society."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.01.037"},{"key":"e_1_3_2_1_11_1","unstructured":"George Dasoulas Giannis Nikolentzos1 Kevin Scaman Aladin Virmaux and Michalis Vazirgiannis. 2020. Ego-based entropy measures for structural representations. arXiv preprint arXiv:2003.00553(2020).  George Dasoulas Giannis Nikolentzos1 Kevin Scaman Aladin Virmaux and Michalis Vazirgiannis. 2020. Ego-based entropy measures for structural representations. arXiv preprint arXiv:2003.00553(2020)."},{"key":"e_1_3_2_1_12_1","volume-title":"Spectral entropies as information-theoretic tools for complex network comparison. Phys. Rev. X 6 (Dec","author":"De\u00a0Domenico Manlio","year":"2016","unstructured":"Manlio De\u00a0Domenico and Jacob Biamonte . 2016. Spectral entropies as information-theoretic tools for complex network comparison. Phys. Rev. X 6 (Dec 2016 ), 041062. Issue 4. Manlio De\u00a0Domenico and Jacob Biamonte. 2016. Spectral entropies as information-theoretic tools for complex network comparison. Phys. Rev. X 6 (Dec 2016), 041062. Issue 4."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2007.12.010"},{"key":"e_1_3_2_1_14_1","unstructured":"Chris\u00a0H.Q. Ding Xiaofeng He Hongyuan Zha Ming Gu and Horst\u00a0D. Simon. 2001. A min-max cut algorithm for graph partitioning and data clustering. In ICDM. 107\u2013114.  Chris\u00a0H.Q. Ding Xiaofeng He Hongyuan Zha Ming Gu and Horst\u00a0D. Simon. 2001. A min-max cut algorithm for graph partitioning and data clustering. In ICDM. 107\u2013114."},{"key":"e_1_3_2_1_15_1","volume-title":"Structural reducibility of multilayer networks. Nature Communications 6, 6864","author":"Domenico D.","year":"2015","unstructured":"Manlio\u00a0 D. Domenico , Vincenzo Nicosia , Alexandre Arenas , and Vito Latora . 2015. Structural reducibility of multilayer networks. Nature Communications 6, 6864 ( 2015 ). Manlio\u00a0D. Domenico, Vincenzo Nicosia, Alexandre Arenas, and Vito Latora. 2015. Structural reducibility of multilayer networks. Nature Communications 6, 6864 (2015)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.813506"},{"volume-title":"Growing well-connected graphs","author":"Ghosh Arpita","key":"e_1_3_2_1_17_1","unstructured":"Arpita Ghosh and Stephen Boyd . 2006. Growing well-connected graphs . In IEEE CDC. Arpita Ghosh and Stephen Boyd. 2006. Growing well-connected graphs. In IEEE CDC."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/03081089508818384"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1078148"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Almerima Jamakovic and Steve Uhlig. 2007. On the relationship between the algebraic connectivity and graph\u2019s robustness to node and link failures. In 2007 Next Generation Internet Networks. 96\u2013102.  Almerima Jamakovic and Steve Uhlig. 2007. On the relationship between the algebraic connectivity and graph\u2019s robustness to node and link failures. In 2007 Next Generation Internet Networks. 96\u2013102.","DOI":"10.1109\/NGI.2007.371203"},{"key":"e_1_3_2_1_21_1","first-page":"38","article-title":"Sensitivity of topological indices of polycyclic graphs","volume":"136","author":"Konstantinova E.","year":"1990","unstructured":"E. Konstantinova and A.\u00a0 A. Paleev . 1990 . Sensitivity of topological indices of polycyclic graphs . Vychisl. Sistemy 136 (1990), 38 \u2013 48 . E. Konstantinova and A.\u00a0A. Paleev. 1990. Sensitivity of topological indices of polycyclic graphs. Vychisl. Sistemy 136(1990), 38\u201348.","journal-title":"Vychisl. Sistemy"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2971991"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2824443"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"crossref","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. The KONECT Project: Koblenz Network Collection. http:\/\/konect.cc\/networks.  J\u00e9r\u00f4me Kunegis. 2013. The KONECT Project: Koblenz Network Collection. http:\/\/konect.cc\/networks.","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.77.052311"},{"key":"e_1_3_2_1_26_1","unstructured":"P.\u00a0W. Lamberti M. Portesi and J. Sparacino. 2008. Natural metric for quantum information theory. arXiv preprint arXiv:0807.0583(2008).  P.\u00a0W. Lamberti M. Portesi and J. Sparacino. 2008. Natural metric for quantum information theory. arXiv preprint arXiv:0807.0583(2008)."},{"key":"e_1_3_2_1_27_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555904"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.2017.1419145"},{"volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"Lockhart Joshua","key":"e_1_3_2_1_30_1","unstructured":"Joshua Lockhart , Giorgia Minello , Luca Rossi , Simone Severini , and Andrea Torsello . 2016. Edge centrality via the Holevo quantity . In Structural, Syntactic, and Statistical Pattern Recognition . Springer , 143\u2013152. Joshua Lockhart, Giorgia Minello, Luca Rossi, Simone Severini, and Andrea Torsello. 2016. Edge centrality via the Holevo quantity. In Structural, Syntactic, and Statistical Pattern Recognition. Springer, 143\u2013152."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.72.052310"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68276-1"},{"key":"e_1_3_2_1_33_1","article-title":"On the von Neumann entropy of graphs","volume":"7","author":"Minello Giorgia","year":"2018","unstructured":"Giorgia Minello , Luca Rossi , and Andrea Torsello . 2018 . On the von Neumann entropy of graphs . Journal of Complex Networks 7 , 4 (11 2018), 491\u2013514. Giorgia Minello, Luca Rossi, and Andrea Torsello. 2018. On the von Neumann entropy of graphs. Journal of Complex Networks 7, 4 (11 2018), 491\u2013514.","journal-title":"Journal of Complex Networks"},{"volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"Nielsen A.","key":"e_1_3_2_1_34_1","unstructured":"Michael\u00a0 A. Nielsen and Isaac\u00a0 L. Chuang . 2010. Quantum Computation and Quantum Information: 10th Anniversary Edition . Cambridge University Press . Michael\u00a0A. Nielsen and Isaac\u00a0L. Chuang. 2010. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13174-010-0003-x"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02477860"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.540050612"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnx061"},{"key":"e_1_3_2_1_39_1","unstructured":"Anton Tsitsulin Davide Mottin Panagiotis Karras Alexander Bronstein and Emmanuel M\u00fcller. 2018. NetLSD: Hearing the shape of a graph. In ACM SIGKDD. 2347\u20132356.  Anton Tsitsulin Davide Mottin Panagiotis Karras Alexander Bronstein and Emmanuel M\u00fcller. 2018. NetLSD: Hearing the shape of a graph. In ACM SIGKDD. 2347\u20132356."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380026"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1104974"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Bimal Viswanath Alan Mislove Meeyoung Cha and Krishna\u00a0P. Gummadi. 2009. On the Evolution of User Interaction in Facebook. In WOSN. 37\u201342.  Bimal Viswanath Alan Mislove Meeyoung Cha and Krishna\u00a0P. Gummadi. 2009. On the Evolution of User Interaction in Facebook. In WOSN. 37\u201342.","DOI":"10.1145\/1592665.1592675"},{"key":"e_1_3_2_1_43_1","volume-title":"Collective dynamics of \u2018small-world","author":"Watts J.","year":"1998","unstructured":"Duncan\u00a0 J. Watts and Steven\u00a0 H. Strogatz . 1998. Collective dynamics of \u2018small-world \u2019 networks. Nature 393( 1998 ), 440\u2013442. Duncan\u00a0J. Watts and Steven\u00a0H. Strogatz. 1998. Collective dynamics of \u2018small-world\u2019 networks. Nature393(1998), 440\u2013442."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2008.12.029"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.89.052804"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2112477"}],"event":{"name":"WWW '21: The Web Conference 2021","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Ljubljana Slovenia","acronym":"WWW '21"},"container-title":["Proceedings of the Web Conference 2021"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3442381.3449804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T21:24:22Z","timestamp":1750195462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3442381.3449804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,19]]},"references-count":46,"alternative-id":["10.1145\/3442381.3449804","10.1145\/3442381"],"URL":"https:\/\/doi.org\/10.1145\/3442381.3449804","relation":{},"subject":[],"published":{"date-parts":[[2021,4,19]]},"assertion":[{"value":"2021-06-03","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}