SearcharxivSearch

arXiv · 0801.4725

The Bernoulli sieve revisited

Abstract

We consider an occupancy scheme in which "balls" are identified with $n$ points sampled from the standard exponential distribution, while the role of "boxes" is played by the spacings induced by an independent random walk with positive and nonlattice steps. We discuss the asymptotic behavior of five quantities: the index $K_n^*$ of the last occupied box, the number $K_n$ of occupied boxes, the number $K_{n,0}$ of empty boxes whose index is at most $K_n^*$, the index $W_n$ of the first empty box and the number of balls $Z_n$ in the last occupied box. It is shown that the limiting distribution of properly scaled and centered $K_n^*$ coincides with that of the number of renewals not exceeding $\log n$. A similar result is shown for $K_n$ and $W_n$ under a side condition that prevents occurrence of very small boxes. The condition also ensures that $K_{n,0}$ converges in distribution. Limiting results for $Z_n$ are established under an assumption of regular variation.

Explore related subjects

Keep this discovery

BibTeXRIS

Alexander V. Gnedin, Alexander M. Iksanov, Pavlo Negadajlov, Uwe Rösler. 2009-09-01. The Bernoulli sieve revisited. https://doi.org/10.1214/08-aap592

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