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

68 papers

math.PR2026

Symmetries of Random Partitions

Alexander Gnedin

This paper is motivated by a recent result of Pitman and Yakubovich stating that a partially exchangeable, stationary (PES) random partition of is exchangeable. This e…

math.PR2023★ 1 cited

Records in the Infinite Occupancy Scheme

Zakaria Derbazi, Alexander Gnedin, Alexander Marynych

We consider the classic infinite occupancy scheme, where balls are thrown in boxes independently, with probability of hitting box . Each time a box receives its first ball…

math.PR2022

Random Permutations and Queues

Alexander Gnedin, Dudley Stark

Given a growth rule which sequentially constructs random permutations of increasing degree, the stochastic process version of the rencontre problem asks what is the limiting propor…

math.PR2022

The Last-Success Stopping Problem with Random Observation Times

Alexander Gnedin, Zakaria Derbazi

Suppose independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strateg…

math.PR2021

Running minimum in the best-choice problem

Alexander Gnedin, Patryk Kozieł, Małgorzata Sulkowska

We consider the best-choice problem for independent (not necessarily iid) observations with the aim of selecting the sample minimum. We show that in this full ge…

math.PR2021

Trapping the Ultimate Success

Alexander Gnedin, Zakaria Derbazi

We introduce a betting game, where the gambler aims to guess the last success epoch from past observed data. The player may bet on the event that no further successes occur, or cho…