{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T09:55:37Z","timestamp":1770976537423,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030934125","type":"print"},{"value":"9783030934132","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-93413-2_24","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T03:18:22Z","timestamp":1641007102000},"page":"277-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Hypergraph Laplacians in\u00a0Diffusion Framework"],"prefix":"10.1007","author":[{"given":"Mehmet Emin","family":"Aktas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esra","family":"Akbas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"24_CR1","doi-asserted-by":"publisher","unstructured":"Aggarwal, C.C., Wang, H.: Managing and Mining Graph Data, vol.\u00a040. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-1-4419-6045-0","DOI":"10.1007\/978-1-4419-6045-0"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s41109-019-0179-3","volume":"4","author":"ME Aktas","year":"2019","unstructured":"Aktas, M.E., Akbas, E., Fatmaoui, A.E.: Persistence homology of networks: methods and applications. Appl. Netw. Sci. 4(1), 1\u201328 (2019). https:\/\/doi.org\/10.1007\/s41109-019-0179-3","journal-title":"Appl. Netw. Sci."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Battiston, F., et al.: Networks beyond pairwise interactions: structure and dynamics. arXiv preprint arXiv:2006.01764 (2020)","DOI":"10.1016\/j.physrep.2020.05.004"},{"issue":"48","key":"24_CR4","doi-asserted-by":"publisher","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","volume":"115","author":"AR Benson","year":"2018","unstructured":"Benson, A.R., Abebe, R., Schaub, M.T., Jadbabaie, A., Kleinberg, J.: Simplicial closure and higher-order link prediction. Proc. Natl. Acad. Sci. 115(48), E11221\u2013E11230 (2018)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.101.022308","volume":"101","author":"T Carletti","year":"2020","unstructured":"Carletti, T., Battiston, F., Cencetti, G., Fanelli, D.: Random walks on hypergraphs. Phys. Rev. E 101(2), 022308 (2020)","journal-title":"Phys. Rev. E"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"015011","DOI":"10.1088\/2632-072X\/abe27e","volume":"2","author":"T Carletti","year":"2021","unstructured":"Carletti, T., Fanelli, D., Lambiotte, R.: Random walks and community detection in hypergraphs. J. Phys. Complex. 2(1), 015011 (2021)","journal-title":"J. Phys. Complex."},{"key":"24_CR7","unstructured":"Chitra, U., Raphael, B.: Random walks on hypergraphs with edge-dependent vertex weights. In: International Conference on Machine Learning, pp. 1172\u20131181. PMLR (2019)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Cook, D.J., Holder, L.B.: Mining Graph Data. Wiley (2006)","DOI":"10.1002\/0470073047"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tcs.2013.01.020","volume":"509","author":"C Cooper","year":"2013","unstructured":"Cooper, C., Frieze, A., Radzik, T.: The cover times of random walks on random uniform hypergraphs. Theoret. Comput. Sci. 509, 51\u201369 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"9","key":"24_CR10","doi-asserted-by":"publisher","first-page":"3268","DOI":"10.1016\/j.laa.2011.11.018","volume":"436","author":"J Cooper","year":"2012","unstructured":"Cooper, J., Dutle, A.: Spectra of uniform hypergraphs. Linear Algebra Appl. 436(9), 3268\u20133292 (2012)","journal-title":"Linear Algebra Appl."},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"Dewar, M., et al.: Subhypergraphs in non-uniform random hypergraphs. arXiv preprint arXiv:1703.07686 (2017)","DOI":"10.24166\/im.03.2018"},{"issue":"3","key":"24_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10588-005-5377-0","volume":"11","author":"J Diesner","year":"2005","unstructured":"Diesner, J., Frantz, T.L., Carley, K.M.: Communication networks from the Enron email corpus \u201cit\u2019s always about the people. Enron is no different\u2019\u2019. Comput. Math. Organ. Theor. 11(3), 201\u2013228 (2005). https:\/\/doi.org\/10.1007\/s10588-005-5377-0","journal-title":"Comput. Math. Organ. Theor."},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"242","DOI":"10.3390\/e22020242","volume":"22","author":"C Guo","year":"2020","unstructured":"Guo, C., Yang, L., Chen, X., Chen, D., Gao, H., Ma, J.: Influential nodes identification in complex networks via information entropy. Entropy 22(2), 242 (2020)","journal-title":"Entropy"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Hayashi, K., Aksoy, S.G., Park, C.H., Park, H.: Hypergraph random walks, Laplacians, and clustering. In: Proceedings of the 29th ACM International Conference on Information & Knowledge Management, pp. 495\u2013504 (2020)","DOI":"10.1145\/3340531.3412034"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.aim.2013.05.007","volume":"244","author":"D Horak","year":"2013","unstructured":"Horak, D., Jost, J.: Spectra of combinatorial Laplace operators on simplicial complexes. Adv. Math. 244, 303\u2013336 (2013)","journal-title":"Adv. Math."},{"issue":"2","key":"24_CR16","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10878-013-9596-x","volume":"29","author":"S Hu","year":"2015","unstructured":"Hu, S., Qi, L.: The Laplacian of a uniform hypergraph. J. Comb. Optim. 29(2), 331\u2013366 (2015)","journal-title":"J. Comb. Optim."},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Huang, J., Zhang, R., Yu, J.X.: Scalable hypergraph learning and processing. In: 2015 IEEE International Conference on Data Mining, pp. 775\u2013780. IEEE (2015)","DOI":"10.1109\/ICDM.2015.33"},{"issue":"1","key":"24_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-019-10431-6","volume":"10","author":"I Iacopini","year":"2019","unstructured":"Iacopini, I., Petri, G., Barrat, A., Latora, V.: Simplicial models of social contagion. Nat. Commun. 10(1), 1\u20139 (2019)","journal-title":"Nat. Commun."},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9.: Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 137\u2013146 (2003)","DOI":"10.1145\/956750.956769"},{"issue":"12","key":"24_CR20","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1002\/andp.18471481202","volume":"148","author":"G Kirchhoff","year":"1847","unstructured":"Kirchhoff, G.: Ueber die aufl\u00f6sung der gleichungen, auf welche man bei der untersuchung der linearen vertheilung galvanischer str\u00f6me gef\u00fchrt wird. Ann. Phys. 148(12), 497\u2013508 (1847)","journal-title":"Ann. Phys."},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/comnet\/cnx039","volume":"6","author":"S Kirkland","year":"2018","unstructured":"Kirkland, S.: Two-mode networks exhibiting data loss. J. Complex Netw. 6(2), 297\u2013316 (2018)","journal-title":"J. Complex Netw."},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"118","DOI":"10.3390\/info8040118","volume":"8","author":"M Li","year":"2017","unstructured":"Li, M., Wang, X., Gao, K., Zhang, S.: A survey on information diffusion in online social networks: models and methods. Information 8(4), 118 (2017)","journal-title":"Information"},{"issue":"1","key":"24_CR23","first-page":"1","volume":"8","author":"Y Liu","year":"2018","unstructured":"Liu, Y., Yuan, J., Duan, B., Li, D.: Quantum walks on regular uniform hypergraphs. Sci. Rep. 8(1), 1\u20138 (2018)","journal-title":"Sci. Rep."},{"issue":"1","key":"24_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/15427951.2012.678151","volume":"9","author":"L Lu","year":"2013","unstructured":"Lu, L., Peng, X.: High-order random walks and generalized Laplacians on hypergraphs. Internet Math. 9(1), 3\u201332 (2013)","journal-title":"Internet Math."},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","volume":"197","author":"R Merris","year":"1994","unstructured":"Merris, R.: Laplacian matrices of graphs: a survey. Linear Algebra Appl. 197, 143\u2013176 (1994)","journal-title":"Linear Algebra Appl."},{"issue":"21","key":"24_CR26","doi-asserted-by":"publisher","first-page":"218301","DOI":"10.1103\/PhysRevLett.124.218301","volume":"124","author":"AP Mill\u00e1n","year":"2020","unstructured":"Mill\u00e1n, A.P., Torres, J.J., Bianconi, G.: Explosive higher-order Kuramoto dynamics on simplicial complexes. Phys. Rev. Lett. 124(21), 218301 (2020)","journal-title":"Phys. Rev. Lett."},{"key":"24_CR27","doi-asserted-by":"publisher","unstructured":"Mohar, B.: Some applications of Laplace eigenvalues of graphs. In: Hahn, G., Sabidussi, G. (eds.) Graph Symmetry. NATO ASI Series (Series C: Mathematical and Physical Sciences), vol. 497. Springer, Dordrecht (1997). https:\/\/doi.org\/10.1007\/978-94-015-8937-6_6","DOI":"10.1007\/978-94-015-8937-6_6"},{"key":"24_CR28","doi-asserted-by":"crossref","unstructured":"Shetty, J., Adibi, J.: Discovering important nodes through graph entropy the case of Enron email database. In: Proceedings of the 3rd International Workshop on Link Discovery, pp. 74\u201381 (2005)","DOI":"10.1145\/1134271.1134282"},{"issue":"7\u20138","key":"24_CR29","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.physleta.2014.01.004","volume":"378","author":"Y Sun","year":"2014","unstructured":"Sun, Y., Liu, C., Zhang, C.X., Zhang, Z.K.: Epidemic spreading on weighted complex networks. Phys. Lett. A 378(7\u20138), 635\u2013640 (2014)","journal-title":"Phys. Lett. A"},{"key":"24_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106118","volume":"89","author":"S Wang","year":"2020","unstructured":"Wang, S., Gong, M., Liu, W., Wu, Y.: Preventing epidemic spreading in networks by community detection and memetic algorithm. Appl. Soft Comput. 89, 106118 (2020)","journal-title":"Appl. Soft Comput."},{"key":"24_CR31","first-page":"1601","volume":"19","author":"D Zhou","year":"2006","unstructured":"Zhou, D., Huang, J., Sch\u00f6lkopf, B.: Learning with hypergraphs: Clustering, classification, and embedding. Adv. Neural. Inf. Process. Syst. 19, 1601\u20131608 (2006)","journal-title":"Adv. Neural. Inf. Process. Syst."}],"container-title":["Studies in Computational Intelligence","Complex Networks & Their Applications X"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93413-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T20:26:26Z","timestamp":1682627186000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93413-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030934125","9783030934132"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93413-2_24","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMPLEX NETWORKS","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":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwcna2021","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"}}]}}