Sparse cuts in hypergraphs from random walks on simplicial complexes
From MaRDI portal
Cites work
- A Cheeger-type inequality on simplicial complexes
- A matrix trickle-down theorem on simplicial complexes and applications to sampling colorings
- Agreement testing theorems on layered set systems
- Approximating constraint satisfaction problems on high-dimensional expanders
- Approximation algorithms for hypergraph small-set expansion and small-set vertex expansion
- Boolean function analysis on high-dimensional expanders
- Cheeger inequalities for submodular transformations
- Construction of new local spectral high dimensional expanders
- High dimensional expanders imply agreement expanders
- High dimensional expanders: eigenstripping, pseudorandomness, and unique games
- High dimensional random walks and colorful expansion
- High order random walks: beyond spectral gap
- Higher dimensional discrete Cheeger inequalities
- Homological connectivity of random k -dimensional complexes
- Homological connectivity of random 2-complexes
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- Isoperimetric inequalities in simplicial complexes
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- Local spectral expansion approach to high dimensional expanders. II: Mixing and geometrical overlapping
- Log-concave polynomials. II: High-dimensional walks and an FPRAS for counting bases of a matroid
- Max cut and the smallest eigenvalue
- Near-linear time decoding of Ta-Shma’s codes via splittable regularity
- On eigenvalues of random complexes
- On expansion and topological overlap
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Simplicial complexes: spectrum, homology and random walks
- Spectral independence in high-dimensional expanders and applications to the hardcore model
- Spectral properties of hypergraph Laplacian and approximation algorithms
- Subexponential algorithms for unique games and related problems
This page was built for publication: Sparse cuts in hypergraphs from random walks on simplicial complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891112)
