SearcharxivSearch

arXiv · 1812.04422

Elliptic stochastic quantization

Abstract

We prove an explicit formula for the law in zero of the solution of a class of elliptic SPDE in $\mathbb{R}^2$. This formula is the simplest instance of dimensional reduction, discovered in the physics literature by Parisi and Sourlas (1979), which links the law of an elliptic SPDE in $d + 2$ dimension with a Gibbs measure in $d$ dimensions. This phenomenon is similar to the relation between an $\mathbb{R}^{d + 1}$ dimensional parabolic SPDE and its $\mathbb{R}^d$ dimensional invariant measure. As such, dimensional reduction of elliptic SPDEs can be considered a sort of elliptic stochastic quantisation procedure in the sense of Nelson (1966) and Parisi and Wu (1981). Our proof uses in a fundamental way the representation of the law of the SPDE as a supersymmetric quantum field theory. Dimensional reduction for the supersymmetric theory was already established by Klein et al. (1984). We fix a subtle gap in their proof and also complete the dimensional reduction picture by providing the link between the elliptic SPDE and the supersymmetric model. Even in our $d = 0$ context the arguments are non-trivial and a non-supersymmetric, elementary proof seems only to be available in the Gaussian case.

Explore related subjects

Keep this discovery

BibTeXRIS

Sergio Albeverio, Francesco C. De Vecchi, Massimiliano Gubinelli. 2018-12-11. Elliptic stochastic quantization. https://doi.org/10.1214/19-aop1404

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