SearcharxivSearch

arXiv · 2309.02664

On the novel geometric and negative binomial INAR(1) processes

Abstract

Guerrero et al. \cite{GBSO} propose a novel approach to building first-order integer-valued autoregressive (\inar1) models based on the concept of thinning. The standard approach requires that the thinning operator be defined first and \inar1 models with either a specified marginal (the forward approach) or a specified innovation (the backward approach) are developed. In contrast, the approach in \cite{GBSO} is to start out by specifying both the marginal distribution of the process and that of its innovation sequence, and then proceed to identify the thinning operator by solving a functional equation. In this article we discuss the connection between the thinning operators the authors obtained for their novel geometric and negative binomial \inar1 models and the thinning operator introduced in \cite{AB1} and \cite{AB2}. More specifically, we show that the existence of the two models has been established in \cite{AB1} using the forward approach and a different parameterization. In the process, we strenghthen some of the authors' results obtained for the novel geometric \inar1 process and we extend their results to the novel negative binomial \inar1 process.

Explore related subjects

Keep this discovery

BibTeXRIS

Nadjib Bouzar. 2023-09-06. On the novel geometric and negative binomial INAR(1) processes. https://arxiv.org/abs/2309.02664

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