Search arXiv⌕ Search

arXiv · 2609.31369

Convergence of a fully discrete approximation for the stochastic 2D Euler equations with Kraichnan transport noise

Abstract

We study a fully discrete approximation theory for the two-dimensional incompressible Euler equations on $\mathbb{T}^{2}$, in vorticity form, driven by Kraichnan-type transport noise and with $\mathbb{H}^{-1}(\mathbb{T}^2)$-valued initial vorticity. The main new ingredient is a finite-dimensional coercivity estimate for the torus Kraichnan model, which captures at the discrete level the regularizing mechanism induced by the rough transport noise. Together with a new compactness strategy based on continuous equation-based interpolants and localized discrete estimates, this coercivity estimate gives tightness of the approximations and shows that subsequential limit is a weak martingale solution of the Euler equations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Abhishek Chaudhary, Ujjwal Koley, Andreas Prohl. 2026-09-25. Convergence of a fully discrete approximation for the stochastic 2D Euler equations with Kraichnan transport noise. https://arxiv.org/abs/2609.31369

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

KEEP EXPLORING

Related papers

Improved Mixing Rates of Directed Cycles with Additional Sparse Interconnections

We analyze the absolute spectral gap of Markov chains on graphs obtained from a cycle of $n$ vertices and perturbed only at approximately $n^{1/ρ}$ random locations with an appropriate, possibly sparse, interconnection structure. Together with a strong asymmetry along the cycle, the gap of the resulting chain can be bounded inversely proportionally by the longest arc length (up to logarithmic factors) with high probability, providing a significant mixing speedup compared to the reversible version.

math.PR↗

Strongly vertex-reinforced jump process on graphs with bounded degree

We study asymptotic behaviours of a non-linear vertex-reinforced jump process defined on an arbitrary infinite graph with bounded degree. We prove that if the reinforcement function $w$ is reciprocally integrable and non-decreasing, then the process visits only a finite number of vertices. In the case where $w$ is regularly varying with index $α>1$, we show that the process eventually gets stuck on a star-shaped subgraph and there is exactly one vertex with unbounded local time.

math.PR↗

A Note on the Stability of Monotone Markov Chains

This note studies monotone Markov chains, a subclass of Markov chains with extensive applications in operations research and economics. While the properties that ensure the global stability of these chains are well studied, their establishment often relies on the fulfillment of a certain splitting condition. We address the challenges of verifying the splitting condition by introducing simple, applicable conditions that ensure global stability. The simplicity of these conditions is demonstrated through various examples including autoregressive processes, portfolio allocation problems and resource allocation dynamics.

math.PR↗