SearcharxivSearch

arXiv · 2010.02689

On the Exact Distributions of the Maximum of the Asymmetric Telegraph Process

Abstract

In this paper we present the distribution of the maximum of the asymmetric telegraph process in an arbitrary time interval $[0,t]$ under the conditions that the initial velocity $V(0)$ is either $c_1$ or $-c_2$ and the number of changes of direction is odd or even. For the case $V(0) = -c_2$ the singular component of the distribution of the maximum displays an unexpected cyclic behavior and depends only on $c_1$ and $c_2$, but not on the current time $t$. We obtain also the unconditional distribution of the maximum for either $V(0) = c_1$ or $V(0) = -c_2$ and its expression has the form of series of Bessel functions. We also show that all the conditional distributions emerging in this analysis are governed by generalized Euler-Poisson-Darboux equations. We recover all the distributions of the maximum of the symmetric telegraph process as particular cases of the present paper. We underline that it rarely happens to obtain explicitly the distribution of the maximum of a process. For this reason the results on the range of oscillations of a natural process like the telegraph model make it useful for many applications.

Explore related subjects

Keep this discovery

BibTeXRIS

Fabrizio Cinque, Enzo Orsingher. 2020-10-06. On the Exact Distributions of the Maximum of the Asymmetric Telegraph Process. https://arxiv.org/abs/2010.02689

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