SearcharxivSearch

arXiv · 1007.0283

On probabilities associated with the minimum distance between events of a Poisson process in a finite interval, and Erratum/Addendum to it

Abstract

Original paper: We revisit the probability that any two consecutive events in a Poisson process N on [0,t] are separated by a time interval which is greater than s(<t) (a particular scan statistic probability), and the closely related probability (recently introduced by Todinov [8], who denotes it as p_MFFOP) that before any event of N in [0,t] there exists an event-free interval greater than s. Both probabilities admit simple explicit expressions, which, however, become intractable for very large values of t/s. Our main objective is to demonstrate that these probabilities can be approximated extremely well for large values of t/s by some very tractable and attractive expressions (actually, already for t larger than a few multiples of s). Erratum/Addendum: In this addendum, we further discuss numerical issues concerning the computation of the probability denoted ϕ(s,t;λ) in the original paper. In particular, and most importantly, we correct the naive claim made in the abstract of the original paper that the explicit expression of ϕ(s,t;λ) becomes intractable for very large values of t/s; rather, we show that it may not be applicable for large values of λ*t.

Explore related subjects

Keep this discovery

BibTeXRIS

Shai Covo. 2010-07-02. On probabilities associated with the minimum distance between events of a Poisson process in a finite interval, and Erratum/Addendum to it. https://arxiv.org/abs/1007.0283

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