SearcharxivSearch

arXiv · 2203.16737

The Bell-Touchard Counting process

Abstract

The Poisson process is one of the simplest stochastic processes defined in continuous time, having interesting mathematical properties, leading, in many situations, to applications mathematically treatable. One of the limitations of the Poisson process is the rare events hypothesis; which is the hypothesis of unitary jumps within an infinitesimal window of time. Although that restriction may be avoided by the compound Poisson process, in most situations, we don't have a closed expression for the probability distribution of the increments of such processes, leaving us options such as working with probability generating functions, numerical analysis and simulations. It is with this motivation in mind, inspired by the recent developments of discrete distributions, that we propose a new counting process based on the Bell-Touchard probability distribution, naming it the Bell-Touchard process. We verify that the process is a compound Poisson process, a multiple Poisson process and that it is closed for convolution plus decomposition operations. Besides, we show that the Bell-Touchard process arises naturally from the composition of two Poisson processes. Moreover, we propose two generalizations; namely, the compound Bell-Touchard process and the non-homogeneous Bell-Touchard process, showing that the last one arises from the composition of a non-homogeneous Poisson process along with a homogeneous Poisson process. We emphasize that since previous works have been shown that the Bell-Touchard probability distribution can be used quite effectively for modelling count data, the Bell-Touchard process and its generalizations may contribute to the formulation of mathematical treatable models where the rare events hypothesis is not suitable.

Explore related subjects

Keep this discovery

BibTeXRIS

Thomas Freud, Pablo M. Rodriguez. 2022-03-31. The Bell-Touchard Counting process. https://arxiv.org/abs/2203.16737

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