SearcharxivSearch

arXiv · 2305.12413

Infinite disorder renormalization fixed point for the continuum random field Ising chain

Abstract

We consider the continuum version of the random field Ising model in one dimension: this model arises naturally as weak disorder scaling limit of the original Ising model. Like for the Ising model, a spin configuration is conveniently described as a sequence of spin domains with alternating signs (domain-wall structure). We show that for fixed centered external field and as spin-spin couplings become large, the domain-wall structure scales to a disorder dependent limit that coincides with the infinite disorder fixed point process introduced by D. S. Fisher in the context of zero temperature quantum Ising chains. In particular, our results establish a number of predictions that one can find in [Fisher, Le Doussal and Monthus 2001]. The infinite disorder fixed point process for centered external field is equivalently described in terms of the process of suitably selected extrema of a Brownian trajectory introduced and studied by J. Neveu and J. Pitman [Neveu and Pitman 1989]. This characterization of the infinite disorder fixed point is one of the important ingredients of our analysis.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Orphée Collin, Giambattista Giacomin, Yueyun Hu. 2023-05-21. Infinite disorder renormalization fixed point for the continuum random field Ising chain. https://doi.org/10.1007/s00440-024-01284-2

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