scispace - formally typeset
Journal ArticleDOI

Approach to equilibrium of Glauber dynamics in the one phase region. I. The attractive case

Reads0
Chats0
TLDR
In this paper, it is shown that the theory of complete analyticity and its dynamical counterpart due to Stroock and Zegarlinski cannot be applied, in general, to the whole one phase region since it requires mixing properties for regions of arbitrary shape.
Abstract
Various finite volume mixing conditions in classical statistical mechanics are reviewed and critically analyzed. In particular somefinite size conditions are discussed, together with their implications for the Gibbs measures and for the approach to equilibrium of Glauber dynamics inarbitrarily large volumes. It is shown that Dobrushin-Shlosman's theory ofcomplete analyticity and its dynamical counterpart due to Stroock and Zegarlinski, cannot be applied, in general, to the whole one phase region since it requires mixing properties for regions ofarbitrary shape. An alternative approach, based on previous ideas of Oliveri, and Picco, is developed, which allows to establish results on rapid approach to equilibrium deeply inside the one phase region. In particular, in the ferromagnetic case, we considerably improve some previous results by Holley and Aizenman and Holley. Our results are optimal in the sene that, for example, they show for the first time fast convergence of the dynamicsfor any temperature above the critical one for thed-dimensional Ising model with or without an external field. In part II we extensively consider the general case (not necessarily attractive) and we develop a new method, based on renormalizations group ideas and on an assumption of strong mixing in a finite cube, to prove hypercontractivity of the Markov semigroup of the Glauber dynamics.

read more

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI

Counting independent sets up to the tree threshold

TL;DR: It is shown that on any graph of maximum degree Δ correlations decay with distance at least as fast as they do on the regular tree of the same degree, which resolves an open conjecture in statistical physics.
Book ChapterDOI

Lectures on Glauber dynamics for discrete spin models

TL;DR: In this article, the state of the art of the theory of Glauber dynamics for classical lattice spin models of statistical mechanics is reviewed in a self-contained way, sometimes providing new and simpler proofs of the most relevant results.
Book ChapterDOI

The random geometry of equilibrium phases

TL;DR: In this article, the random geometry of equilibrium phases is discussed and percolation techniques are used to obtain specific information about the phase diagram of the system, such as clusters, open paths, connectedness etc.
Book ChapterDOI

Lectures on Logarithmic Sobolev Inequalities

TL;DR: In this paper, the authors define a logarithmic Sobolev inequality for spin systems on a lattice and a spectral gap inequality for Markov semi-groups with long range interaction.
Journal ArticleDOI

Quantum speedup of Monte Carlo methods

TL;DR: In this paper, the authors describe a quantum algorithm which can accelerate Monte Carlo methods in a very general setting, which estimates the expected output value of an arbitrary randomized or quantum subroutine with bounded variance, achieving a near-quadratic speedup over the best possible classical algorithm.
References
More filters
Book

Interacting Particle Systems

TL;DR: The construction, and other general results are given in this paper, with values in [0, ] s. The voter model, the contact process, the nearest-particle system, and the exclusion process.
Journal ArticleDOI

Correlation inequalities on some partially ordered sets

TL;DR: In this article, it was shown that increasing functions on a finite distributive lattice are positively correlated by positive measures satisfying a suitable convexity property, and applications to Ising ferromagnets in an arbitrary magnetic field and to the random cluster model were given.
Journal ArticleDOI

Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow

TL;DR: A new upper bound on the mixing rate is presented, based on the solution to a multicommodity flow problem in the Markov chain viewed as a graph, and improved bounds are obtained for the runtimes of randomised approximation algorithms for various problems, including computing the permanent of a 0–1 matrix, counting matchings in graphs, and computing the partition function of a ferromagnetic Ising system.