English
Related papers

Related papers: The Bernoulli sieve revisited

200 papers

We consider a particle moving in a one dimensional potential which has a symmetric deterministic part and a quenched random part. We study analytically the probability distributions of the local time (spent by the particle around its mean…

Statistical Mechanics · Physics 2009-11-07 Satya N. Majumdar , Alain Comtet

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 studies Barbour and Gnedin (2006), Gnedin, Iksanov and…

Probability · Mathematics 2012-09-04 Alexander Gnedin , Alexander Iksanov

For a probability distribution $P$ on an at most countable alphabet $\mathcal A$, this article gives finite sample bounds for the expected occupancy counts $\mathbb E K_{n,r}$ and probabilities $\mathbb E M_{n,r}$. Both upper and lower…

Statistics Theory · Mathematics 2016-11-17 Geoffrey Decrouez , Michael Grabchak , Quentin Paris

In this paper, we are interested in the asymptotic behaviour of the sequence of processes $(W_n(s,t))_{s,t\in[0,1]}$ with \begin{equation*} W_n(s,t):=\sum_{k=1}^{\lfloor nt\rfloor}\big(1_{\{\xi_{S_k}\leq s\}}-s\big) \end{equation*} where…

Probability · Mathematics 2019-12-17 Nadine Guillotin-Plantard , Francoise Pene , Martin Wendler

Consider a string of $n$ positions, i.e. a discrete string of length $n$. Units of length $k$ are placed at random on this string in such a way that they do not overlap, and as often as possible, i.e. until all spacings between neighboring…

Probability · Mathematics 2007-05-23 Chris A. J. Klaassen , J. Theo Runnenburg

Balls are sequentially allocated into $n$ bins as follows: for each ball, an independent, uniformly random bin is generated. An overseer may then choose to either allocate the ball to this bin, or else the ball is allocated to a new…

Probability · Mathematics 2018-07-04 Ohad N. Feldheim , Ori Gurel-Gurevich

A tournament on a graph is an orientation of its edges. The score sequence lists the in-degrees in non-decreasing order. Works by Winston and Kleitman (1983) and Kim and Pittel (2000) showed that the number $S_n$ of score sequences on the…

Combinatorics · Mathematics 2025-11-18 Brett Kolesnik

Local perturbations in conservative particle systems can have a non-local influence on the stationary measure. To capture this phenomenon, we analyze in this paper two toy models. We study the symmetric exclusion process on a countable set…

Probability · Mathematics 2024-10-25 Frank Redig , Ellen Saada

In the standard formulation of the occupancy problem one considers the distribution of r balls in n cells, with each ball assigned independently to a given cell with probability 1/n. Although closed form expressions can be given for the…

Probability · Mathematics 2007-05-23 Paul Dupuis , Carl Nuzman , Phil Whiting

We consider the occupation area of spherical (fractional) Brownian motion, i.e. the area where the process is positive, and show that it is uniformly distributed. For the proof, we introduce a new simple combinatorial view on occupation…

Probability · Mathematics 2024-06-17 Frank Aurzada , Leif Döring , Helmut H. Pitters

We analyse the asymptotic behaviour of the probability of observing the expected number of successes at each stage of a sequence of nested Bernoulli trials. Our motivation is the attempt to give a genuinely frequentist interpretation to the…

Probability · Mathematics 2015-05-19 Eckhard Schlemm

Suppose $N$ independent Bernoulli trials are observed sequentially at random times of a mixed binomial process. The task is to maximise, by using a nonanticipating stopping strategy, the probability of stopping at the last success. We focus…

Probability · Mathematics 2024-10-22 Alexander Gnedin , Zakaria Derbazi

We study the asymptotic behavior of two statistics defined on the symmetric group S_n when n tends to infinity: the number of elements of S_n having k records, and the number of elements of S_n for which the sum of the positions of their…

Combinatorics · Mathematics 2014-11-14 Igor Kortchemski

In the Karlin infinite occupancy scheme, balls are thrown independently into an infinite array of boxes $1$, $2,\ldots$, with probability $p_k$ of hitting the box $k$. For $j,n\in\mathbb{N}$, denote by $\mathcal{K}^*_j(n)$ the number of…

Probability · Mathematics 2023-11-21 Alexander Iksanov , Valeriya Kotelnikova

Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…

History and Overview · Mathematics 2018-08-27 Steven R. Finch

We study a resource allocation setting where $m$ discrete items are to be divided among $n$ agents with additive utilities, and the agents' utilities for individual items are drawn at random from a probability distribution. Since common…

Computer Science and Game Theory · Computer Science 2023-03-20 Pasin Manurangsi , Warut Suksompong

We investigate the spectrum for partial sums of m position (or gaussian) operators on monotone Fock space based on $\ell^2(\mathbb{N})$. In the basic case of the first consecutive operators, we prove it coincides with the support of the…

Operator Algebras · Mathematics 2018-12-21 Vitonofrio Crismale , Yun Gang Lu

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

Probability · Mathematics 2018-06-05 Vadim Gorin , Leonid Petrov

Estimating the number $n$ of unseen species from a $k-$sample displaying only $p\leq k$ distinct sampled species has received attention for long. It requires a model of species abundance together with a sampling model. We start with a…

Methodology · Statistics 2015-06-16 Thierry Huillet , Servet Martinez

Let i.i.d. symmetric Bernoulli random variables be associated to the edges of a binary tree having n levels. To any leaf of the tree, we associate the sum of variables along the path connecting the leaf with the tree root. Let M_n denote…

Probability · Mathematics 2015-02-24 M. A. Lifshits