SearcharxivSearch

arXiv · 1702.00225

Coupled Continuous Time Random Maxima

Abstract

Continuous Time Random Maxima (CTRM) are a generalization of classical extreme value theory: Instead of observing random events at regular intervals in time, the waiting times between the events are also random variables with arbitrary distributions. In case that the waiting times between the events have infinite mean, the limit process that appears differs from the limit process that appears in the classical case. With a continuous mapping approach we derive a limit theorem for the case that the waiting times and the subsequent events are dependent and for the case that the waiting times dependent on the preceding events (in this case we speak of an Overshooting Continuous Time Random Maxima, abbr. OCTRM). We get the distribution functions of the limit processes and a formula for a Laplace transform for the CTRM and the OCTRM limit. With this formula we have another way to calculate the distribution functions of the limit processes, namely by inversion of the Laplace transform. Moreover we present governing equations, which are in our case time fractional differential equations whose solutions are the distribution functions of our limit processes. Because of the inverse relationship between the CTRM and its first hitting time we get also the Laplace transform of the distribution function of the first hitting time.

Explore related subjects

Keep this discovery

BibTeXRIS

Katharina Hees, Hans-Peter Scheffler. 2017-02-01. Coupled Continuous Time Random Maxima. https://arxiv.org/abs/1702.00225

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