14 problems
Polynomial mixing-time conjecture. For any graph , the Glauber dynamics on the -colourings of for has polynomial mixing time.
Let be any graph equipped with a ferromagnetic Ising model, with couplings , and let denote the relaxation time of its Glauber dynamics. Peres's monotonicity c…
Let be a finite graph of maximum degree , let be the Glauber transition matrix at complex fugacity , and let denote its spectral radius o…
Universal Type I conjecture. The model is of Type for every initial density .
Let be a tree with vertices, and let be the fugacity of the hardcore model. The Glauber dynamics is the single-site Markov chain for this Gibbs distribution, and…
Let be a graph of maximum degree , and consider the Glauber dynamics for sampling proper -colorings of . Jerrum's conjecture. The Glauber dynamics for sampling…
Expander-graph conjecture. There is a choice of corrupted set such that the conclusion to Theorem holds.
Let be zero-temperature Glauber dynamics on , and define … Here is the threshold for fixation at opinion . Fixation-threshold…
Let denote the critical set of configurations, let denote the associated quantity governing the transition from the critical set, and let…
Let denote the energy barrier and let be the probability law of the random graph. Scaling conjecture for the critical height. There exists a…
Let , and their discretizations be as above, and let denote the height function under Glauber dynamics started from an arbitrary i…
Let be a regular tree of even degree, and let the initial spin configuration have a product distribution whose Bernoulli marginals are biased. Consider zero-temperature Glauber…
Let be a sequence of transitive graphs, and consider the Glauber dynamics for the Ising model on these graphs. Let denote the critical temperature, let …
Let be a sequence of transitive graphs, and let denote the mixing time of Glauber dynamics on . A sequence of chains has cut-off if there are times…