SearcharxivSearch

arXiv · 1703.06920

Non-robust phase transitions in the generalized clock model on trees

Abstract

Pemantle and Steif provided a sharp threshold for the existence of a RPT (robust phase transition) for the continuous rotator model and the Potts model in terms of the branching number and the second eigenvalue of the transfer operator, where a robust phase transition is said to occur if an arbitrarily weak coupling with symmetry-breaking boundary conditions suffices to induce symmetry breaking in the bulk. They further showed that for the Potts model RPT occurs at a different threshold than PT (phase transition in the sense of multiple Gibbs measures), and conjectured that RPT and PT should occur at the same threshold in the continuous rotator model. We consider the class of 4- and 5-state rotation-invariant spin models with reflection symmetry on general trees which contains the Potts model and the clock model with scalarproduct-interaction as limiting cases. The clock model can be viewed as a particular discretization which is obtained from the classical rotator model on the continuous one-dimensional sphere. We analyze the transition between PT=RPT and PT is unequal to RPT, in terms of the eigenvalues of the transfer matrix of the model at the critical threshold value for the existence of RPT. The transition between the two regimes depends sensitively on the third largest eigenvalue.

Explore related subjects

Keep this discovery

BibTeXRIS

Christof Kuelske, Philipp Schriever. 2017-03-20. Non-robust phase transitions in the generalized clock model on trees. https://doi.org/10.1007/s10955-017-1919-3

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