The Multinomial Allocation Model and the Random Box Load

Serik Sagitov

arxiv: 2604.15152 · v2 · submitted 2026-04-16 · 🧮 math.PR

The Multinomial Allocation Model and the Random Box Load

Serik Sagitov This is my paper

Pith reviewed 2026-05-10 09:50 UTC · model grok-4.3

classification 🧮 math.PR

keywords multinomial allocationrandom allocation modeloccupancy countsasymptotic approximationsremainder boundsbox loadKolchin-Sevastyanov-Chistyakov

0 comments

The pith

The asymptotics of occupancy counts in the multinomial allocation model are compactly expressed via the load on a randomly selected box.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper revisits the model of independently placing n balls into N boxes according to fixed probabilities q1 through qN. It shows that the classical asymptotic formulas for the expectations, variances, and covariances of the occupancy counts can be rewritten in a compact way using the load experienced by a box chosen at random. Explicit two-sided bounds on the remainder terms follow from this reformulation and hold under weaker conditions on the q_i than earlier statements required. A reader might care because the approach clarifies the large-scale behavior of allocations that arise in statistics, computer science, and probability models.

Core claim

In the random allocation model with n balls and N boxes having probabilities q_i, a classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations, variances, and covariances of the occupancy counts is reformulated in a compact and transparent form in terms of the load of a randomly selected box. Explicit two-sided bounds for the associated remainder terms are derived under weaker assumptions than those previously required.

What carries the argument

The load of a randomly selected box, which carries the asymptotic expressions and remainder bounds for the full set of occupancy counts.

If this is right

Variances and covariances of occupancy counts reduce directly to moments of the random box load.
Error terms admit explicit two-sided control without the stronger assumptions of earlier analyses.
The reformulation applies to heterogeneous probabilities q_i provided the milder conditions hold.
Covariance calculations between distinct boxes become simpler through the single-load representation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The single-load view may ease numerical work on finite but large allocations with uneven probabilities.
Similar reformulations could be tested in related models such as weighted sampling or dependent placements.
The explicit bounds open the possibility of uniform error estimates across a wider class of q vectors.

Load-bearing premise

Both n and N are large and the box probabilities satisfy weaker conditions than those used in prior work.

What would settle it

A specific sequence of probability vectors q where the claimed compact expressions or the two-sided remainder bounds fail to hold numerically as n and N grow large.

Figures

Figures reproduced from arXiv: 2604.15152 by Serik Sagitov.

read the original abstract

We revisit the random allocation model in which $n$ balls are independently placed into $N$ boxes with probabilities $q_1,\ldots,q_N$. A classical asymptotic result due to Kolchin, Sevastyanov, and Chistyakov for the expectations, variances, and covariances of the occupancy counts is reformulated in a compact and transparent form in terms of the load of a randomly selected box. We further derive explicit two-sided bounds for the associated remainder terms, obtained under weaker assumptions than those previously required.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

A modest reformulation of classical multinomial asymptotics with explicit two-sided remainder bounds under weaker conditions.

read the letter

The key point is that this paper gives a compact reformulation of the Kolchin-Sevastyanov-Chistyakov asymptotics for expectations, variances, and covariances of occupancy counts in the multinomial model, now expressed in terms of the load on a randomly selected box, along with explicit two-sided bounds on the remainder terms under weaker assumptions on the probabilities q_i. What stands out as new is the transparent form using the random box load and the quantitative two-sided error bounds. This reformulation can make it easier to see how the asymptotics depend on the distribution of the q's without going through the full multivariate expressions. The bounds being two-sided and explicit is an improvement over many classical statements that only give the leading term or one-sided estimates. The paper claims these hold under milder conditions than before, which, if true, broadens the applicability slightly in cases where the probabilities are not too concentrated. The work is done carefully within the standard asymptotic regime of large n and N, without extra assumptions like uniformity. It sticks to direct probabilistic arguments rather than heavy machinery. On the softer side, this is an incremental technical note rather than a major advance. It does not resolve any longstanding open questions in the field or introduce methods that could be applied to non-asymptotic regimes or dependent allocations. The practical impact depends on how much weaker the new conditions really are; if they only relax a logarithmic factor or something minor, the gain is limited. There are no simulations or examples to show the bounds in action, which would have helped assess sharpness. This paper is mainly for researchers in combinatorial probability who work with urn models or random allocations. Someone extending these results or using them in algorithm analysis might find the new form convenient. It is not broad enough for a general probability audience. It deserves a serious referee because the central claims are precise, the derivations seem standard and honest, and the improvement in assumptions is verifiable in principle. The citation pattern looks appropriate, building directly on the classical references without unnecessary self-reference. I would recommend putting it through peer review in a specialized journal. It is solid enough to warrant expert feedback even if revisions are needed for clarity on the assumptions.

