Hypergraph Laplacians in Diffusion Framework
DOI10.1007/978-3-030-93413-2_24OpenAlexW4206643359MaRDI QIDQ5050322FDOQ5050322
Authors: Mehmet Emin Aktas, Esra Akbas 
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
Recommendations
- On the diffusion geometry of graph Laplacians and applications
- Diffusion operator and spectral analysis for directed hypergraph Laplacian
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- scientific article; zbMATH DE number 475375
- scientific article; zbMATH DE number 2149406
- scientific article; zbMATH DE number 3351627
- scientific article; zbMATH DE number 1839816
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Hypergraphs (05C65) Random walks on graphs (05C81) Combinatorial aspects of simplicial complexes (05E45)
Cites Work
- Communication networks from the enron email corpus ``It's always about the people. Enron is no different
- Laplacian matrices of graphs: A survey
- Spectra of uniform hypergraphs
- Managing and mining graph data
- High-order random walks and generalized Laplacians on hypergraphs
- The Laplacian of a uniform hypergraph
- Epidemic spreading on weighted complex networks
- The cover times of random walks on random uniform hypergraphs
- Spectra of combinatorial Laplace operators on simplicial complexes
- Two-mode networks exhibiting data loss
Cited In (4)
This page was built for publication: Hypergraph Laplacians in Diffusion Framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5050322)
