Pages that link to "Item:Q2737884"
From MaRDI portal
The following pages link to Improved bounds for sampling colorings (Q2737884):
Displaying 50 items.
- Classifying coloring graphs (Q284746) (← links)
- Algorithms to approximately count and sample conforming colorings of graphs (Q299070) (← links)
- Correlation decay and deterministic FPTAS for counting colorings of a graph (Q414468) (← links)
- On zero-free regions for the anti-ferromagnetic Potts model on bounded-degree graphs (Q824265) (← links)
- Coupling with the stationary distribution and improved sampling for colorings and independent sets (Q862206) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- Paths between colourings of sparse graphs (Q1621073) (← links)
- Rigidity of 3-colorings of the discrete torus (Q1650127) (← links)
- Forbidden subgraphs of coloring graphs (Q1684531) (← links)
- Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials (Q1690044) (← links)
- On a conjecture of Mohar concerning Kempe equivalence of regular graphs (Q1719578) (← links)
- Cut-colorings in coloring graphs (Q1733874) (← links)
- Efficiency test of pseudorandom number generators using random walks (Q1765462) (← links)
- Glauber dynamics on trees: Boundary conditions and mixing time (Q1766910) (← links)
- Frozen colourings of bounded degree graphs (Q1792087) (← links)
- Random walks on a finite graph with congestion points (Q1827003) (← links)
- Perfect sampling using bounding chains. (Q1879888) (← links)
- Phase transition for the mixing time of the Glauber dynamics for coloring regular trees (Q1931316) (← links)
- Exact thresholds for Ising-Gibbs samplers on general graphs (Q1942118) (← links)
- Randomly coloring simple hypergraphs (Q1944148) (← links)
- Counting proper colourings in 4-regular graphs via the Potts model (Q1991414) (← links)
- On mixing of Markov chains: coupling, spectral independence, and entropy factorization (Q2105155) (← links)
- An FPTAS for the hardcore model on random regular bipartite graphs (Q2166750) (← links)
- What can be sampled locally? (Q2189170) (← links)
- Randomly coloring simple hypergraphs with fewer colors (Q2361498) (← links)
- A general lower bound for mixing of single-site dynamics on graphs (Q2456048) (← links)
- Path coupling without contraction (Q2457299) (← links)
- Connectedness of the graph of vertex-colourings (Q2470462) (← links)
- On Vizing's edge colouring question (Q2680572) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- Rigidity of proper colorings of \(\mathbb{Z}^d \) (Q2689658) (← links)
- Very rapidly mixing Markov chains for \(2\Delta\)-colorings and for independent sets in a graph with maximum degree 4 (Q2712575) (← links)
- On Markov chains for randomly \(H\)-coloring a graph (Q2731604) (← links)
- Absence of nonlocal counterterms in the gauge boson propagator in axial-type gauges (Q2761909) (← links)
- Connecting Green functions in an arbitrary pair of gauges and an application to planar gauges (Q2783571) (← links)
- Local uniformity properties for Glauber dynamics on graph colorings (Q2852545) (← links)
- Randomly coloring constant degree graphs (Q2852546) (← links)
- Sampling colourings of the triangular lattice (Q2904597) (← links)
- Coupling with the stationary distribution and improved sampling for colorings and independent sets (Q2921767) (← links)
- Some Problems on Approximate Counting in Graphs and Matroids (Q2971623) (← links)
- On systematic scan for sampling H-colorings of the path (Q3055763) (← links)
- Randomly coloring random graphs (Q3055885) (← links)
- Strong Spatial Mixing and Rapid Mixing with Five Colours for the Kagome Lattice (Q3091978) (← links)
- The Glauber dynamics for edge‐colorings of trees (Q3386527) (← links)
- Random Instances of Problems in NP – Algorithms and Statistical Physics (Q3464473) (← links)
- Very rapid mixing of the Glauber dynamics for proper colorings on bounded‐degree graphs (Q4534221) (← links)
- APPLICATION OF FINITE FIELD-DEPENDENT BRS TRANSFORMATIONS TO PROBLEMS OF THE COULOMB GAUGE (Q4547528) (← links)
- Deterministic Polynomial-Time Approximation Algorithms for Partition Functions and Graph Polynomials (Q4602373) (← links)
- (Q4660717) (← links)
- Random sampling of 3‐colorings in ℤ<sup>2</sup> (Q4736775) (← links)
