SearcharxivSearch

arXiv · 1503.06486

A fractional counting process and its connection with the Poisson process

Abstract

We consider a fractional counting process with jumps of amplitude $1,2,\ldots,k$, with $k\in \mathbb{N}$, whose probabilities satisfy a suitable system of fractional difference-differential equations. We obtain the moment generating function and the probability law of the resulting process in terms of generalized Mittag-Leffler functions. We also discuss two equivalent representations both in terms of a compound fractional Poisson process and of a subordinator governed by a suitable fractional Cauchy problem. The first occurrence time of a jump of fixed amplitude is proved to have the same distribution as the waiting time of the first event of a classical fractional Poisson process, this extending a well-known property of the Poisson process. When $k=2$ we also express the distribution of the first passage time of the fractional counting process in an integral form. Finally, we show that the ratios given by the powers of the fractional Poisson process and of the counting process over their means tend to 1 in probability.

Explore related subjects

Keep this discovery

BibTeXRIS

Antonio Di Crescenzo, Barbara Martinucci, Alessandra Meoli. 2015-03-22. A fractional counting process and its connection with the Poisson process. https://arxiv.org/abs/1503.06486

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