Related papers: Records in the Infinite Occupancy Scheme
We study first passage statistics of the Polya urn model. In this random process, the urn contains two types of balls. In each step, one ball is drawn randomly from the urn, and subsequently placed back into the urn together with an…
Particles labelled $1,...,n$ are initially arranged in increasing order. Subsequently, each pair of neighboring particles that is currently in increasing order swaps according to a Poisson process of rate 1. We analyze the asymptotic…
Many physical observables can be represented as a particle spending some random time within a given domain. For a broad class of transport-dominated processes, we detail how it is possible to express the moments of the number of particle…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in…
We establish the general equivalence between rare event process for arbitrary continuous functions whose maximal values are achieved on non-trivial sets, and the entry times distribution for arbitrary measure zero sets. We then use it to…
We study a generalized P\'{o}lya urn model with two types of ball. If the drawn ball is red, it is replaced together with a black ball, but if the drawn ball is black it is replaced and a red ball is thrown out of the urn. When only black…
We show that for systems that allow a Young tower construction with polynomially decaying correlations the return times to metric balls are in the limit Poisson distributed. We also provide error terms which are powers of logarithm of the…
We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…
We consider the persistent exclusion process in which a set of persistent random walkers interact via hard-core exclusion on a hypercubic lattice in $d$ dimensions. We work within the ballistic regime whereby particles continue to hop in…
We prove a law of large numbers in terms of complete convergence of independent random variables taking values in increments of monotone functions, with convergence uniform both in the initial and the final time. The result holds also for…
Consider the random set system of {1,2,...,n}, where each subset in the power set is chosen independently with probability p. A set H is said to be a hitting set if it intersects each chosen set. The second moment method is used to exhibit…
We propose a novel mixture model for football event data that clusters entire possessions to reveal their temporal, sequential, and spatial structure. Each mixture component models possessions as marked spatio-temporal point processes:…
This paper is composed of two main results concerning chains of infinite order which are not necessarily continuous. The first one is a decomposition of the transition probability kernel as a countable mixture of unbounded probabilistic…
It is a common impression that by only setting the maximum occupation number to infinity, which is the demand of the indistinguishability of bosons, one can achieve the statistical distribution that bosons obey -- the Bose-Einstein…
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…
We consider the Poisson Boolean percolation model in $\mathbb{R}^2$, where the radii of each ball is independently chosen according to some probability measure with finite second moment. For this model, we show that the two thresholds, for…
We consider the allocation of $m$ balls (jobs) into $n$ bins (servers). In the standard Two-Choice process, at each step $t=1,2,\ldots,m$ we first sample two bins uniformly at random and place a ball in the least loaded bin. It is…
Let $(X_t)_{t \geq 0}$ be a continuous time Markov process on some metric space $M,$ leaving invariant a closed subset $M_0 \subset M,$ called the {\em extinction set}. We give general conditions ensuring either "Stochastic persistence"…