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 2006Show all

7 papers · 1 filter

math.PR2006★ 1 cited

Coherent random permutations with record statistics

Alexander Gnedin

Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of . Our central example…

math.PR2006★ 22 cited

On the variance of the number of occupied boxes

L. V. Bogachev, A. V. Gnedin, Yu. V. Yakubovich

We consider the occupancy problem where balls are thrown independently at infinitely many boxes with fixed positive frequencies. It is well known that the random number of boxes oc…

math.PR2006★ 1 cited

Poisson representation of a Ewens fragmentation process

Alexander Gnedin, Jim Pitman

A simple explicit construction is provided of a partition-valued fragmentation process whose distribution on partitions of at time is governed by the Ewe…

math.PR2006★ 2 cited

Exchangeable partitions derived from Markovian coalescents

Rui Dong, Alexander Gnedin, Jim Pitman

Kingman derived the Ewens sampling formula for random partitions describing the genetic variation in a neutral mutation model defined by a Poisson process of mutations along lines…

math.PR2006★ 1 cited

The boundary of the Eulerian number triangle

Alexander Gnedin, Grigori Olshanski

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solution…

math.PR2006★ 1 cited

Recognising the Last Record of a Sequence

Alexander Gnedin

We study the best-choice problem for processes which generalise the process of records from Poisson-paced i.i.d. observations. Under the assumption that the observer knows distribu…