{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T22:40:49Z","timestamp":1769640049283,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031211300","type":"print"},{"value":"9783031211317","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-21131-7_25","type":"book-chapter","created":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T18:04:15Z","timestamp":1674669855000},"page":"325-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Statistical Network Similarity"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Miasnikof","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander Y.","family":"Shestopaloff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cristi\u00e1n","family":"Bravo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuri","family":"Lawryshyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,26]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Akara-pipattana, P., Chotibut, T., Evnin, O.: Resistance distance distribution in large sparse random graphs (2021). arXiv:2107.12561","DOI":"10.1088\/1742-5468\/ac57ba"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Bai, Y., Dingand S.\u00a0Bian, H., Chen, T., Sun, Y., Wang, W.: SimGNN: A Neural Network Approach to Fast Graph Similarity Computation (2018). arXiv:1808.05689","DOI":"10.1145\/3289600.3290967"},{"key":"25_CR3","unstructured":"Bunke, H.: Graph matching: Theoretical foundations, algorithms, and applications. Proc. Vision Interf. 21 (2000)"},{"key":"25_CR4","unstructured":"Camby, E., Caporossi, G.: The extended Jaccard distance in complex networks. Les Cahiers du GERAD G-2017-77 (2017)"},{"key":"25_CR5","unstructured":"Chebotarev, P., Shamis, E.: The Matrix-Forest Theorem and Measuring Relations in Small Social Groups. arXiv Mathematics e-prints math\/0602070 (2006)"},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"Coupette, C., Vreeken, J.: Graph similarity description: how are these graphs similar? In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, pp. 185\u2013195. KDD \u201921, Association for Computing Machinery, New York, NY, USA (2021). https:\/\/doi.org\/10.1145\/3447548.3467257","DOI":"10.1145\/3447548.3467257"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Du, Z., Yang, Y., Gao, C., Huang, L., Huang, Q., Bai, Y.: The temporal network of mobile phone users in Changchun Municipality, Northeast China. Sci. Data 5, 180228 (2018)","DOI":"10.1038\/sdata.2018.228"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Fouss, F., Francoisse, K., Yen, L., Pirotte, A., Saerens, M.: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification. Neural Netw. 31, 53\u201372 (2012). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0893608012000822","DOI":"10.1016\/j.neunet.2012.03.001"},{"key":"25_CR9","unstructured":"Grohe, M., Rattan, G., Woeginger, G.: Graph Similarity and Approximate Isomorphism (2018). arXiv:1802.08509"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Hagberg, A., Schult, D., Swart, P.: Exploring network structure, dynamics, and function using network X. In: Varoquaux, G., Vaught, T., Millman, J. (eds.), Proceedings of the 7th Python in Science Conference, pp. 11\u201315. Pasadena, CA USA (2008)","DOI":"10.25080\/TCWV9851"},{"key":"25_CR11","unstructured":"Han, J.: Autonomous systems graphs (2016). https:\/\/doi.org\/10.7910\/DVN\/XLGMJR"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Huang, S., Hitti, Y., Rabusseau, G., Rabbany, R.: Laplacian Change Point Detection for Dynamic Graphs (2020). arXiv:2007.01229","DOI":"10.1145\/3394486.3403077"},{"key":"25_CR13","unstructured":"Jaccard, P.: \u00c9tude de la distribution florale dans une portion des Alpes et du Jura. Bulletin de la Soci\u00e9t\u00e9 Vaudoise des Sciences Naturelles 37, 547\u2013579 (1901)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Tang, J., Leontiadis, I., Scellato, S., Nicosia, V., Mascolo, C., M.\u00a0Musolesi, M., Latora, V.: Applications of temporal graph metrics to real-world networks. In: Temporal Networks, p. 135 (2013)","DOI":"10.1007\/978-3-642-36461-7_7"},{"key":"25_CR15","unstructured":"Koutra, D., Parikh, A., Ramdas, A., Xiang, J.: Algorithms for graph similarity and subgraph matching (2011). http:\/\/www.cs.cmu.edu\/jingx\/docs\/DBreport.pdf. Accessed on 01 Dec 2015"},{"key":"25_CR16","unstructured":"von Luxburg, U., Radl, A., Hein, M.: Getting lost in space: large sample analysis of the resistance distance. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.), Advances in Neural Information Processing Systems 23, pp. 2622\u20132630. Curran Associates, Inc. (2010). http:\/\/papers.nips.cc\/paper\/3891-getting-lost-in-space-large-sample-analysis-of-the-resistance-distance.pdf"},{"key":"25_CR17","unstructured":"von Luxburg, U., Radl, A., Hein, M.: Hitting and commute times in large random neighborhood graphs. J. Mach. Learn. Res. 15(52), 1751\u20131798 (2014). http:\/\/jmlr.org\/papers\/v15\/vonluxburg14a.html"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Maduako, I., Wachowicz, M., Hanson, T.: STVG: an evolutionary graph framework for analyzing fast-evolving networks. J. Big Data 6 (2019)","DOI":"10.1186\/s40537-019-0218-z"},{"key":"25_CR19","doi-asserted-by":"crossref","unstructured":"Miasnikof, P., Shestopaloff, A.Y., Pitsoulis, L., Ponomarenko, A.: An empirical comparison of connectivity-based distances on a graph and their computational scalability. J. Complex Netw. 10(1) (2022). https:\/\/doi.org\/10.1093\/comnet\/cnac003","DOI":"10.1093\/comnet\/cnac003"},{"key":"25_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-030-65347-7_16","volume-title":"Complex Networks & Their Applications IX","author":"P Miasnikof","year":"2021","unstructured":"Miasnikof, P., Shestopaloff, A.Y., Pitsoulis, L., Ponomarenko, A., Lawryshyn, Y.: Distances on a graph. In: Benito, R.M., Cherifi, C., Cherifi, H., Moro, E., Rocha, L.M., Sales-Pardo, M. (eds.) Complex Networks & Their Applications IX, pp. 189\u2013199. Springer International Publishing, Cham (2021)"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: Online Learning of Social Representations (2014). arXiv:1403.6652","DOI":"10.1145\/2623330.2623732"},{"key":"25_CR22","doi-asserted-by":"crossref","unstructured":"Ponomarenko, A., Pitsoulis, L., Shamshetdinov, M.: Overlapping community detection in networks based on link partitioning and partitioning around medoids. PLOS One 16(8), 1\u201343 (2021). https:\/\/doi.org\/10.1371\/journal.pone.0255717","DOI":"10.1371\/journal.pone.0255717"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Schieber, T., Carpi, L., Diaz-Guilera, A., Pardalos, P., Masoller, C., Ravetti, M.: Quantification of network structural dissimilarities. Nat. Commun. 8, 13928 (2017)","DOI":"10.1038\/ncomms13928"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"Shrivastava, N., Majumder, A., Rastogi, R.: In: 2008 IEEE 24th International Conference on Data Engineering, pp. 486\u2013495 (2008)","DOI":"10.1109\/ICDE.2008.4497457"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"Tang, J., Mascolo, C., Musolesi, M., Latora, V.: Exploiting temporal complex network metrics in mobile malware containment. In: 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, pp. 1\u20139 (2011)","DOI":"10.1109\/WoWMoM.2011.5986463"},{"key":"25_CR26","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhan, X.X., Liu, C., Zhang, Z.K.: Quantification of network structural dissimilarities based on network embedding. iScience 104446 (2022). https:\/\/www.sciencedirect.com\/science\/article\/pii\/S2589004222007179","DOI":"10.1016\/j.isci.2022.104446"},{"key":"25_CR27","doi-asserted-by":"crossref","unstructured":"Yan, H., Zhang, Q., Mao, D., Lu, Z., Guo, D., Chen, S.: Anomaly detection of network streams via dense subgraph discovery. In: 2021 International Conference on Computer Communications and Networks (ICCCN), pp. 1\u20139 (2021)","DOI":"10.1109\/ICCCN52240.2021.9522263"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Ying, X., Wu, X., Barbar\u00e1, D.: Spectrum based fraud detection in social networks. In: 2011 IEEE 27th International Conference on Data Engineering, pp. 912\u2013923 (2011)","DOI":"10.1109\/ICDE.2011.5767910"}],"container-title":["Studies in Computational Intelligence","Complex Networks and Their Applications XI"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21131-7_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,13]],"date-time":"2024-10-13T01:43:51Z","timestamp":1728783831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21131-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031211300","9783031211317"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21131-7_25","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"26 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS 2016","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Complex Networks and Their Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Palermo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.complexnetworks.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}