Related papers: Small counts in nested Karlin's occupancy scheme g…
Quantum generative modeling, where the Born rule naturally defines probability distributions through measurement of parameterized quantum states, is a promising near-term application of quantum computing. We propose a Quantum Scrambling…
Let $(Z_n,n\geq 0)$ be a supercritical Galton-Watson process whose offspring distribution $\mu$ has mean $\lambda>1$ and is such that $\int x(\log(x))_+ d\mu(x)<+\infty$. According to the famous Kesten \& Stigum theorem, $(Z_n/\lambda^n)$…
Let $(\xi_k,\eta_k)_{k\in\mathbb{N}}$ be independent identically distributed random vectors with arbitrarily dependent positive components. We call a (globally) perturbed random walk a random sequence $T:=(T_k)_{k\in\mathbb{N}}$ defined by…
Starting from a master equation, we derive the evolution equation for the size distribution of elements in an evolving system, where each element can grow, divide into two, and produce new elements. We then probe general solutions of the…
Consider a general branching process, a.k.a. Crump-Mode-Jagers process, generated by a perturbed random walk $\eta_1$, $\xi_1+\eta_2$, $\xi_1+\xi_2+\eta_3,\ldots$. Here, $(\xi_1,\eta_1)$, $(\xi_2, \eta_2),\ldots$ are independent identically…
We propose a proof of concept for a variational distributional neuron: a compute unit formulated as a VAE brick, explicitly carrying a prior, an amortized posterior and a local ELBO. The unit is no longer a deterministic scalar but a…
In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$.…
It is well-known that, on a purely algebraic level, a simplified algebraic version of the Central Limit Theorem (CLT) can be proved in the framework of a noncommutative probability space, under the hypotheses that the sequence of…
The Central Limit Theorem (CLT) establishes that sufficiently large sequences of independent and identically distributed random variables converge in probability to a normal distribution. This makes the CLT a fundamental building block of…
Estimating a fractal dimension from a finite stochastic trajectory is a finite-size scaling problem: the apparent box-counting exponent is shaped by an occupancy crossover between the resolved range of scales and the finite number of…
We prove a new CLT for the difference of linear eigenvalue statistics of a Wigner random matrix $H$ and its minor $\hat H$ and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a…
We study occupancy counts for the critical nearest-neighbor branching random walk on the $d$-dimensional lattice, conditioned on non-extinction. For $d\geq 3$, Lalley and Zheng (2011) showed that the properly scaled joint distribution of…
Discriminating between distributions is an important problem in a number of scientific fields. This motivated the introduction of Linear Optimal Transportation (LOT), which embeds the space of distributions into an $L^2$-space. The…
In this paper, we prove functional limit theorems for P\'olya urn processes whose number of draws and initial number of balls tend to infinity together. This is motivated by recent work of Borovkov [5], where they prove a functional limit…
In this paper we show the distributions of sliding block patterns for Bernoulli processes with finite alphabet, which is not based on the induction on sample size. We show a new inclusion-exclusion formula in multivariate generating…
We prove joint functional limit theorems in the Skorokhod space equipped with the $J_1$-topology for successive Lebesgue-Stieltjes convolutions of nondecreasing stochastic processes with themselves. These convolutions arise naturally in…
We establish general sufficient conditions for a sequence of controlled branching processes to converge weakly on the Skorokhod space. We focus on a class of controlled random variables that extends previous results by considering them as a…
A controlled branching process (CBP) is a modification of the standard Bienaym\'e-Galton-Watson process in which the number of progenitors in each generation is determined by a random mechanism. We consider a CBP starting from a random…
The classical and extended occupancy distributions are useful for examining the number of occupied bins in problems involving random allocation of balls to bins. We examine the extended occupancy problem by framing it as a Markov chain and…
We investigate the randomized Karlin model with parameter $\beta\in(0,1)$, which is based on an infinite urn scheme. It has been shown before that when the randomization is bounded, the so-called odd-occupancy process scales to a fractional…