Rapid Mixing of Hypergraph Independent Set

Yumeng Zhang
Yumeng Zhang

Random Struct. Algorithms, Volume abs/1610.07999, 2019.

Cited by: 5|Bibtex|Views8|DOI:https://doi.org/10.1002/rsa.20830
EI
Other Links: dblp.uni-trier.de|academic.microsoft.com|arxiv.org

Abstract:

We prove that the the mixing time of the Glauber dynamics for sampling independent sets on $n$-vertex $k$-uniform hypergraphs is $O(nlog n)$ when the maximum degree $Delta$ satisfies $Delta leq c 2^{k/2}$, improving on the previous bound [BDK06] of $Delta leq k-2$. This result brings the algorithmic bound to within a constant factor of th...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments