activity
20052026
most citedLimit theorems for the number of occupied boxes in the Bernoulli sieve

24 citations · 195 across the 74 of their papers we have counts for

collaborators
Showing 2011 · math.PRShow all

6 papers · 2 filters

math.PR2011★ 1 cited

Power and exponential moments of the number of visits and related quantities for perturbed random walks

Gerold Alsmeyer, Alexander Iksanov, Matthias Meiners

Let be a sequence of i.i.d.\ copies of a random vector taking values in , and let . The sequence $(S_{n-1} + η_n)_{n \ge…

math.PR2011

On the number of empty boxes in the Bernoulli sieve II

Alexander Iksanov

The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies , where $(W_k)_{k\in\mn}$ are independent copies of a rando…

math.PR2011★ 8 cited

Moments of random sums and Robbins' problem of optimal stopping

Alexander Gnedin, Alexander Iksanov

Robbins' problem of optimal stopping asks one to minimise the expected {\it rank} of observation chosen by some nonanticipating stopping rule. We settle a conjecture regarding the…

math.PR2011★ 1 cited

On the number of empty boxes in the Bernoulli sieve

Alexander Iksanov

The Bernoulli sieve is the infinite "balls-in-boxes" occupancy scheme with random frequencies , where $(W_k)_{k\in\mn}$ are independent copies of a random…

math.PR2011

A generalization of the Erdős-Turán law for the order of random permutation

Alexander Gnedin, Alexander Iksanov, Alexander Marynych

We consider random permutations derived by sampling from stick-breaking partitions of the unit interval. The cycle structure of such a permutation can be associated with the path o…

math.PR2011★ 2 cited

Lambda-coalescents with dust component

Alexander Gnedin, Alexander Iksanov, Alexander Marynych

We consider the lambda-coalescent processes with positive frequency of singleton clusters. The class in focus covers, for instance, the beta-coalescents with . We show…