SearcharxivSearch

arXiv · 2602.19011

Limit Theory of the Multi-set Allocation Occupancy (MAO) Distribution: Normal and Poisson Approximations via MAO Norm

Abstract

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\pi_t$ and variance obtained from the MAO norm, where $\pi_t = \binom{T}{t} p^t (1-p)^{T-t}$.2. Poisson approximation: When the expected value $\lambda_N := N\pi_t \to 0$, $X_{=t}$ converges in distribution to $\mathrm{Poisson}(\lambda)$. By symmetry, if $\lambda_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.

Explore related subjects

Keep this discovery

BibTeXRIS

Xing-gang Mao. 2026-02-22. Limit Theory of the Multi-set Allocation Occupancy (MAO) Distribution: Normal and Poisson Approximations via MAO Norm. https://arxiv.org/abs/2602.19011

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

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR