Search arXivSearch

arXiv · 2605.14511

Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors

Abstract

We study three nonmonotone coupon-collector models through a stationary-entry viewpoint. In such models the all-present state is not absorbing, so completion is governed not by the disappearance of a monotone terminal cloud but by rare new entries into a target state, except in the reset-button model, where exact regeneration gives a separate reduction. We prove a finite stationary-entry theorem: a mixing estimate, a one-block clump-control estimate, and the stationary entry flux imply an exponential hitting law. For the reset-button collector, regeneration gives an exact probability-generating function in terms of the ordinary coupon-collector transform and recovers the known beta-function expectation, while also yielding rare-success exponential limits and negligible-reset Gumbel limits. For the clumsy collector with fixed loss probability $p$ and $q=1-p$, the stationary-entry flux is $p q^n$, and $p q^n T_n$ converges to $\operatorname{Exp}(1)$. Thus the fixed-loss standardized limit is exponential rather than Gumbel. For the post-loss careless collector, we compute the sharp stationary-entry flux $$ μ_n\sim (q;q)_\infty^{-1}\frac{n!}{n^n}q^{n(n+1)/2} $$ and prove $μ_nT_n\Rightarrow\operatorname{Exp}(1)$, with matching moment asymptotics. This shows that the careless scale is governed by a stationary high tail, or ordered lucky climb, rather than by the independent one-point marginal heuristic. We also analyze a combined clumsy-careless model, confirming stability of the high-tail entry mechanism.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Christopher D. Long. 2026-05-14. Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors. https://arxiv.org/abs/2605.14511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

The extremal process of a cascading family of branching Brownian motion

We study the asymptotic behaviour of the extremal process of a cascading family of branching Brownian motions. This is a particle system on the real line such that each particle has a type in addition to his position. Particles of type $1$ move on the real line according to Brownian motions and branch at rate $1$ into two children of type $1$. Furthermore, at rate $α$, they give birth to children too of type $2$. Particles of type $2$ move according to standard Brownian motion and branch at rate $1$, but cannot give birth to descendants of type $1$. We obtain the asymptotic behaviour of the extremal process of particles of type $2$.

math.PR

Breuer-Major Theorems for Hilbert Space-Valued Random Variables

Let $\{X_k\}_{k\in\mathbb Z}$ be a stationary Gaussian process with values in a separable Hilbert space $\mathcal H_1$, and let $G:\mathcal H_1\to\mathcal H_2$ be a measurable map into another separable Hilbert space $\mathcal H_2$. We derive a central limit theorem for the centered normalized partial sums of the Hilbert space-valued subordinated process $\{G[X_k]\}_{k\in\mathbb Z}$. Our result holds under either of two sets of sufficient conditions, formulated in terms of the transformation $G$ and the temporal and cross-sectional dependence structure of $\{X_k\}_{k\in\mathbb Z}$. These conditions coincide in finite dimensions but lead to genuinely different phenomena in the infinite-dimensional setting. The proof relies on the recently developed Fourth Moment Theorem on Hilbert spaces, leveraging tools from the infinite-dimensional Malliavin-Stein framework. We also provide continuous-time and quantitative versions of the central limit theorem. In a series of examples, we recover and strengthen limit theorems for a wide array of statistics relevant in functional data analysis, and present, as an application of our result, a novel limit theorem in the framework of neural operators.

math.PR

Controlled rough SDEs, pathwise stochastic control and dynamic programming principles

We study stochastic optimal control of rough stochastic differential equations (RSDEs). This is in the spirit of the pathwise control problem (Lions--Souganidis 1998, Buckdahn--Ma 2007; also Davis--Burstein 1992), with renewed interest and recent works drawing motivation from filtering, SPDEs, and reinforcement learning. Results include regularity of rough value functions, validity of a rough dynamic programming principles and new rough stability results for HJB equations, removing excessive regularity demands previously imposed by flow transformation methods. Measurable selection is used to relate RSDEs to "doubly stochastic" SDEs under conditioning. In contrast to previous works, Brownian statistics for the to-be-conditioned-on noise are not required, aligned with the "pathwise" intuition that these should not matter upon conditioning. Depending on the chosen class of admissible controls, the involved processes may also be anticipating. The resulting stochastic value functions coincide in great generality for different classes of controls. RSDE theory offers a powerful and unified perspective on this problem class.

math.PR