Referee Report

0 major / 3 minor

Summary. The manuscript revisits the multinomial random allocation model in which n balls are placed independently into N boxes according to probabilities q_1,...,q_N. It reformulates the classical asymptotic results of Kolchin, Sevastyanov and Chistyakov for the expectations, variances and covariances of the occupancy counts in a compact form expressed via the load of a randomly selected box, and derives explicit two-sided bounds on the associated remainder terms under weaker conditions on the probability vector than those required in prior work.

Significance. If the reformulation and bounds are valid, the work supplies a transparent re-expression of a classical result together with quantitative error control that applies under milder hypotheses on (q_i). This strengthens the practical utility of the asymptotics for large n and N. The paper provides a parameter-free reformulation of known limits plus explicit two-sided remainder bounds, which are concrete strengths.

minor comments (3)

[§2] §2, Definition 2.1: the notation for the random box load L should be introduced with an explicit probabilistic representation (e.g., as the sum of indicators weighted by a uniform random index) before the asymptotic statements are given.
[Theorem 3.2] Theorem 3.2: the two-sided bounds are stated for the remainder after the leading term; it would help to add a short remark clarifying whether the constants in the O(·) terms depend on the minimal q_i or are uniform under the stated weaker conditions.
[Introduction] The introduction cites the original Kolchin–Sevastyanov–Chistyakov work but does not list the precise earlier assumptions that are now relaxed; a one-sentence comparison would improve readability.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. The recognition of the compact reformulation via random box load and the explicit two-sided remainder bounds under relaxed assumptions is appreciated.

Circularity Check

0 steps flagged

No circularity: reformulation of external classical result

full rationale

The paper takes the classical Kolchin-Sevastyanov-Chistyakov asymptotic formulas for the means, variances, and covariances of multinomial occupancy counts and rewrites them compactly using the load random variable of a uniformly chosen box. It then supplies explicit two-sided remainder bounds that hold under weaker conditions on the probability vector (q_i) than earlier statements. Both steps are standard asymptotic re-expression plus error control; they cite an external 1970s result whose authors have no overlap with the present author, introduce no fitted parameters that are later relabeled as predictions, and contain no self-definitional loops or ansatz smuggled via self-citation. The derivation chain therefore remains independent of its own outputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on standard limit theorems in probability theory and the cited classical asymptotic result; no new free parameters or invented entities are introduced.

axioms (1)

domain assumption Asymptotic regime as n and N tend to infinity under suitable scaling
The reformulation and bounds are derived in the large-n, large-N limit typical of occupancy problems.

pith-pipeline@v0.9.0 · 5367 in / 1241 out tokens · 33815 ms · 2026-05-10T09:50:37.890547+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

4 extracted references · 4 canonical work pages

[1]

A. D. Barbour, L. Holst, and S. Janson.Poisson Approximation. Oxford University Press, 1992

work page 1992
[2]

W. Feller. An Introduction to Probability Theory and Its Applications, Volume 1. John Wiley, 1950

work page 1950
[3]

Gnedin, S

A. Gnedin, S. Janson, and Y. Malinovsky. Maximal Counts in the Stopped Occupancy Problem.Preprint arXiv:2506.20411, 2025

work page arXiv 2025
[4]

V. F. Kolchin, B. A. Sevast’yanov, and V. P. Chistyakov.Random Allocations. Winston & Sons, Washington, DC, 1978. 8

work page 1978

[1] [1]

A. D. Barbour, L. Holst, and S. Janson.Poisson Approximation. Oxford University Press, 1992

work page 1992

[2] [2]

W. Feller. An Introduction to Probability Theory and Its Applications, Volume 1. John Wiley, 1950

work page 1950

[3] [3]

Gnedin, S

A. Gnedin, S. Janson, and Y. Malinovsky. Maximal Counts in the Stopped Occupancy Problem.Preprint arXiv:2506.20411, 2025

work page arXiv 2025

[4] [4]

V. F. Kolchin, B. A. Sevast’yanov, and V. P. Chistyakov.Random Allocations. Winston & Sons, Washington, DC, 1978. 8

work page 1978