A Cheeger cut for uniform hypergraphs
From MaRDI portal
Publication:2053692
DOI10.1007/s00373-021-02348-zzbMath1479.05241arXiv2011.06816OpenAlexW3105807303MaRDI QIDQ2053692
Publication date: 30 November 2021
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.06816
Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology ⋮ Random walks and Laplacians on hypergraphs: when do they match? ⋮ Estimating cellular redundancy in networks of genetic expression
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SIS epidemic propagation on hypergraphs
- An oriented hypergraphic approach to algebraic graph theory
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Spectral partitioning works: planar graphs and finite element meshes
- Hypergraph Laplace operators for chemical reaction networks
- Spectral theory of Laplace operators on oriented hypergraphs
- Sharp bounds for the largest eigenvalue
- On the spectrum of hypergraphs
- Stochastic dynamics on hypergraphs and the spatial majority rule model
- Consistency of spectral clustering
- Minimal embedding dimensions of connected neural codes
- The 1-Laplacian Cheeger Cut: Theory and Algorithms
- A note on the isoperimetric constant
- Spectral Properties of Hypergraph Laplacian and Approximation Algorithms
- Difference Equations, Isoperimetric Inequality and Transience of Certain Random Walks
- The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous
- Isoperimetric Inequalities in Mathematical Physics. (AM-27)
