SearcharxivSearch

arXiv · 2405.12181

Regularization by rough Kraichnan noise for the generalised SQG equations

Abstract

We consider the generalised Surface Quasi-Geostrophic (gSQG) equations in $\mathbb R^2$ with parameter $\beta\in (0,1)$, an active scalar model interpolating between SQG ($\beta=1$) and the 2D Euler equations ($\beta=0$) in vorticity form. Existence of weak $(L^1\cap L^p)$-valued solutions in the deterministic setting is known, but their uniqueness is open. We show that the addition of a rough Stratonovich transport noise of Kraichnan type regularizes the PDE, providing strong existence and pathwise uniqueness of solutions for initial data $\theta_0\in L^1\cap L^p$, for suitable values $p\in[2,\infty]$ related to the regularity degree $\alpha$ of the noise and the singularity degree $\beta$ of the velocity field; in particular, we can cover any $\beta\in (0,1)$ for suitable $\alpha$ and $p$ and we can reach a suitable ("critical") threshold. The result also holds in the presence of external forcing $f\in L^1_t (L^1\cap L^p)$ and solutions are shown to depend continuously on the data of the problem; furthermore, they are well approximated by vanishing viscosity and regular approximations. With similar techniques, we also show well-posedness for two-dimensional linear transport equation with random drift, with the same noise.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Marco Bagnara, Lucio Galeati, Mario Maurelli. 2024-05-20. Regularization by rough Kraichnan noise for the generalised SQG equations. https://arxiv.org/abs/2405.12181

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