惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

L
LangChain Blog
V
V2EX
爱范儿
爱范儿
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
Martin Fowler
Martin Fowler
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Apple Machine Learning Research
Apple Machine Learning Research
WordPress大学
WordPress大学
有赞技术团队
有赞技术团队
宝玉的分享
宝玉的分享
Last Week in AI
Last Week in AI
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
罗磊的独立博客
小众软件
小众软件
Vercel News
Vercel News
博客园 - 司徒正美
阮一峰的网络日志
阮一峰的网络日志
V
Visual Studio Blog
J
Java Code Geeks
P
Proofpoint News Feed
MongoDB | Blog
MongoDB | Blog
B
Blog
美团技术团队
量子位

math.PR updates on arXiv.org

Visibility in the Boolean Model on Harmonic Manifolds Global estimates on the Brenier map Geodesics and Wandering Exponents in Brochette First-Passage Percolation State-dependent inverse-subordinator time changes of regenerative processes: Excursion structure and multiscale occupation-time limits Randomly twisted transfer operators and singular values statistics Generalized Bessel-Dunkl diffusions An almost sure invariance principle for the Takagi-van der Waerden class functions Central limit theorems for high dimensional lattice polytopes: cosmological polytopes Convergence rate estimates for semigroups and heat kernels associated with resistance forms Second-order Poincaré inequalities and localization on the Poisson space Maximum Probability of Independence in Transitive Matroids On global solutions to the semidiscrete stochastic heat equation The Poisson Tail Conjecture for primes in short intervals A Complete Spectral Analysis of the CEV Operator with Applications to Arbitrage Holographic functions and neural networks From Betting to Empirical Bernstein LIL Concentration of General Stochastic Approximation Under Heavy-Tailed Markovian Noise Pointwise Generalization in Deep Neural Networks Bayesian Latent Space Models for Graphs Are Misspecified: Toward Robust Inference via Generalized Posteriors Wasserstein bounds for denoising diffusion probabilistic models via the Föllmer process A note on connections between the Föllmer process and the denoising diffusion probabilistic model Simple Approximation and Derivative Free Inference-Time Scaling for Diffusion Models via Sequential Monte Carlo on Path Measures Diffusion-Based Stochastic Operator Networks for Uncertainty Quantification in Stochastic Partial Differential Equations A Fourier perspective on the learning dynamics of neural networks: from sample complexities to mechanistic insights Propagation of Chaos in Contextual Flow Maps Dimension-Uniform Discretization Analysis of Preconditioned Annealed Langevin Dynamics for Multimodal Gaussian Mixtures $α$-TCAV: A Unified Framework for Testing with Concept Activation Vectors Scaling Laws from Sequential Feature Recovery: A Solvable Hierarchical Model On the Limits of Latent Reuse in Diffusion Models State-of-art minibatches via novel DPP kernels: discretization, wavelets, and rough objectives
The Expiring Coupon Collector: Sliding-Window Surjection ...
Christopher D. Long · 2026-04-29 · via math.PR updates on arXiv.org

We study the coupon collector with deterministic expiration: one coupon is drawn at each time, and each coupon remains active for exactly $M$ draws. Completion occurs when all $n$ coupon types are simultaneously active. Equivalently, the current length-$M$ sliding window of draws must contain all $n$ types. The central object is not the one-time probability that a random window is onto, but the stationary flux of new entries into the onto-window set. We compute this flux exactly: \[ μ_{n,M} =\Pbb(W_{t-1}\text{ is not onto},\ W_t\text{ is onto}) =\frac{(n-1)(n-1)!S(M-1,n-1)}{n^M}, \] where $S(\cdot,\cdot)$ denotes a Stirling number of the second kind. Under a quantitative subcritical separation condition, satisfied in particular by every fixed integer scale $M=\floor{αn\log n}$, $0<α<1$, we prove local declumping and obtain \[ μ_{n,M}T_{n,M}\Rightarrow \Exp(1). \] For the fixed subcritical scale $M=\floor{αn\log n}$, $0<α<1$, this gives the logarithmic scale \[ \log T_{n,M}=n^{1-α}+o_{\mathbb P}(n^{1-α}), \qquad \log \Ebb T_{n,M}=n^{1-α}+o(n^{1-α}), \] and, when $α>1/2$, the sharper normalization \[ n^{-α}e^{-n^{1-α}}T_{n,M}\Rightarrow \Exp(1), \qquad \Ebb T_{n,M}\sim n^αe^{n^{1-α}}. \] Thus the leading scale proposed in the Math StackExchange discussion is made rigorous; the exact finite-$n$ flux gives the canonical normalization throughout the subcritical range. The result is a sliding-window companion to rare-void entry-flux methods for nonmonotone coupon collectors.