REVIEW 3 major objections 6 minor 16 references
A new look at some aspects of one-dimensional random sequential adsorption and its continuum limit
T0 review · 3 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash
Pith's one-line read This paper proves that, as k grows, the scaled expected gaps of the discrete k-bonding process converge to the gap distribution of the continuum parking problem, and it derives explicit density limits for two mixed k1,k2-bonding models…
desk verdict Solid RSA paper with a clean gap-convergence theorem and a fillable but real gap in the proof of Theorem 7's asymptotic for Model II. read the letter →
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
The reading
What carries the argument
The workhorse is the generating function for expected counts. For fixed k and l, the expected number $G^{(n)}_{k;l}$ of l-gaps satisfies a linear recursion, and multiplying the recursion by $(n-k+1)t^n$ and summing over n turns it into a first-order linear ordinary differential equation for the generating function $g_{k;l}(t)=\sum_n G^{(n)}_{k;l}t^n$. Solving that ODE and letting $t\to 1^-$ yields the integral formula (1.3) for the limiting gap density $g_{k;l}$. Theorem 3 then follows by substituting $x=k(1-s)$ and applying dominated convergence, with the discrete sums collapsing to the continuum exponentials $\exp(-2\int_0^x (1-e^{-y})/y\,dy)$. The mixed-bonding results use the same machinery on a two-size recursion, producing an ODE with coefficient $A(t)=\frac{k_1+k_2-2}{2t}+\frac{t^{k_1-1}+t^{k_2-1}}{1-t}$. The asymptotic limits as $k_2\to\infty$ are extracted from integrals of the form $\int_0^1 \exp(\sum_{j=1}^{k_2-1}(s^j-1)/j)(1-s)^D s^{b k_2}h(s)\,ds$, whose threshold behavior is controlled by the lemma stated in (6.11), which localizes the contribution near $s=1$ at the scale $x=k_2(1-s)$.
What would settle it
Numerically evaluate the left side of (6.11) for a smooth $h$ with $h(1)>0$, say $h\equiv 1$, $b=1$, $D=1$, for $C=1,2,3$ and $k_2=10^3,10^4$: the observed growth rates should match the claimed threshold $C=D+1=2$ exactly. Independently, simulate Model II on large $n$ with $k_1$ fixed, say 2, and $k_2=500$, and measure the fraction of bonded molecules when no $k_2$-blocks remain; it should approach $D\approx 0.4166$, not $m_\infty\approx 0.7476$. A systematic deviation would falsify Theorem 7.
Extended reading notes
Core claim
The central discovery is a law-of-large-numbers bridge from the discrete to the continuum. For k-bonding, Theorem 3 shows that the probability measure $\mu^{\mathrm{gaps}}_k$ on $[0,1]$, obtained by rescaling the expected gap counts by $k/m_k$, converges weakly to $\mu^{\mathrm{gaps}}_\infty$ with density $f(\gamma)=\frac{2}{m_\infty}\int_0^\infty x e^{-\gamma x}\exp(-2\int_0^x \frac{1-e^{-y}}{y}\,dy)\,dx$; this is exactly the gap distribution derived for the continuum parking process, so the discrete lattice gaps reproduce, in the $k\to\infty$ limit, the continuum gap law. The second contribution is a pair of explicit two-stage models with block sizes $k_1<k_2$. In Model I (k2-bonding to completion, then k1-bonding on the gaps) Theorem 4 gives $m_{k_1,k_2;\mathrm{I}}=m_{k_2}+\sum_{l=k_1}^{k_2-1} g_{k_2;l}M^{(l)}_{k_1}$, and Theorem 6 gives $\lim_{k_2\to\infty} m_{k_1,k_2;\mathrm{I}}=m_\infty+(1-m_\infty)m_{k_1}$. In Model II (k1- and k2-bonding chosen uniformly at random until no k2-blocks remain, then k1-bonding) Theorem 5 gives explicit integrals for the stage-one density and the final density, and Theorem 7 shows $\lim_{k_2\to\infty} m_{k_1,k_2;\mathrm{II}_1}=D\approx 0.4166$, independent of k1, while $\lim_{k_2\to\infty} m_{k_1,k_2;\mathrm{II}}=D+(1-D)m_{k_1}$. Theorems 8 and 9 provide further integral limits when $k_1\to\infty$ with $k_2=[Lk_1]$, $L\in(1,2]$.
Load-bearing premise
The main limit for the competitive model depends on an asymptotic estimate, equation (6.11), that the paper states without proof; the estimate dictates exactly how the $k_2$-power threshold of a certain integral behaves, and if that threshold is wrong the constant 0.4166 and the formula $D+(1-D)m_{k_1}$ would not follow.
Editorial extensions
If this is right
- For large k, the rescaled gaps in k-bonding follow the continuum parking gap law: the average gap size tends to $(1-m_\infty)/m_\infty\approx 0.3376$, just over one-third of the maximum gap size $k-1$.
- For the sequential $k_2$-then-$k_1$ model, the limiting density as $k_2\to\infty$ is $m_\infty+(1-m_\infty)m_{k_1}$, so a short-bonding pass on the leftover gaps recovers a fraction $m_{k_1}$ of the previously empty space.
- For the competitive model, the density when $k_2$-blocks disappear is $D\approx 0.4166$ for every fixed $k_1$, and the final density after $k_1$-bonding is $D+(1-D)m_{k_1}$; competition between the two sizes cuts the first-stage occupation nearly in half compared with $m_\infty\approx 0.7476$.
- When $k_1\to\infty$ with $k_2\sim Lk_1$ for $L\in(1,2]$, both mixed models have explicit continuum-integral limits given by (1.19) and (1.20), and both reduce to $m_\infty$ when $L=1$.
- The paper's tables show the ordering $m_{k_1,k_2;\mathrm{I}} \ge m_{k_1,k_2;\mathrm{II}} \ge m_{k_1}$, so sequential two-size bonding packs more densely than competitive two-size bonding, which in turn beats pure $k_1$-bonding.
Reading between the lines
- The independence of $D$ from $k_1$ suggests a robust continuum phenomenon: in a two-species parking process where infinitesimally small dust particles compete with unit cars, the fraction of space occupied when no more cars fit might be a universal constant $D\approx 0.4166$, irrespective of the dust size; one could test this by continuous-space simulation with two particle sizes.
- The unproved threshold lemma (6.11) is a one-dimensional Laplace/Abelian estimate; supplying a proof would close the only gap in Theorem 7, and a failure for some continuous $h$ would likely show up as a wrong prefactor in $D+(1-D)m_{k_1}$.
- The decomposition pattern $m_\infty+(1-m_\infty)m$ and $D+(1-D)m$ looks like a general fill-the-gaps principle for one-dimensional random sequential adsorption: if the first phase leaves residual gaps whose local density vanishes in the relevant limit, the second phase simply multiplies the empty fraction by its own limiting density. In higher dimensions, gap geometry is not intervals, so the prin
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper studies one-dimensional random sequential adsorption (RSA) in a discrete setting. For k-bonding on a row of n molecules, it analyzes the expected densities g_{k;l} of gaps of sizes l=0,...,k-1 and shows that, after scaling the k-grid, the empirical measure of expected gap densities converges weakly as k→∞ to the gap distribution of the continuous Rényi parking problem (Theorem 3). The paper then introduces two mixed models in which both k1-bonding and k2-bonding occur. For Model I (sequential k2 then k1 bonding) and Model II (competitive k1/k2 bonding followed by k1 bonding), it derives explicit integral formulas for the limiting expected bonding densities (Theorems 4 and 5) and evaluates limits as k2→∞ with k1 fixed (Theorems 6 and 7) and as k1→∞ with k2≈Lk1 (Theorems 8 and 9). The new asymptotics for Model II involve a constant D≈0.4166 that is independent of k1. The proofs use generating functions, linear ODEs, and Laplace/Watson-type asymptotic expansions.
Significance. If the proofs are completed, the paper makes two substantial contributions. First, Theorem 3 establishes a discrete-to-continuum convergence of expected gap distributions to the Rényi parking gap law, complementing Bánkövi's continuum result with a rigorous lattice analogue. Second, Theorems 5–9 provide explicit formulas for mixed RSA models, including a striking new constant D≈0.4166 that quantifies how small k1-bonds suppress k2-bonding in the competitive model. The derivations are largely formula-driven and parameter-free, and the paper contains no circularity: constants such as m∞ and D are computed from integrals, not fitted. However, the proof of Theorem 7 relies on an unproved asymptotic lemma and on a non-uniform replacement of M^{(j)}_{k1} by its limit, and the existence of the limits underlying several theorems is delegated to the author's book [13] without a self-contained argument. These gaps are fillable but currently leave the central Model II asymptotics not fully justified.
major comments (3)
- [Section 6, Eq. (6.11)] The asymptotic lemma (6.11) is stated with no proof ('it is easy to see') and its hypotheses require h continuous on [0,1] with h(1)>0. In the proof of Theorem 7 the lemma is applied to h(s)=s^{-k1/2} exp(sum_{j=1}^{k1-1}(s^j-1)/j), which is unbounded at s=0 and therefore not continuous on [0,1]. The lemma is plausibly true for such singular h under a standard Watson/Laplace expansion, but that extension is neither stated nor proved. Please provide a proof of (6.11) in the needed generality, or give a direct asymptotic treatment of the actual integrand in IV_{k2}.
- [Section 6, passage from (1.13) to (6.12)–(6.13)] The replacement of M^{(j)}_{k1} by j m_{k1} inside the double sums defining III_{k2} and IV_{k2} is asserted to follow from (1.1), but (1.1) is a pointwise limit as j→∞. For n near k2, the inner sums contain only finitely many terms with j of order k1, where the approximation M^{(j)}_{k1}≈j m_{k1} is not valid, and no uniform error estimates are supplied. The statement in (6.8) that the approximation holds 'uniformly over n' needs a quantitative justification showing that the contribution of the small-j terms vanishes after integration against the s^{b k2} weight.
- [Section 2 and Section 4, proof of Theorem 2 and derivation of (4.16)] The existence of the limit lim_{n→∞} G^{(n)}_{k;l}/n is delegated to 'almost exactly the same' as Proposition 3.3 in [13] without reproducing the argument or even stating the proposition. The same 'similar to the proof of Theorem 2' step is used in (4.16) to pass from the generating function to the limit defining m_{k1,k2;II}. Since Theorems 3–9 all depend on these limit statements, please make the existence argument self-contained (or state the referenced result precisely and verify it applies) so that the integral formulas in Theorems 2 and 5 are not conditional on an omitted proof.
minor comments (6)
- [Abstract] The phrase 'The second part of the this paper' should be 'The second part of this paper'.
- [Title page] The title has a typo: 'A NEW LOOK A T SOME ASPECTS' should read 'A NEW LOOK AT SOME ASPECTS'.
- [Section 2, after Eq. (2.10)] In the sentence 'with boundary condition M^{(n)}_k = 0' there is a stray subscript: it reads 'M^{(n)}_{k;l}' but should be 'M^{(n)}_k'.
- [Section 4, after Eq. (4.16)] The phrase 'where B1, Bs are as in (4.12)' should read 'where B1, B2 are as in (4.12)'.
- [Proof of Theorem 4] The text says 'In Model 1', which should be 'In Model I' for consistency with the notation in (1.10).
- [Eq. (6.11)] The parameter D in the lemma conflicts with the constant D introduced in (1.18); renaming the lemma parameter, e.g., to α, would avoid confusion.
Circularity Check
No circular derivation: the limits are computed from explicit generating-function formulas and independent results; self-citations are minor and non-load-bearing, while the unproved asymptotic lemma in Theorem 7 is a rigor gap rather than circularity.
full rationale
The paper's central results are derived limits, not fitted quantities. Theorem 1 is cited from the author's book [13], but the paper immediately notes earlier independent derivations in [9], [11], and [7], so the self-citation is not load-bearing. Theorem 2 is proved by a generating-function argument, with one existence step said to be 'almost exactly the same as the proof of Proposition 3.3 in [13]'; however Theorem 2 was previously proved in [10], so this is also not a load-bearing self-citation. Theorem 3 follows by dominated convergence from equation (3.2), (1.2), and Theorem 2; the Bánkövi gap distribution appears as the target, not as an input. Corollary 1, Theorems 4, 6, and 8 are algebraic consequences of Theorems 1, 2, and 3, with no fitted constants. Theorem 5 is an explicit linear-ODE solution for the generating function, and Theorems 6-9 take genuine limits of explicit integrals. There is no empirical fitting, no parameter renamed as a prediction, and no definition that presupposes the claimed conclusion. The notable weakness is equation (6.11), stated as 'For h(x) continuous on [0,1] with h(1) > 0 and b > 0 ... it is easy to see' and used to prove Theorem 7; moreover, the later application takes h(s)=s^{-k1/2} exp(sum_{j=1}^{k1-1}(s^j-1)/j), which is unbounded at s=0 and so does not satisfy the stated continuity hypothesis. That is a genuine proof gap and a correctness risk, but it is not circularity: the lemma is an analytic asymptotic estimate, not a restatement of the theorem, and the replacement of M^{(j)}_{k1} by j m_{k1} uses the known exact density m_{k1} rather than fitting anything. The constants D and m_infinity are computed from integrals, not chosen to force the final formulas. Overall, no reduction of a claimed prediction to its own inputs was found; the score reflects only the minor non-load-bearing self-citations and the unproved lemma, which does not by itself make the derivation circular.
Assumptions & free parameters
assumptions (5)
- domain assumption Theorem 1: m_k = k times the integral from 0 to 1 of exp(2 sum_{j=1}^{k-1}(s^j-1)/j) ds, the explicit formula for the k-bonding density.
- domain assumption Bánkövi's result that the uniform random gap in the continuous Rényi parking problem converges to µgaps_infinity with density (1.8).
- domain assumption Existence of lim_{n goes to infinity} G^{(n)}_{k;l}/n, delegated to Proposition 3.3 in [13].
- domain assumption Additivity of expected stage-one bonds on disjoint subintervals (strong Markov property for RSA).
- ad hoc to paper The Laplace-type limit lemma (6.11).
Cite this review
Pith. "Pith review of A new look at some aspects of one-dimensional random sequential adsorption and its continuum limit." pith.science (2026). https://pith.science/paper/XFH4KRFT
@misc{pith2026260804730,
author = {Pith},
title = {Pith review of: A new look at some aspects of one-dimensional random sequential adsorption and its continuum limit},
year = {2026},
howpublished = {\url{https://pith.science/paper/XFH4KRFT}},
note = {Machine review of arXiv:2608.04730}
}
abstract
Fix a positive integer $k\ge2$, and for $n\ge k$, consider a row of $n$ molecules. From among the $n-k+1$ nearest-neighbor $k$-tuples of molecules, select one uniformly at random and bond the $k$ molecules. Now, from all the remaining nearest-neighbor $k$-tuples, again select one uniformly at random and bond the $k$ molecules. Continue like this until there are no nearest-neighbor $k$-tuples left. Let $M^{(n)}_k$ denote the expected value of the number of bonded molecules. An explicit integral formula for $m_k:=\lim_{n\to\infty}\frac{M^{(n)}_k}n$ is known, and an explicit formula for $m_\infty:=\lim_{k\to\infty}m_k$ is known. The constant $m_\infty$, known as the R\'enyi parking constant, arises as the limiting packing density for a continuous analog of the above discrete packing problems. These are all models of what is called random sequential adsorption (RSA). The first part of this paper studies the gaps of sizes $0,1,\cdots, k-1$ that arise between bonded $k$-tuples and shows that after scaling the $k$-grid, when $k\to\infty$ the empirical distribution of expected gaps in the discrete problem on the lattice converges weakly to an appropriate gap distribution that is known to hold for the above noted continuous analog. The second part of the this paper considers two different models of the discrete bonding problem when both $k_1$-bonding and $k_2$-bonding occur, with $2\le k_1<k_2$. Explicit formulas are obtained for the analogs of $m_k$, and the asymptotic behavior of these analogs is studied both when $k_2\to\infty$ with $k_1$ fixed, and when $k_1,k_2\to\infty$ at certain ratios.
Figures
Reference graph
Works this paper leans on
-
[13]
Pinsky, R.G., Problems from the Discrete to the Continuous , Universitext Springer, Cham, (2014), xiv+154 pp
work page 2014
-
[1]
B´ ank¨ ovi, G.,On gaps generated by a random space filling procedure , Magyar Tud. Akad. Mat. Kutat´ o Int. K¨ ozl. 7 (1962), 395–407
work page 1962
- [2]
-
[3]
Dvoretzky A. and Robbins, H. On the parking problem , Publ. Math. Inst. Hung. Acad. Sci., 9 (1964), 209–224
work page 1964
-
[4]
and ˘Zubrini´ c, J.,Complexity function of jammed configurations of Rydberg atoms , Ars Math
Do˘ sli´ c, T., Puljiz, M., ˘Sebek, S. and ˘Zubrini´ c, J.,Complexity function of jammed configurations of Rydberg atoms , Ars Math. Contemp. 24 (2024), no. 4, Paper No. 5, 28 pp
work page 2024
-
[5]
W., Random and cooperative sequential adsorption , Reviews of Modern Physics 65, no
Evans, J. W., Random and cooperative sequential adsorption , Reviews of Modern Physics 65, no. 4 (1993): 1281–1329
work page 1993
-
[6]
Flory, P.J., Intramolecular reaction between neighboring substituent s of vinyl poly- mers, J. Amer. Chem. Soc., 61(6) (1939), 1518-1521
work page 1939
-
[7]
and MacKenzie, J.K., Problem 62-3 , SIAM Review 6 (1964), 180–182
Friedman, H.D., Rothman, D. and MacKenzie, J.K., Problem 62-3 , SIAM Review 6 (1964), 180–182. 32 ROSS G. PINSKY
work page 1964
Show all 16 references
-
[8]
Gerin, L., The Page-R´ enyi parking process, Electron. J. Combin. 22 (2015), no. 4, Paper 4.4, 13 pp
2015
-
[9]
and Høye, J.S., Cooperative effects in random sequen- tial polymer reactions Chem
Gonz´ alez, J.J., Hemmer, P.C. and Høye, J.S., Cooperative effects in random sequen- tial polymer reactions Chem. Phys. 3 (1974), 228-238
1974
-
[10]
and Runnenburg, J.T., Discrete spacings, Stat
Klaassen, C.A.J. and Runnenburg, J.T., Discrete spacings, Stat. Neerl. 57 (4) (2003), 470–483
2003
-
[11]
Mackenzie,K., Sequential filling of a line by intervals placed at random and its appli- cation to linear adsorption , J. Chem. Phys. 37 (1962), 723–728
1962
-
[12]
Page, E.S., The distribution of vacancies on a line , J. Roy. Statist. Soc. Ser. B, 21, (1959), 364–374
1959
-
[14]
R´ enyi, A.,On a one-dimensional problem concerning space-filling , Publ. Math. Inst. Hungar. Acad. Sci., 3 (109–127), 1958
1958
-
[15]
and van de Ven, P
Shneer S. and van de Ven, P. M., Per-site occupancy in the discrete parking problem , Statist Probab Lett., (2017), 120:141–146
2017
-
[16]
de Bruijn ’s short route to R´ enyi’s parking constant, Amer
Slavik, A. de Bruijn ’s short route to R´ enyi’s parking constant, Amer. Math. Monthly 131 (2024), no. 10, 831–841. Department of Mathematics, Technion—Israel Institute of T echnology, Haifa, 32000, Israel Email address : pinsky@technion.ac.il URL: https://pinsky.net.technion.ac.il/
2024
Reviewed August 6, 2026 · model on record in the stance chip above.
Discussion (0). Continue with ORCID to comment.