Hypergraph Laplacians in Diffusion Framework
From MaRDI portal
Publication:5050322
DOI10.1007/978-3-030-93413-2_24OpenAlexW4206643359MaRDI QIDQ5050322
Publication date: 15 November 2022
Published in: Complex Networks & Their Applications X (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.08867
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Combinatorial aspects of simplicial complexes (05E45) Random walks on graphs (05C81)
Cites Work
- The cover times of random walks on random uniform hypergraphs
- Spectra of uniform hypergraphs
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different
- Laplacian matrices of graphs: A survey
- The Laplacian of a uniform hypergraph
- Managing and mining graph data
- Spectra of combinatorial Laplace operators on simplicial complexes
- Two-mode networks exhibiting data loss
- High-Order Random Walks and Generalized Laplacians on Hypergraphs
- Epidemic spreading on weighted complex networks
This page was built for publication: Hypergraph Laplacians in Diffusion Framework