Random walks and Laplacians on hypergraphs: When do they match?
Authors:
- Raffaella MulasRMRaffaella Mulas
- Christian KuehnCKChristian Kuehn
- Tobias BöhleTBTobias Böhle
- Jürgen JostJJJürgen Jost
- 10 May 2022
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 317, 26-41
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- German-Israeli Foundation for Scientific Research and Development (I-1514-304.6/2019)
- Alan Turing Institute
- Technische Universität München
- Engineering and Physical Sciences Research Council (EP/N510129/1)
- Institute for Advanced Study, Technische Universität München
- Volkswagen Foundation
This publication has 22 references indexed in Scilit:
- On the spectrum of hypergraphsLinear Algebra and its Applications, 2021
- Hypergraph Laplace operators for chemical reaction networksAdvances in Mathematics, 2019
- SIS Epidemic Propagation on HypergraphsBulletin of Mathematical Biology, 2016
- Generalized loop‐erased random walks and approximate reachabilityRandom Structures & Algorithms, 2012
- The percolation transition in correlated hypergraphsJournal of Statistical Mechanics: Theory and Experiment, 2009
- Hypergraphs and Cellular NetworksPLOS Computational Biology, 2009
- Renormalization Group for Strongly Coupled MapsJournal of Statistical Physics, 1999
- Nonperturbative Renormalization Group for Chaotic Coupled Map LatticesPhysical Review Letters, 1998
- Quantitative universality for a class of nonlinear transformationsJournal of Statistical Physics, 1978
- ber die partiellen Differenzengleichungen der mathematischen PhysikMathematische Annalen, 1928