Limit Profile for the Bernoulli--Laplace Urn
read the original abstract
We analyse the convergence to equilibrium of the Bernoulli--Laplace urn model: initially, one urn contains $k$ red balls and a second $n-k$ blue balls; in each step, a pair of balls is chosen uniform and their locations are switched. Cutoff is known to occur at $\tfrac12 n \log \min\{k, \sqrt n\}$ with window order $n$ whenever $1 \ll k \le \tfrac12 n$. We refine this by determining the limit profile: a function $\Phi$ such that \[ d_\mathsf{TV}\bigl( \tfrac12 n \log \min\{k, \sqrt n\} + \theta n \bigr) \to \Phi(\theta) \quad\text{as}\quad n \to \infty \quad\text{for all}\quad \theta \in \mathbb R. \] Our main technical contribution, of independent interest, approximates a rescaled chain by a diffusion on $\mathbb R$ when $k \gg \sqrt n$, and uses its explicit law as a Gaussian process.
This paper has not been read by Pith yet.
Forward citations
Cited by 2 Pith papers
-
The Cutoff Profile for Random Transpositions on Repeated Cards in the Full Range of Parameters
The cutoff profile for random transpositions on repeated cards is asymptotically Gaussian for growing multiplicity l, with explicit forms depending on whether the number of types m is fixed or grows.
-
Limit Profiles for Separation Distance
The authors determine separation distance limit profiles for two card shuffles and develop a spectral comparison technique illustrated on product groups and the hypercube.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.