{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:28:55Z","timestamp":1744172935650,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030739720"},{"type":"electronic","value":"9783030739737"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-73973-7_16","type":"book-chapter","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T14:03:24Z","timestamp":1617977004000},"page":"164-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimating the Manifold Dimension of a Complex Network Using Weyl\u2019s Law"],"prefix":"10.1007","author":[{"given":"Luca","family":"Rossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Torsello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Akiba, T., Nakamura, K., Takaguchi, T.: Fractality of massive graphs: scalable analysis with sketch-based box-covering algorithm. In: 2016 IEEE 16th International Conference on Data Mining (ICDM), pp. 769\u2013774. IEEE (2016)","DOI":"10.1109\/ICDM.2016.0088"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Chorley, M., Rossi, L., Tyson, G., Williams, M.: Pub crawling at scale: tapping untappd to explore social drinking. In: Proceedings of the International AAAI Conference on Web and Social Media, vol. 10 (2016)","DOI":"10.1609\/icwsm.v10i1.14724"},{"issue":"4","key":"16_CR3","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1038\/nphys560","volume":"3","author":"V Colizza","year":"2007","unstructured":"Colizza, V., Pastor-Satorras, R., Vespignani, A.: Reaction-diffusion processes and metapopulation models in heterogeneous networks. Nat. Phys. 3(4), 276\u2013282 (2007)","journal-title":"Nat. Phys."},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"036125","DOI":"10.1103\/PhysRevE.73.036125","volume":"73","author":"P Crucitti","year":"2006","unstructured":"Crucitti, P., Latora, V., Porta, S.: Centrality measures in spatial networks of urban streets. Phys. Rev. E 73(3), 036125 (2006)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"16_CR5","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1038\/nphys1932","volume":"7","author":"L Daqing","year":"2011","unstructured":"Daqing, L., Kosmidis, K., Bunde, A., Havlin, S.: Dimension of spatially embedded networks. Nat. Phys. 7(6), 481\u2013484 (2011)","journal-title":"Nat. Phys."},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s11067-008-9074-7","volume":"9","author":"A Erath","year":"2009","unstructured":"Erath, A., L\u00f6chl, M., Axhausen, K.W.: Graph-theoretical analysis of the swiss road and railway networks over time. Netw. Spat. Econ. 9(3), 379\u2013400 (2009)","journal-title":"Netw. Spat. Econ."},{"issue":"Pt 6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1042\/BST0361398","volume":"36","author":"A Gursoy","year":"2008","unstructured":"Gursoy, A., Keskin, O., Nussinov, R.: Topological properties of protein interaction networks from a structural perspective. Biochem. Soc. Trans. 36(Pt 6), 1398\u20131403 (2008)","journal-title":"Biochem. Soc. Trans."},{"issue":"3","key":"16_CR8","doi-asserted-by":"publisher","first-page":"036106","DOI":"10.1103\/PhysRevE.82.036106","volume":"82","author":"D Krioukov","year":"2010","unstructured":"Krioukov, D., Papadopoulos, F., Kitsak, M., Vahdat, A., Bogun\u00e1, M.: Hyperbolic geometry of complex networks. Phys. Rev. E 82(3), 036106 (2010)","journal-title":"Phys. Rev. E"},{"key":"16_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/9781316216002","volume-title":"Complex Networks: Principles, Methods and Applications","author":"V Latora","year":"2017","unstructured":"Latora, V., Nicosia, V., Russo, G.: Complex Networks: Principles, Methods and Applications. Cambridge University Press, Cambridge (2017)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Lima, A., Rossi, L., Musolesi, M.: Coding together at scale: GitHub as a collaborative social network. In: Proceedings of 8th AAAI International Conference on Weblogs and Social Media (2014)","DOI":"10.1609\/icwsm.v8i1.14552"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1093\/comnet\/cny028","volume":"7","author":"G Minello","year":"2019","unstructured":"Minello, G., Rossi, L., Torsello, A.: On the von Neumann entropy of graphs. J. Complex Netw. 7(4), 491\u2013514 (2019)","journal-title":"J. Complex Netw."},{"issue":"3","key":"16_CR12","doi-asserted-by":"publisher","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","volume":"74","author":"ME Newman","year":"2006","unstructured":"Newman, M.E.: Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E 74(3), 036104 (2006)","journal-title":"Phys. Rev. E"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-662-44415-3_11","volume-title":"Structural, Syntactic, and Statistical Pattern Recognition","author":"L Rossi","year":"2014","unstructured":"Rossi, L., Torsello, A., Hancock, E.R.: Node centrality for continuous-time quantum walks. In: Fr\u00e4nti, P., Brown, G., Loog, M., Escolano, F., Pelillo, M. (eds.) S+SSPR 2014. LNCS, vol. 8621, pp. 103\u2013112. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44415-3_11"},{"issue":"2","key":"16_CR14","doi-asserted-by":"publisher","first-page":"022815","DOI":"10.1103\/PhysRevE.91.022815","volume":"91","author":"L Rossi","year":"2015","unstructured":"Rossi, L., Torsello, A., Hancock, E.R.: Measuring graph similarity through continuous-time quantum walks and the quantum Jensen-Shannon divergence. Phys. Rev. E 91(2), 022815 (2015)","journal-title":"Phys. Rev. E"},{"issue":"3","key":"16_CR15","doi-asserted-by":"publisher","first-page":"032806","DOI":"10.1103\/PhysRevE.88.032806","volume":"88","author":"L Rossi","year":"2013","unstructured":"Rossi, L., Torsello, A., Hancock, E.R., Wilson, R.C.: Characterizing graph symmetries through quantum Jensen-Shannon divergence. Phys. Rev. E 88(3), 032806 (2013)","journal-title":"Phys. Rev. E"},{"issue":"6","key":"16_CR16","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1088\/1367-2630\/9\/6\/175","volume":"9","author":"HD Rozenfeld","year":"2007","unstructured":"Rozenfeld, H.D., Havlin, S., Ben-Avraham, D.: Fractal and transfractal recursive scale-free nets. New J. Phys. 9(6), 175 (2007)","journal-title":"New J. Phys."},{"issue":"03","key":"16_CR17","doi-asserted-by":"publisher","first-page":"P03006","DOI":"10.1088\/1742-5468\/2007\/03\/P03006","volume":"2007","author":"C Song","year":"2007","unstructured":"Song, C., Gallos, L.K., Havlin, S., Makse, H.A.: How to calculate the fractal dimension of a complex network: the box covering algorithm. J. Stat. Mech. Theory Exp. 2007(03), P03006 (2007)","journal-title":"J. Stat. Mech. Theory Exp."},{"issue":"7024","key":"16_CR18","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1038\/nature03248","volume":"433","author":"C Song","year":"2005","unstructured":"Song, C., Havlin, S., Makse, H.A.: Self-similarity of complex networks. Nature 433(7024), 392\u2013395 (2005)","journal-title":"Nature"},{"issue":"6684","key":"16_CR19","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of \u2018small-world\u2019 networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"1","key":"16_CR20","first-page":"1","volume":"3","author":"DJ Wei","year":"2013","unstructured":"Wei, D.J., Liu, Q., Zhang, H.X., Hu, Y., Deng, Y., Mahadevan, S.: Box-covering algorithm for fractal dimension of weighted networks. Sci. Rep. 3(1), 1\u20138 (2013)","journal-title":"Sci. Rep."},{"key":"16_CR21","first-page":"110","volume":"1911","author":"H Weyl","year":"1911","unstructured":"Weyl, H.: \u00dcber die asymptotische verteilung der eigenwerte. Nachrichten von der Gesellschaft der Wissenschaften zu G\u00f6ttingen. Mathematisch-Physikalische Klasse 1911, 110\u2013117 (1911)","journal-title":"Mathematisch-Physikalische Klasse"}],"container-title":["Lecture Notes in Computer Science","Structural, Syntactic, and Statistical Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-73973-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:02:43Z","timestamp":1744149763000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-73973-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030739720","9783030739737"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-73973-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"10 April 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"S+SSPR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 January 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sspr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.dais.unive.it\/sspr2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"35","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}