Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1808.02594

The dynamical sine-Gordon model in the full subcritical regime

Ajay Chandra·Martin Hairer·Hao Shen
View original source ↗Read source document ↗Export metadata ↓

Abstract

We prove that the dynamical sine-Gordon equation on the two dimensional torus introduced in [HS16] is locally well-posed for the entire subcritical regime. At first glance this equation is far out of the scope of the local existence theory available in the framework of regularity structures [Hai14, BHZ16, CH16, BCCH17] since it involves a non-polynomial nonlinearity and the solution is expected to be a distribution (without any additional small parameter as in [FG17, HX18]). In [HS16] this was overcome by a change of variable, but the new equation that arises has a multiplicative dependence on highly non-Gaussian noises which makes stochastic estimates highly non-trivial - as a result [HS16] was only able to treat part of the subcritical regime. Moreover, the cumulants of these noises fall out of the scope of the later work [CH16]. In this work we systematically leverage "charge" cancellations specific to this model and obtain stochastic estimates that allow us to cover the entire subcritical regime.

Explore related subjects

math.PRmath-phmath.APmath.MP

Keep this discovery

BibTeXRIS

Ajay Chandra, Martin Hairer, Hao Shen. 2018-08-08. The dynamical sine-Gordon model in the full subcritical regime. https://arxiv.org/abs/1808.02594

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