On the public citation graph
Random sampling of 3‐colorings in ℤ2
0 signed · 34 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rsa.3240070205openalex-snapshot
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
inferredcites →https://doi.org/10.1007/bf01940872openalex-snapshot
On the Number of Eulerian Orientations of a Graph
inferredcites →https://doi.org/10.1007/bf02199113openalex-snapshot
Absence of phase transition for antiferromagnetic Potts models via the Dobrushin uniqueness theorem
inferredcites →https://doi.org/10.1007/bfb0068322openalex-snapshot
Random walks on finite groups and rapidly mixing markov chains
inferredcites →https://doi.org/10.1017/cbo9780511721335.005openalex-snapshot
Random Walks on Combinatorial Objects
inferredcites →https://doi.org/10.1063/1.533196openalex-snapshot
Improved bounds for sampling colorings
inferredcites →https://doi.org/10.1063/1.533199openalex-snapshot
Analyzing Glauber dynamics by comparison of Markov chains
inferredcites →https://doi.org/10.1088/0031-9112/34/4/045openalex-snapshot
Exactly Solved Models in Statistical Mechanics
inferredcites →https://doi.org/10.1109/sfcs.1997.646111openalex-snapshot
Path coupling: A technique for proving rapid mixing in Markov chains
inferredcites →https://doi.org/10.1137/s0097539799360355openalex-snapshot
Markov Chain Algorithms for Planar Lattice Structures
inferredcites →https://doi.org/10.1214/aoap/1026915617openalex-snapshot
Markov chain decomposition for convergence rate analysis
inferredcites →https://doi.org/10.1214/aoap/1034968224openalex-snapshot
Logarithmic Sobolev inequalities for finite Markov chains
inferredcites →https://doi.org/10.1214/aoap/1177005359openalex-snapshot
Comparison Theorems for Reversible Markov Chains
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rsa.20303openalex-snapshot
The mixing time of Glauber dynamics for coloring regular trees
inferred← citeshttps://doi.org/10.1002/rsa.20560openalex-snapshot
Randomly coloring planar graphs with fewer colors than the maximum degree
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_12openalex-snapshot
Sampling Grid Colorings with Fewer Colors
inferred← citeshttps://doi.org/10.1007/978-3-540-74839-7_17openalex-snapshot
Mixing 3-Colourings in Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/s00220-021-04181-0openalex-snapshot
Delocalization of Uniform Graph Homomorphisms from $${\mathbb {Z}}^2$$ to $${\mathbb {Z}}$$
inferred← citeshttps://doi.org/10.1007/s10955-023-03181-9openalex-snapshot
The Blume–Emery–Griffiths Model on the FAD Point and on the AD Line
inferred← citeshttps://doi.org/10.1016/j.ejc.2009.03.011openalex-snapshot
Mixing 3-colourings in bipartite graphs
inferred← citeshttps://doi.org/10.1016/j.jda.2006.04.001openalex-snapshot
Path coupling without contraction
inferred← citeshttps://doi.org/10.1016/j.jda.2008.09.006openalex-snapshot
Sampling Eulerian orientations of triangular lattice graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.01.014openalex-snapshot
Sampling weighted perfect matchings on the square-octagon lattice
inferred← citeshttps://doi.org/10.1017/s0963548321000080openalex-snapshot
Polynomial-time approximation algorithms for the antiferromagnetic Ising model on line graphs
inferred← citeshttps://doi.org/10.1088/1742-5468/2005/10/p10012openalex-snapshot
Rapid mixing for lattice colourings with fewer colours
inferred← citeshttps://doi.org/10.1109/focs.2004.63openalex-snapshot
Strong Spatial Mixing for Lattice Graphs with Fewer Colours
inferred← citeshttps://doi.org/10.1112/s1461157000001169openalex-snapshot
Improved Mixing Bounds for the Anti-Ferromagnetic Potts Model on Z 2
inferred← citeshttps://doi.org/10.1137/12089538xopenalex-snapshot
Phase coexistence and torpid mixing in the 3-coloring model on ${\mathbb Z}^d$
inferred← citeshttps://doi.org/10.1137/s0097539704445470openalex-snapshot
Strong Spatial Mixing with Fewer Colors for Lattice Graphs
inferred← citeshttps://doi.org/10.1142/s012905410800639xopenalex-snapshot
A SYSTEMATIC SCAN FOR 7-COLOURINGS OF THE GRID
inferred← citeshttps://doi.org/10.1214/105051605000000683openalex-snapshot
Systematic scan for sampling colorings
inferred← citeshttps://doi.org/10.70675/b9a69b41z56efz40ccz814dza2639f67b149openalex-snapshot
Reconfiguration and combinatorial games
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.