SearcharxivSearch

arXiv · 2002.03849

Anatomy of an extreme event: What can we infer about the history of a heavy-tailed random walk?

Abstract

Extreme events are by nature rare and difficult to predict, yet are often much more important than frequent, typical events. An interesting counterpoint to the prediction of such events is their retrodiction -- given a process in an outlier state, how did the events leading up to this endpoint unfold? In particular, was there only a single, massive event, or was the history a composite of multiple, smaller but still significant events? To investigate this problem we take heavy-tailed stochastic processes (specifically,the symmetric, $\alpha$-stable L\'evy processes) as prototypical random walks. A natural and useful characteristic scale arises from the analysis of processes conditioned to arrive in a particular final state (L\'evy bridges). For final displacements longer than this scale, the scenario of a single, long jump is most likely, even though it corresponds to a rare, extreme event. On the other hand, for small final displacements, histories involving extreme events tend to be suppressed. To further illustrate the utility of this analysis, we show how it provides an intuitive framework for understanding three problems related to boundary crossings of heavy-tailed processes. These examples illustrate how intuition fails to carry over from diffusive processes, even very close to the Gaussian limit. One example yields a computationally and conceptually useful representation of L\'evy bridges that illustrates how conditioning impacts the extreme-event content of a random walk. The other examples involve the conditioned boundary-crossing problem and the ordinary first-escape problem; we discuss the observability of the latter example in experiments with laser-cooled atoms.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wesley W. Erickson, Daniel A. Steck. 2020-02-06. Anatomy of an extreme event: What can we infer about the history of a heavy-tailed random walk?. https://doi.org/10.1103/physreve.106.054142

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