SearcharxivSearch

arXiv · 1309.3851

Extreme Analysis of a Non-convex and Nonlinear Functional of Gaussian Processes -- On the Tail Asymptotics of Random Ordinary Differential Equations

Abstract

In this paper, we consider a stochastic system described by a differential equation admitting a spatially varying random coefficient. The differential equation has been employed to model various static physics systems such as elastic deformation, water flow, electric-magnetic fields, temperature distribution, etc. A random coefficient is introduced to account for the system's uncertainty and/or imperfect measurements. This random coefficient is described by a Gaussian process (the input process) and thus the solution to the differential equation (under certain boundary conditions) is a complexed functional of the input Gaussian process. In this paper, we focus the analysis on the one-dimensional case and derive asymptotic approximations of the tail probabilities of the solution to the equation that has various physics interpretations under different contexts. This analysis rests on the literature of the extreme analysis of Gaussian processes (such as the tail approximations of the supremum) and extends the analysis to more complexed functionals.

Explore related subjects

Keep this discovery

BibTeXRIS

Jingchen Liu, Xiang Zhou. 2013-09-17. Extreme Analysis of a Non-convex and Nonlinear Functional of Gaussian Processes -- On the Tail Asymptotics of Random Ordinary Differential Equations. https://arxiv.org/abs/1309.3851

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