{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T23:01:06Z","timestamp":1740178866950,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:00:00Z","timestamp":1684368000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T00:00:00Z","timestamp":1684368000000},"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":["J Appl. and Comput. Topology"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s41468-023-00125-w","type":"journal-article","created":{"date-parts":[[2023,5,18]],"date-time":"2023-05-18T11:02:21Z","timestamp":1684407741000},"page":"1299-1331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Heat diffusion distance processes: a statistically founded method to analyze graph data sets"],"prefix":"10.1007","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9241-2699","authenticated-orcid":false,"given":"Etienne","family":"Lasalle","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,18]]},"reference":[{"issue":"17","key":"125_CR1","doi-asserted-by":"publisher","first-page":"i430","DOI":"10.1093\/bioinformatics\/btu447","volume":"30","author":"W Ali","year":"2014","unstructured":"Ali, W., Rito, T., Reinert, G., et al.: Alignment-free protein interaction network comparison. Bioinformatics 30(17), i430\u2013i437 (2014)","journal-title":"Bioinformatics"},{"key":"125_CR2","doi-asserted-by":"crossref","unstructured":"Berthet, P., Mason, D.M.: Revisiting two strong approximation results of dudley and philipp. In: High Dimensional Probability, pp. 155\u2013172. Institute of Mathematical Statistics (2006)","DOI":"10.1214\/074921706000000824"},{"key":"125_CR3","unstructured":"Billingsley, P.: Convergence of Probability Measures. John Wiley & Sons (2013)"},{"key":"125_CR4","unstructured":"Borgwardt, K.M., Kriegel, H.P.: Shortest-path kernels on graphs. In: Fifth IEEE International Conference on Data Mining (ICDM\u201905), IEEE, p. 8 (2005)"},{"key":"125_CR5","unstructured":"Carri\u00e8re, M., Chazal, F., Ike, Y., et al.: Perslay: a neural network layer for persistence diagrams and new graph topological signatures. In: International Conference on Artificial Intelligence and Statistics, PMLR, pp. 2786\u20132796 (2020)"},{"key":"125_CR6","doi-asserted-by":"publisher","first-page":"690","DOI":"10.3389\/fneur.2018.00690","volume":"9","author":"G Castellazzi","year":"2018","unstructured":"Castellazzi, G., Debernard, L., Melzer, T.R., et al.: Functional connectivity alterations reveal complex mechanisms based on clinical and radiological status in mild relapsing remitting multiple sclerosis. Front. Neurol. 9, 690 (2018)","journal-title":"Front. Neurol."},{"key":"125_CR7","doi-asserted-by":"crossref","unstructured":"Chazal, F., De Silva, V., Glisse, M., et al.: The Structure and Stability of Persistence Modules. Springer (2016)","DOI":"10.1007\/978-3-319-42545-0"},{"issue":"1","key":"125_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10208-008-9027-z","volume":"9","author":"D Cohen-Steiner","year":"2009","unstructured":"Cohen-Steiner, D., Edelsbrunner, H., Harer, J.: Extending persistence using poincar\u00e9 and lefschetz duality. Found. Comput. Math. 9(1), 79\u2013103 (2009)","journal-title":"Found. Comput. Math."},{"issue":"1","key":"125_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.acha.2013.03.001","volume":"36","author":"RR Coifman","year":"2014","unstructured":"Coifman, R.R., Hirn, M.J.: Diffusion maps for changing data. Appl. Comput. Harmon. Anal. 36(1), 79\u2013107 (2014)","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"125_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.acha.2006.04.006","volume":"21","author":"RR Coifman","year":"2006","unstructured":"Coifman, R.R., Lafon, S.: Diffusion maps. Appl. Comput. Harmon. Anal. 21(1), 5\u201330 (2006)","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"125_CR11","doi-asserted-by":"crossref","unstructured":"Edelsbrunner, H., Harer, J.: Computational Topology: An Introduction. American Mathematical Soc. (2010)","DOI":"10.1090\/mbk\/069"},{"key":"125_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.ins.2016.01.074","volume":"346","author":"F Emmert-Streib","year":"2016","unstructured":"Emmert-Streib, F., Dehmer, M., Shi, Y.: Fifty years of graph matching, network alignment and network comparison. Inf. Sci. 346, 180\u2013197 (2016)","journal-title":"Inf. Sci."},{"issue":"1","key":"125_CR13","first-page":"17","volume":"5","author":"P Erdos","year":"1960","unstructured":"Erdos, P., R\u00e9nyi, A., et al.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci. 5(1), 17\u201360 (1960)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"issue":"1","key":"125_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-017-14411-y","volume":"7","author":"FE Faisal","year":"2017","unstructured":"Faisal, F.E., Newaz, K., Chaney, J.L., et al.: Grafene: graphlet-based alignment-free network approach integrates 3d structural and sequence (residue order) data to improve protein structural comparison. Sci. Rep. 7(1), 1\u201315 (2017)","journal-title":"Sci. Rep."},{"issue":"13","key":"125_CR15","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1177\/1352458516628657","volume":"22","author":"A Faivre","year":"2016","unstructured":"Faivre, A., Robinet, E., Guye, M., et al.: Depletion of brain functional connectivity enhancement leads to disability progression in multiple sclerosis: a longitudinal resting-state FMRI study. Multi. Scler. J. 22(13), 1695\u20131708 (2016)","journal-title":"Multi. Scler. J."},{"key":"125_CR16","doi-asserted-by":"publisher","first-page":"585","DOI":"10.3389\/fnins.2019.00585","volume":"13","author":"FV Farahani","year":"2019","unstructured":"Farahani, F.V., Karwowski, W., Lighthall, N.R.: Application of graph theory for identifying connectivity patterns in human brain networks: a systematic review. Front. Neurosci. 13, 585 (2019)","journal-title":"Front. Neurosci."},{"key":"125_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0024-3795(93)00061-4","volume":"214","author":"M Fiedler","year":"1995","unstructured":"Fiedler, M.: An estimate for the nonstochastic eigenvalues of doubly stochastic matrices. Linear Algebra Appl. 214, 133\u2013143 (1995)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"125_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-017-0042-3","volume":"3","author":"R Gera","year":"2018","unstructured":"Gera, R., Alonso, L., Crawford, B., et al.: Identifying network structure similarity using spectral graph theory. Appl. Netw. Sci. 3(1), 1\u201315 (2018)","journal-title":"Appl. Netw. Sci."},{"issue":"1","key":"125_CR19","first-page":"723","volume":"13","author":"A Gretton","year":"2012","unstructured":"Gretton, A., Borgwardt, K.M., Rasch, M.J., et al.: A kernel two-sample test. J. Mach. Learn. Res. 13(1), 723\u2013773 (2012)","journal-title":"J. Mach. Learn. Res."},{"key":"125_CR20","doi-asserted-by":"crossref","unstructured":"Hammond, D.K., Gur, Y., Johnson, C.R.: Graph diffusion distance: a difference measure for weighted graphs based on the graph laplacian exponential kernel. In: 2013 IEEE Global Conference on Signal and Information Processing, IEEE, pp. 419\u2013422 (2013)","DOI":"10.1109\/GlobalSIP.2013.6736904"},{"key":"125_CR21","doi-asserted-by":"crossref","unstructured":"Hido, S., Kashima, H.: A linear-time graph kernel. In: 2009 Ninth IEEE International Conference on Data Mining, IEEE, pp. 179\u2013188 (2009)","DOI":"10.1109\/ICDM.2009.30"},{"issue":"2","key":"125_CR22","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0378-8733(83)90021-7","volume":"5","author":"PW Holland","year":"1983","unstructured":"Holland, P.W., Laskey, K.B., Leinhardt, S.: Stochastic blockmodels: first steps. Soc. Netw. 5(2), 109\u2013137 (1983)","journal-title":"Soc. Netw."},{"key":"125_CR23","doi-asserted-by":"crossref","unstructured":"Hu, N., Rustamov, R.M., Guibas, L.: Stable and informative spectral signatures for graph matching. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2305\u20132312 (2014)","DOI":"10.1109\/CVPR.2014.296"},{"key":"125_CR24","unstructured":"Johansson, F., Jethava, V., Dubhashi, D., et al.: Global graph kernels using geometric embeddings. In: International Conference on Machine Learning, PMLR, pp. 694\u2013702 (2014)"},{"key":"125_CR25","doi-asserted-by":"crossref","unstructured":"Kosorok, M.R.: Introduction to empirical processes. In: Introduction to Empirical Processes and Semiparametric Inference (2008)","DOI":"10.1007\/978-0-387-74978-5"},{"key":"125_CR26","doi-asserted-by":"crossref","unstructured":"Koutra, D., Vogelstein, J.T., Faloutsos, C.: Deltacon: a principled massive-graph similarity function. In: Proceedings of the 2013 SIAM International Conference on Data Mining, SIAM, pp 162\u2013170 (2013)","DOI":"10.1137\/1.9781611972832.18"},{"issue":"1","key":"125_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0195-3","volume":"5","author":"NM Kriege","year":"2020","unstructured":"Kriege, N.M., Johansson, F.D., Morris, C.: A survey on graph kernels. Appl. Netw. Sci. 5(1), 1\u201342 (2020)","journal-title":"Appl. Netw. Sci."},{"key":"125_CR28","unstructured":"Lehmann, E.L., Romano, J.P.: Testing Statistical Hypotheses. Springer Science & Business Media (2006)"},{"key":"125_CR29","doi-asserted-by":"crossref","unstructured":"Marcotte, S., Barbe, A., Gribonval, R., et al.: Fast multiscale diffusion on graphs. In: ICASSP 2022-2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, pp. 5627\u20135631 (2022)","DOI":"10.1109\/ICASSP43922.2022.9746802"},{"key":"125_CR30","doi-asserted-by":"crossref","unstructured":"Maria, C., Boissonnat, J.D., Glisse, M., et al.: The gudhi library: Simplicial complexes and persistent homology. In: International Congress on Mathematical Software, pp. 167\u2013174. Springer (2014)","DOI":"10.1007\/978-3-662-44199-2_28"},{"issue":"3","key":"125_CR31","doi-asserted-by":"publisher","first-page":"A1325","DOI":"10.1137\/120876605","volume":"35","author":"Y Nakatsukasa","year":"2013","unstructured":"Nakatsukasa, Y., Higham, N.J.: Stable and efficient spectral divide and conquer algorithms for the symmetric eigenvalue decomposition and the SVD. SIAM J. Sci. Comput. 35(3), A1325\u2013A1349 (2013)","journal-title":"SIAM J. Sci. Comput."},{"issue":"694\u2013706","key":"125_CR32","first-page":"289","volume":"231","author":"J Neyman","year":"1933","unstructured":"Neyman, J., Pearson, E.S.: Ix. On the problem of the most efficient tests of statistical hypotheses. Philos. Trans. R. Soc. Lond. Ser. A Contain. Pap. Math. Phys. Char. 231(694\u2013706), 289\u2013337 (1933)","journal-title":"Philos. Trans. R. Soc. Lond. Ser. A Contain. Pap. Math. Phys. Char."},{"key":"125_CR33","doi-asserted-by":"crossref","unstructured":"Oudot, S.Y.: Persistence Theory: from Quiver Representations to Data Analysis, vol. 209. American Mathematical Society Providence (2015)","DOI":"10.1090\/surv\/209"},{"key":"125_CR34","doi-asserted-by":"crossref","unstructured":"Penrose, M., et al.: Random Geometric Graphs, vol. 5. Oxford University Press (2003)","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"issue":"2","key":"125_CR35","doi-asserted-by":"publisher","first-page":"e177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj, N.: Biological network comparison using graphlet degree distribution. Bioinformatics 23(2), e177\u2013e183 (2007)","journal-title":"Bioinformatics"},{"issue":"18","key":"125_CR36","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: scale-free or geometric? Bioinformatics 20(18), 3508\u20133515 (2004)","journal-title":"Bioinformatics"},{"issue":"1","key":"125_CR37","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s00429-014-0896-4","volume":"221","author":"MA Rocca","year":"2016","unstructured":"Rocca, M.A., Valsasina, P., Meani, A., et al.: Impaired functional integration in multiple sclerosis: a graph theory study. Brain Struct. Funct. 221(1), 115\u2013131 (2016)","journal-title":"Brain Struct. Funct."},{"key":"125_CR38","unstructured":"Shervashidze, N., Vishwanathan, S., Petri, T., et al.: Efficient graphlet Kernels for large graph comparison. In: Artificial Intelligence and Statistics, PMLR, pp. 488\u2013495 (2009)"},{"key":"125_CR39","first-page":"9","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., Van Leeuwen, E.J., et al.: Weisfeiler\u2013Lehman graph Kernels. J. Mach. Learn. Res. 12, 9 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"125_CR40","first-page":"1993","volume":"21","author":"G Siglidis","year":"2020","unstructured":"Siglidis, G., Nikolentzos, G., Limnios, S., et al.: Grakel: a graph kernel library in python. J. Mach. Learn. Res. 21(1), 1993\u20131997 (2020)","journal-title":"J. Mach. Learn. Res."},{"key":"125_CR41","doi-asserted-by":"crossref","unstructured":"Soundarajan, S., Eliassi-Rad, T., Gallagher, B.: A guide to selecting a network similarity method. In: Proceedings of the 2014 Siam International Conference on Data Mining, SIAM, pp. 1037\u20131045 (2014)","DOI":"10.1137\/1.9781611973440.118"},{"key":"125_CR42","unstructured":"Sugiyama, M., Borgwardt, K.: Halting in random walk kernels. Adv. Neur. Inf. Process. Syst. 28 (2015)"},{"key":"125_CR43","doi-asserted-by":"crossref","unstructured":"Sun, J., Ovsjanikov, M., Guibas, L.: A concise and provably informative multi-scale signature based on heat diffusion. In: Computer Graphics Forum, Wiley Online Library, pp. 1383\u20131392 (2009)","DOI":"10.1111\/j.1467-8659.2009.01515.x"},{"issue":"1","key":"125_CR44","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-019-53708-y","volume":"9","author":"M Tantardini","year":"2019","unstructured":"Tantardini, M., Ieva, F., Tajoli, L., et al.: Comparing methods for comparing networks. Sci. Rep. 9(1), 1\u201319 (2019)","journal-title":"Sci. Rep."},{"key":"125_CR45","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., et al.: Netlsd: hearing the shape of a graph. In: Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2347\u20132356 (2018)","DOI":"10.1145\/3219819.3219991"},{"key":"125_CR46","doi-asserted-by":"crossref","unstructured":"Van Der Vaart, A.W., Wellner, J.A.: Weak convergence. In: Weak Convergence and Empirical Processes. Springer (1996)","DOI":"10.1007\/978-1-4757-2545-2"},{"issue":"6684","key":"125_CR47","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440\u2013442 (1998)","journal-title":"Nature"},{"issue":"9","key":"125_CR48","doi-asserted-by":"publisher","first-page":"2833","DOI":"10.1016\/j.patcog.2008.03.011","volume":"41","author":"RC Wilson","year":"2008","unstructured":"Wilson, R.C., Zhu, P.: A study of graph spectra for comparing graphs and trees. Pattern Recogn. 41(9), 2833\u20132841 (2008)","journal-title":"Pattern Recogn."},{"issue":"1","key":"125_CR49","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/srep04547","volume":"4","author":"\u00d6N Yavero\u011flu","year":"2014","unstructured":"Yavero\u011flu, \u00d6.N., Malod-Dognin, N., Davis, D., et al.: Revealing the hidden language of complex networks. Sci. Rep. 4(1), 1\u20139 (2014)","journal-title":"Sci. Rep."}],"container-title":["Journal of Applied and Computational Topology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-023-00125-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41468-023-00125-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41468-023-00125-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T10:12:27Z","timestamp":1729591947000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41468-023-00125-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,18]]},"references-count":49,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["125"],"URL":"https:\/\/doi.org\/10.1007\/s41468-023-00125-w","relation":{},"ISSN":["2367-1726","2367-1734"],"issn-type":[{"type":"print","value":"2367-1726"},{"type":"electronic","value":"2367-1734"}],"subject":[],"published":{"date-parts":[[2023,5,18]]},"assertion":[{"value":"28 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}