SearcharxivSearch

arXiv · 1611.00498

A coupled KPZ equation, its two types of approximations and existence of global solutions

Abstract

This paper concerns the multi-component coupled Kardar-Parisi-Zhang (KPZ) equation and its two types of approximations. One approximation is obtained as a simple replacement of the noise term by a smeared noise with a proper renormalization, while the other one introduced in [6] is suitable for studying the invariant measures. By applying the paracontrolled calculus introduced by Gubinelli et al. [8, 9], we show that two approximations have the common limit under the properly adjusted choice of renormalization factors for each of these approximations. In particular, if the coupling constants of the nonlinear term of the coupled KPZ equation satisfy the so-called "trilinear" condition, the renormalization factors can be taken the same in two approximations and the difference of the limits of two approximations are explicitly computed. Moreover, under the trilinear condition, the Wiener measure twisted by the diffusion matrix becomes stationary for the limit and we show that the solution of the limit equation exists globally in time when the initial value is sampled from the stationary measure. This is shown for the associated tilt process. Combined with the strong Feller property shown by Hairer and Mattingly [12], this result can be extended for all initial values.

Explore related subjects

Keep this discovery

BibTeXRIS

Tadahisa Funaki, Masato Hoshino. 2016-11-02. A coupled KPZ equation, its two types of approximations and existence of global solutions. https://arxiv.org/abs/1611.00498

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