A note on Cheeger inequalities for uniform hypergraphs
From MaRDI portal
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- A Cheeger cut for uniform hypergraphs
- A Cheeger-type inequality on simplicial complexes
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- Eigenvalues and expanders
- Four proofs for the Cheeger inequality and graph partition algorithms
- Geometric bounds for eigenvalues of Markov chains
- Higher dimensional discrete Cheeger inequalities
- scientific article; zbMATH DE number 2133152 (Why is no real title available?)
- scientific article; zbMATH DE number 3337135 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Hypergraph Laplace operators for chemical reaction networks
- Improved Cheeger's inequality, analysis of spectral partitioning algorithms through higher order spectral gap
- Isoperimetric Inequalities in Mathematical Physics. (AM-27)
- Isoperimetric inequalities in simplicial complexes
- Isoperimetric numbers of graphs
- Normalized Laplacian eigenvalues of hypergraphs
- On the spectrum and linear programming bound for hypergraphs
- On the spectrum of hypergraphs
- Random walks and Laplacians on hypergraphs: when do they match?
- Spectra of hypergraphs and applications
- Spectral theory of Laplace operators on oriented hypergraphs
- The signless Laplacian matrix of hypergraphs
This page was built for publication: A note on Cheeger inequalities for uniform hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906732)
