SearcharxivSearch

arXiv · 2210.01239

Rearranged Stochastic Heat Equation

Abstract

The purpose of this work is to provide an explicit construction of a strong Feller semigroup on the space of probability measures over the real line that additionally maps bounded measurable functions into Lipschitz continuous functions, with a Lipschitz constant that blows up in an integrable manner in small time. Our construction relies on a rearranged version of the stochastic heat equation on the circle driven by a coloured noise. Formally, this stochastic equation writes as a reflected equation in infinite dimension. Under the action of the rearrangement, the solution is forced to live in a space of quantile functions that is isometric to the space of probability measures on the real line. We prove the equation to be solvable by means of an Euler scheme in which we alternate flat dynamics in the space of random variables on the circle with a rearrangement operation that projects back the random variables onto the subset of quantile functions. A first challenge is to prove that this scheme is tight. A second one is to provide a consistent theory for the limiting reflected equation and in particular to interpret in a relevant manner the reflection term. The last step in our work is to establish the aforementioned Lipschitz property of the semigroup by adapting earlier ideas from the Bismut-Elworthy-Li formula.

Explore related subjects

Keep this discovery

BibTeXRIS

François Delarue, William R. P. Hammersley. 2022-10-03. Rearranged Stochastic Heat Equation. https://arxiv.org/abs/2210.01239

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