Pages that link to "Item:Q4705336"

The following pages link to A more rapidly mixing Markov chain for graph colorings (Q4705336):

Displaying 31 items.

• Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
• On the expected time for Herman's probabilistic self-stabilizing algorithm (Q817822) (← links)
• Convergence rates of Markov chains for some self-assembly and non-saturated Ising models (Q1008719) (← links)
• Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095) (← links)
• Coupling and self-stabilization (Q1953653) (← links)
• Non-negative Ollivier curvature on graphs, reverse Poincaré inequality, Buser inequality, Liouville property, Harnack inequality and eigenvalue estimates (Q2111989) (← links)
• Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
• Path coupling without contraction (Q2457299) (← links)
• Sampling 3-colourings of regular bipartite graphs (Q2461977) (← links)
• A Markov chain on the solution space of edge colorings of bipartite graphs (Q2696608) (← links)
• Very rapidly mixing Markov chains for \(2\Delta\)-colorings and for independent sets in a graph with maximum degree 4 (Q2712575) (← links)
• Improved bounds for sampling colorings (Q2737884) (← links)
• Mixing Times of Markov Chains of 2-Orientations (Q2803817) (← links)
• Sampling and counting 3-orientations of planar triangulations (Q2804991) (← links)
• Coupling with the stationary distribution and improved sampling for colorings and independent sets (Q2921767) (← links)
• Fastest mixing Markov chain problem for the union of two cliques (Q3090727) (← links)
• Mixing of the Glauber dynamics for the ferromagnetic Potts model (Q3467578) (← links)
• (Q4440428) (← links)
• Delayed path coupling and generating random permutations (Q4521548) (← links)
• Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs (Q4534221) (← links)
• (Q4660721) (← links)
• Rapid mixing for lattice colourings with fewer colours (Q4968808) (← links)
• Sampling biased monotonic surfaces using exponential metrics (Q4987255) (← links)
• Randomly coloring graphs of logarithmically bounded pathwidth (Q5009556) (← links)
• The generalized distance spectrum of a graph and applications (Q5038134) (← links)
• The Markov chain of colourings (Q5101430) (← links)
• Variable length path coupling (Q5433262) (← links)
• (Q5501292) (← links)
• LATIN 2004: Theoretical Informatics (Q5901628) (← links)
• Sampling from the low temperature Potts model through a Markov chain on flows (Q6077056) (← links)
• New algorithms and analyses for sum-preserving encryption (Q6135423) (← links)