Glauber Dynamics on Trees and Hyperbolic Graphs

Details Glauber Dynamics on Trees and Hyperbolic Graphs Glauber Dynamics on Trees and Hyperbolic Graphs

2003-08-28

arxiv.org/abs/math/0308284v3

Mathematics

Probability

To appear in Probability Theory and Related Fields

Scientific paper

We study continuous time Glauber dynamics for random configurations with local constraints (e.g. proper coloring, Ising and Potts models) on finite graphs with $n$ vertices and of bounded degree. We show that the relaxation time (defined as the reciprocal of the spectral gap $|\lambda_1-\lambda_2|$) for the dynamics on trees and on planar hyperbolic graphs, is polynomial in $n$. For these hyperbolic graphs, this yields a general polynomial sampling algorithm for random configurations. We then show that if the relaxation time $\tau_2$ satisfies $\tau_2=O(1)$, then the correlation coefficient, and the mutual information, between any local function (which depends only on the configuration in a fixed window) and the boundary conditions, decays exponentially in the distance between the window and the boundary. For the Ising model on a regular tree, this condition is sharp.

Affiliated with

Also associated with

No associations

Rating

Glauber Dynamics on Trees and Hyperbolic Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Glauber Dynamics on Trees and Hyperbolic Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Glauber Dynamics on Trees and Hyperbolic Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257783