Search arXivSearch

arXiv · 1805.05615

Simple Nonlinear Models with Rigorous Extreme Events and Heavy Tails

Abstract

Extreme events and the heavy tail distributions driven by them are ubiquitous in various scientific, engineering and financial research. They are typically associated with stochastic instability caused by hidden unresolved processes. Previous studies have shown that such instability can be modeled by a stochastic damping in conditional Gaussian models. However, these results are mostly obtained through numerical experiments, while a rigorous understanding of the underlying mechanism is sorely lacking. This paper contributes to this issue by establishing a theoretical framework, in which the tail density of conditional Gaussian models can be rigorously determined. In rough words, we show that if the stochastic damping takes negative values, the tail is polynomial; if the stochastic damping is nonnegative but takes value zero, the tail is between exponential and Gaussian. The proof is established by constructing a novel, product-type Lyapunov function, where a Feynman-Kac formula is applied. The same framework also leads to a non-asymptotic large deviation bound for long-time averaging processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew J. Majda, Xin T. Tong. 2018-05-15. Simple Nonlinear Models with Rigorous Extreme Events and Heavy Tails. https://doi.org/10.1088/1361-6544%2Faafbda

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