Sparse cuts in hypergraphs from random walks on simplicial complexes

DOI10.4230/LIPICS.SWAT.2024.33MaRDI QIDQ6891112zbMATH OpenFDO

Authors Anand Louis, R. Paul, Arka Ray

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

simplicial complexesrandom walksthreshold rankhypergraph expansionsparse cutshigh dimensional expanderlink expansion

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

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)