Pages that link to "Item:Q3503609"
From MaRDI portal
The following pages link to Path coupling using stopping times and counting independent sets and colorings in hypergraphs (Q3503609):
Displaying 14 items.
- The complexity of approximately counting in 2-spin systems on \(k\)-uniform bounded-degree hypergraphs (Q342704) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width (Q463068) (← links)
- Sampling Eulerian orientations of triangular lattice graphs (Q1026226) (← links)
- Counting hypergraph matchings up to uniqueness threshold (Q1740650) (← links)
- An extension of path coupling and its application to the Glauber dynamics for graph colorings (Q2719118) (← links)
- On Sampling Simple Paths in Planar Graphs According to Their Lengths (Q2946419) (← links)
- Approximation via Correlation Decay When Strong Spatial Mixing Fails (Q4634020) (← links)
- Rapid mixing of hypergraph independent sets (Q5229340) (← links)
- Counting Hypergraph Colorings in the Local Lemma Regime (Q5232330) (← links)
- Approximate Counting via Correlation Decay in Spin Systems (Q5743448) (← links)
- Inapproximability of counting independent sets in linear hypergraphs (Q6121429) (← links)
- On the zeroes of hypergraph independence polynomials (Q6632793) (← links)
- AntiFactor is FPT parameterized by treewidth and list size (but counting is hard) (Q6670813) (← links)
