SearcharxivSearch

arXiv · 1610.08242

Continuous spin models on annealed generalized random graphs

Abstract

We study Gibbs distributions of spins taking values in a general compact Polish space, interacting via a pair potential along the edges of a generalized random graph with a given asymptotic weight distribution $P$, obtained by annealing over the random graph distribution. First we prove a variational formula for the corresponding annealed pressure and provide criteria for absence of phase transitions in the general case. We furthermore study classes of models with second order phase transitions which include rotation-invariant models on spheres and models on intervals, and classify their critical exponents. We find critical exponents which are modified relative to the corresponding mean-field values when $P$ becomes too heavy-tailed, in which case they move continuously with the tail-exponent of $P$. For large classes of models they are the same as for the Ising model treated in \cite{DomGiaGibHofPri16}. On the other hand, we provide conditions under which the model is in a different universality class, and construct an explicit example of such a model on the interval.

Explore related subjects

Keep this discovery

BibTeXRIS

Sander Dommers, Christof Kuelske, Philipp Schriever. 2016-10-26. Continuous spin models on annealed generalized random graphs. https://arxiv.org/abs/1610.08242

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