SearcharxivSearch

arXiv · 0901.2445

Poisson process approximation for dependent superposition of point processes

Abstract

Although the study of weak convergence of superpositions of point processes to the Poisson process dates back to the work of Grigelionis in 1963, it was only recently that Schuhmacher [Stochastic Process. Appl. 115 (2005) 1819--1837] obtained error bounds for the weak convergence. Schuhmacher considered dependent superposition, truncated the individual point processes to 0--1 point processes and then applied Stein's method to the latter. In this paper, we adopt a different approach to the problem by using Palm theory and Stein's method, thereby expressing the error bounds in terms of the mean measures of the individual point processes, which is not possible with Schuhmacher's approach. We consider locally dependent superposition as a generalization of the locally dependent point process introduced in Chen and Xia [Ann. Probab. 32 (2004) 2545--2569] and apply the main theorem to the superposition of thinned point processes and of renewal processes.

Explore related subjects

Keep this discovery

BibTeXRIS

Louis H. Y. Chen, Aihua Xia. 2011-05-09. Poisson process approximation for dependent superposition of point processes. https://doi.org/10.3150/10-bej290

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