SearcharxivSearch

arXiv · 2510.14153

Multiscaling asymptotic behavior of solutions to random high-order heat equations

Abstract

This paper studies high-order partial differential equations with random initial conditions that have both long-memory and cyclic behavior. The cases of random initial conditions with the spectral singularities, both at zero (representing classical long-range dependence) and at non-zero frequencies (representing cyclic long-range dependence), are investigated. Using spectral methods and scaling techniques, it is proved that, after proper rescaling and normalization, the solutions converge to Gaussian random fields. For each type of equation, spectral representations and covariance functions of limit fields are given. For odd-order equations, we apply the kernel averaging of solutions to obtain nonexplosive and nondegenerate limits. It is shown that the different limit fields are determined by the even or odd orders of the equations and by the presence or absence of a spectral singularity at zero. Several numeric examples illustrate the obtained theoretical results.

Explore related subjects

Keep this discovery

BibTeXRIS

Maha Mosaad A Alghamdi, Nikolai Leonenko, Andriy Olenko. 2025-10-15. Multiscaling asymptotic behavior of solutions to random high-order heat equations. https://arxiv.org/abs/2510.14153

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