SearcharxivSearch

arXiv · 2503.02314

Stochastic Stefan problem on moving hypersurfaces: an approach by a new framework of nonhomogeneous monotonicity

Abstract

The purpose of this paper is to establish the well-posedness of the stochastic Stefan problem on moving hypersurfaces. Through a specially designed transformation, it turns out we need to solve stochastic partial differential equations on a fixed hypersurface with a new kind of nonhomogeneous monotonicity involving a family of time-dependent operators. This new class of SPDEs is of independent interest and can also be applied to solve many other interesting models such as the stochastic $p$-Laplacian equations, stochastic Allen-Cahn equation and stochastic heat equations on time-dependent domains or hypersurfaces. (Monotone) Operator-valued calculus and geometric analysis of moving hypersurfaces play important roles in the study. Moreover, a forthcoming result on the well-posedness of stochastic 2D Navier-Stokes equation on moving domains is also based on our framework.

Explore related subjects

Keep this discovery

BibTeXRIS

Tianyi Pan, Wei Wang, Jianliang Zhai, Tusheng Zhang. 2025-03-04. Stochastic Stefan problem on moving hypersurfaces: an approach by a new framework of nonhomogeneous monotonicity. https://arxiv.org/abs/2503.02314

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