Random walks and Laplacians on hypergraphs: When do they match?
In particular, we introduce and analyze general random walk Laplacians for hypergraphs, and we compare them to hypergraph normalized Laplacians that are not necessarily related to random walks, but which are motivated by biological and chemical networks.
We show that, although these two classes of Laplacians coincide in the case of graphs, they appear to have important conceptual differences in the general case.
We study the spectral properties of both classes, as well as their applications to Coupled Hypergraph Maps: discrete-time dynamical systems that generalize the well-known Coupled Map Lattices on graphs.
Our results also show why for some hypergraph Laplacian variants one expects more classical results from (weighted) graphs to generalize directly, while these results must fail for other hypergraph Laplacians.
R. Mulas, C. Kühn, T. Böhle, J. Jost, Random walks and Laplacians on hypergraphs: When do they match?, Discrete Applied Mathematics 317 (2022) 26-41.