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

推荐订阅源

F
Fortinet All Blogs
Recent Announcements
Recent Announcements
H
Help Net Security
Y
Y Combinator Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
有赞技术团队
有赞技术团队
小众软件
小众软件
Last Week in AI
Last Week in AI
U
Unit 42
Google DeepMind News
Google DeepMind News
博客园 - 司徒正美
H
Hackread – Cybersecurity News, Data Breaches, AI and More
J
Java Code Geeks
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
N
Netflix TechBlog - Medium
Blog — PlanetScale
Blog — PlanetScale
云风的 BLOG
云风的 BLOG
V
V2EX
博客园 - 聂微东
人人都是产品经理
人人都是产品经理
博客园 - 三生石上(FineUI控件)
阮一峰的网络日志
阮一峰的网络日志
爱范儿
爱范儿

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
Limit Theory of the Multi-set Allocation Occupancy (MAO) ...
Xing-gang Mao · 2026-02-22 · via math.PR updates on arXiv.org

This paper investigates the asymptotic behavior of the Multi-set Allocation Occupancy (MAO) distribution, which models the count vector $X=(X_{=0},\ldots,X_{=T})$ from $T$ independent rounds of sampling without replacement of size $m$ from $N$ individuals. Focusing on $X_{=t}$ (individuals in exactly $t$ subsets) and employing the MAO norm -- a combinatorial tool yielding closed-form factorial moments -- we derive the exact marginal distribution of a single individual as $\mathrm{Bin}(T,p)$ with $p=m/N$. Using the MAO norm, we prove that for any fixed number of distinct individuals, their joint distribution differs from the product of marginals by $O(1/N)$, establishing the weak dependence required for limit theorems. Based on these findings, we delineate two asymptotic regimes: 1. Normal approximation: When $N\to\infty$ with $p=m/N$ fixed, $X_{=t}$ obeys a central limit theorem and can be approximated by a normal distribution with mean $Nπ_t$ and variance obtained from the MAO norm, where $π_t = \binom{T}{t} p^t (1-p)^{T-t}$.2. Poisson approximation: When the expected value $λ_N := Nπ_t \to 0$, $X_{=t}$ converges in distribution to $\mathrm{Poisson}(λ)$. By symmetry, if $λ_N \to N$, then $N-X_{=t}$ converges to a Poisson distribution. All theoretical results are rigorously proved via moment methods and are corroborated by extensive numerical simulations, which further demonstrate that the approximations remain valid even when the subset sizes are not equal. The MAO norm thus emerges as a unifying tool that connects the exact combinatorial structure of the model to its asymptotic theory. These findings offer clear guidance for choosing the appropriate approximation in practical applications, and they open the door to using the MAO distribution as a null model for detecting non random aggregation in fields as diverse as ecology, sociology, and statistical physics.