Related papers: Three Distributions in the Extended Occupancy Prob…
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…
The paper works out the canonical probability distribution of the occupancy numbers of a bosonic system and shows that canonical typicality applies to the canonical density operator of the occupancy numbers. The result is that, if, as it is…
This paper examines the classical matching distribution arising in the "problem of coincidences". We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed…
The occupation time of an age-dependent branching particle system in $\Rd$ is considered, where the initial population is a Poisson random field and the particles are subject to symmetric $\alpha$-stable migration, critical binary branching…
We consider the problem of allocating a distribution of items to $n$ recipients where each recipient has to be allocated a fixed, prespecified fraction of all items, while ensuring that each recipient does not experience too much envy. We…
Consider $ m $ copies of an irreducible, aperiodic Markov chain $ Y $ taking values in a finite state space. The asymptotics as $ m $ tends to infinity, of the first time from which on the trajectories of the $ m $ copies differ, have been…
We consider the unbalanced allocation of $m$ balls into $n$ bins by a randomized algorithm using the "power of two choices". For each ball, we select a set of bins at random, then place the ball in the fullest bin within the set.…
An open problem of interest, first infused into the applied probability community in the work of Bingham and Doney in 1988, (see \cite{Bingham}) is stated as follows: find the distribution of the quadrant occupation time of planar Brownian…
The method of occupation kernels has been used to learn ordinary differential equations from data in a non-parametric way. We propose a two-step method for learning the drift and diffusion of a stochastic differential equation given…
Optimal Transport (OT) is a resource allocation problem with applications in biology, data science, economics and statistics, among others. In some of the applications, practitioners have access to samples which approximate the continuous…
Consider a critical nearest neighbor branching random walk on the $d$-dimensional integer lattice initiated by a single particle at the origin. Let $G_{n}$ be the event that the branching random walk survives to generation $n$. We obtain…
For the one-dimensional telegraph process, we obtain explicit distribution of the occupation time of the positive half-line. The long-term limiting distribution is then derived when the initial location of the process is in the range of…
A classical problem for Markov chains is determining their stationary (or steady-state) distribution. This problem has an equally classical solution based on eigenvectors and linear equation systems. However, this approach does not scale to…
We formalize an allocation model under ordinal preferences that is more general than the well-studied Shapley-Scarf housing market. In our model, the agents do not just care which house or resource they get but also care about who gets…
We present a systematic study of the statistics of the occupation time and related random variables for stochastic processes with independent intervals of time. According to the nature of the distribution of time intervals, the probability…
A special type of binomial splitting process is studied. Such a process can be used to model a high-dimensional corner parking problem, as well as the depth of random PATRICIA tries (a special class of digital tree data structures). The…
We show that the Sibuya distribution and its non-critical relatives are relevant in the context of the recursive generation of both simply generated and increasing critical trees' and forests' progenies. A special class of generalized…
A nested occupancy scheme in random environment is a generalization of the classical Karlin infinite balls-in-boxes occupancy scheme in random environment (with random probabilities). Unlike the Karlin scheme in which the collection of…
Scrambling is a key concept in the analysis of nonequilibrium properties of quantum many-body systems. Most studies focus on its characterization via out-of-time-ordered correlation functions (OTOCs), particularly through the early-time…
We consider an occupancy scheme in which "balls" are identified with $n$ points sampled from the standard exponential distribution, while the role of "boxes" is played by the spacings induced by an independent random walk with positive and…