SearcharxivSearch

arXiv · 2608.23301

On a Telegraph Process with Generalized Mittag-Leffler Waiting times and Velocity Driven by Random trials

Abstract

We study a generalized telegraph process in which the velocity is governed by random trials by considering the specific distribution of waiting times. In this telegraph process, a particle moving on real line may change its direction whenever there is an arrival in a counting process. This direction change is driven by the outcomes of random trials. In the first case, random trials are independent and identically distributed, and waiting times have Mittag-Leffler distribution. In the second case, random trials follow P\'olya urn scheme and the first waiting time is generalized Mittag-Leffler distributed whereas other waiting times have Mittag-Leffler distribution. In both cases, we obtain the discrete component of their probability law. Also, absolutely continuous components of their conditional probability law given initial velocity are derived. The plots of absolutely continuous components of their probability law are compared for different parameters. Conditional on the initial velocity, the distributions of $n$th event time of counting processes associated with these telegraph processes are obtained.

Explore related subjects

Keep this discovery

BibTeXRIS

Rohini Bhagwanrao Pote, Kuldeep Kumar Kataria. 2026-08-24. On a Telegraph Process with Generalized Mittag-Leffler Waiting times and Velocity Driven by Random trials. https://arxiv.org/abs/2608.23301

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