SearcharxivSearch

arXiv · 1902.00576

Fluctuations of extremal Markov chains driven by the Kendall convolution

Abstract

The paper deals with fluctuations of Kendall random walks, which are extremal Markov chains and iterated integral transforms with the Williamson kernel $Ψ(t) = \left(1-|t|^α\right)_+$, $α>0$. We obtain the joint distribution of the first ascending ladder epoch and height over any level $a \geq 0$ and distribution of maximum and minimum for these extremal Markovian sequences solving recursive integral equations. We show that distribution of the first crossing time of level $a \geq0$ is a mixture of geometric and negative binomial distributions. The Williamson transform is the main tool for considered problems connected with the Kendall convolution. All results are described by the Williamson transform of the unit step distribution of Kendall random walks. Using regular variation, we investigate the asymptotic properties of the maximum distribution.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Barbara Jasiulis-Gołdyn, Edward Omey, Mateusz Staniak. 2022-05-17. Fluctuations of extremal Markov chains driven by the Kendall convolution. https://arxiv.org/abs/1902.00576

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