SearcharxivSearch

arXiv · 2301.00211

Asymptotically autonomous robustness in Probability of non-autonomous random attractors for stochastic convective Brinkman-Forchheimer equations on $\mathbb{R}^3$

Abstract

This article is concerned with the \emph{asymptotically autonomous robustness} (almost surely and in probability) of non-autonomous random attractors for two stochastic versions of 3D convective Brinkman-Forchheimer (CBF) equations defined on the whole space $\mathbb{R}^3$: $$\frac{\partial\boldsymbol{v}}{\partial t}-\mu \Delta\boldsymbol{v}+(\boldsymbol{v}\cdot\nabla)\boldsymbol{v} +\alpha\boldsymbol{v}+ \beta|\boldsymbol{v}|^{r-1}\boldsymbol{v}+\nabla p=\boldsymbol{f}(t)+``\mbox{stochastic terms}",\quad \nabla\cdot\boldsymbol{v}=0,$$ with initial and boundary vanishing conditions, where $\mu,\alpha,\beta >0$, $r\geq1$ and $\boldsymbol{f}(\cdot)$ is a given time-dependent external force field. By the asymptotically autonomous robustness of a non-autonomous random attractor $ \mathscr{A}=\{ \mathscr{A}(\tau,\omega): \tau\in\mathbb{R}, \omega\in\Omega\}$ we mean its time-section $\mathscr{A}(\tau,\omega)$ is robust to a time-independent random set as time $\tau$ tends to negative infinity according to the Hausdorff semi-distance of the underlying space. Our goal is to study this topic, almost surely and in probability, for the non-autonomous 3D CBF equations when the stochastic term is a linear multiplicative or additive noise, and the time-dependent forcing converges towards a time-independent function. Our main results contain two cases: i) $r\in(3,\infty)$ with any $\beta,\mu>0$; ii) $r=3$ with $2\beta\mu\geq1$. The main procedure to achieve our goal is how to justify that the usual pullback asymptotic compactness of the solution operators is uniform on some \emph{uniformly} tempered universes over an \emph{infinite} time-interval $(-\infty,\tau]$. This can be done by a method based on Kuratowski's measure of noncompactness.

Explore related subjects

Keep this discovery

BibTeXRIS

Kush Kinra, Manil T. Mohan, Renhai Wang. 2022-12-31. Asymptotically autonomous robustness in Probability of non-autonomous random attractors for stochastic convective Brinkman-Forchheimer equations on $\mathbb{R}^3$. https://arxiv.org/abs/2301.00211

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