Random walks and Laplacians on hypergraphs: when do they match?

DOI10.1016/j.dam.2022.04.009OpenAlexW3174191946MaRDI QIDQ2142684

Christian Kuehn, Tobias Böhle, Raffaella Mulas, Juergen Jost

Publication date: 27 May 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.11663

zbMATH Keywords

dynamical systemsspectral theoryhypergraphsLaplacians

Mathematics Subject Classification ID

Hypergraphs (05C65) Dynamics of random walks, random surfaces, lattice animals, etc. in time-dependent statistical mechanics (82C41) Dynamical systems involving maps of trees and graphs (37E25) Random walks on graphs (05C81) Anomalous diffusion models (subdiffusion, superdiffusion, continuous-time random walks, etc.) (60K50)

Related Items (2)

Hyperlink prediction via local random walks and Jensen–Shannon divergence ⋮ Nonbacktracking Spectral Clustering of Nonuniform Hypergraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• SIS epidemic propagation on hypergraphs
• Networks beyond pairwise interactions: structure and dynamics
• Quantitative universality for a class of nonlinear transformations
• Renormalization group for strongly coupled maps
• Hypergraph Laplace operators for chemical reaction networks
• Spectral theory of Laplace operators on oriented hypergraphs
• Sharp bounds for the largest eigenvalue
• A Cheeger cut for uniform hypergraphs
• Estimating cellular redundancy in networks of genetic expression
• On the spectrum of hypergraphs
• Mathematical methods in biology and neurobiology
• The percolation transition in correlated hypergraphs
• Probability on Graphs
• Normalized Laplace operators for hypergraphs with real coefficients
• Generalized loop‐erased random walks and approximate reachability
• Chaos

This page was built for publication: Random walks and Laplacians on hypergraphs: when do they match?