activity
20022026
most citedNotes on the occupancy problem with infinitely many boxes: general asymptotics and power laws

115 citations · 388 across the 61 of their papers we have counts for

collaborators
Showing 2011 · math.PRShow all

5 papers · 2 filters

math.PR2011

Regenerative compositions in the case of slow variation: A renewal theory approach

Alexander Gnedin, Alexander Iksanov

A regenerative composition structure is a sequence of ordered partitions derived from the range of a subordinator by a natural sampling procedure. In this paper, we extend previous…

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

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

The two-sided infinite extension of the Mallows model for random permutations

Alexander Gnedin, Grigori Olshanski

We introduce a probability distribution Q on the group of permutations of the set Z of integers. Distribution Q is a natural extension of the Mallows distribution on the finite sym…

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…