SearcharxivSearch

arXiv · 2608.23998

A Unified Exact Factorial-Moment Theory for Multi-set Allocation Occupancy (MAO) in Finite Populations

Abstract

Let $A_1,\ldots,A_T$ be independent uniformly selected subsets of a finite population of size $n$, with prescribed cardinalities $m_1,\ldots,m_T$. For each population element, define its occupancy level as the number of selected subsets containing it. Let $x_t$ and $x_{\geq t}$ denote the numbers of elements with occupancy exactly $t$ and at least $t$, respectively. The 2025 work introduced a general multi-set allocation occupancy (MAO) representation for higher-order occupancy moments. The present paper establishes its joint-probabilistic interpretation and provides a rigorous unified derivation for arbitrary joint occupancy categories and moment orders. Specifically, for arbitrary $B_1,\ldots,B_\ell\subseteq\{0,1,\ldots,T\}$, we prove the exact representation $F_\ell(B_1,\ldots,B_\ell)=G_T(B_1,\ldots,B_\ell)/(n)_\ell^{T-1}$, where $G_T(B_1,\ldots,B_\ell)$ is the corresponding generalized MAO transversal sum. This identity unifies the joint factorial moments of arbitrary occupancy categories within a single exact finite-population framework. In particular, writing $B_{\geq t}=\{t,t+1,\ldots,T\}$, the factorial moments of exact- and threshold-occupancy counts are obtained as the specializations $\mathbb{E}[(x_t)_\ell]=F_\ell(\{t\},\ldots,\{t\})$ and $\mathbb{E}[(x_{\geq t})_\ell]=F_\ell(B_{\geq t},\ldots,B_{\geq t})$. Mixed factorial moments, raw moments, variances, and covariances follow from the same representation through standard transformations. The formulas are verified by exhaustive enumeration over feasible parameter ranges and by Monte Carlo simulation. The resulting theory provides a rigorous and unified finite-population foundation for exact and threshold multi-set occupancy statistics.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xing-gang Mao, Xiao-yan Xue. 2026-08-25. A Unified Exact Factorial-Moment Theory for Multi-set Allocation Occupancy (MAO) in Finite Populations. https://arxiv.org/abs/2608.23998

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