SearcharxivSearch

arXiv · 1602.08900

Metastability for Glauber dynamics on random graphs

Abstract

In this paper we study metastable behaviour at low temperature of Glauber spin-flip dynamics on random graphs. We fix a large number of vertices and randomly allocate edges according to the Configuration Model with a prescribed degree distribution. Each vertex carries a spin that can point either up or down. Each spin interacts with a positive magnetic field, while spins at vertices that are connected by edges also interact with each other via a ferromagnetic pair potential. We start from the configuration where all spins point down, and allow spins to flip up or down according to a Metropolis dynamics at positive temperature. We are interested in the time it takes the system to reach the configuration where all spins point up. In order to achieve this transition, the system needs to create a sufficiently large droplet of up-spins, called critical droplet, which triggers the crossover. In the limit as the temperature tends to zero, and subject to a certain \emph{key hypothesis} implying metastable behaviour, the average crossover time follows the classical \emph{Arrhenius law}, with an exponent and a prefactor that are controlled by the \emph{energy} and the \emph{entropy} of the critical droplet. The crossover time divided by its average is exponentially distributed. We study the scaling behaviour of the exponent as the number of vertices tends to infinity, deriving upper and lower bounds. We also identify a regime for the magnetic field and the pair potential in which the key hypothesis is satisfied. The critical droplets, representing the saddle points for the crossover, have a size that is of the order of the number of vertices. This is because the random graphs generated by the Configuration Model are expander graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Sander Dommers, Frank den Hollander, Oliver Jovanovski, Francesca Nardi. 2016-02-29. Metastability for Glauber dynamics on random graphs. https://arxiv.org/abs/1602.08900

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR