Gaps between roots in ballistic deposition on a strip: linear variance, Gaussian limits and a Poisson regime

arXiv:2610.21094 · math.PR · Submitted 2026-10-15 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Gaps between roots in ballistic deposition on a strip".

Emmy: Here's the gist of the paper. The paper investigates the statistical properties of roots in ballistic deposition on a strip by proving conjectures regarding linear variance, Gaussian limits, and Poisson regimes.

Ada: The key finding is that the roots correspond to valleys of a uniformly random circular arrangement, which allows for exact moment calculations and convergence to Gaussian processes under certain conditions.

Emmy: Model and Reduction The ballistic deposition process on a cyclic strip of K sites is defined by a rule where the height of a site changes based on its neighbors.

Ada: A site is identified as a root if it receives a particle at height one, which Lemma 2.1 establishes occurs if and only if it is visited before both of its neighbours.

Paper summary: Ada: The authors of "Gaps between roots in ballistic deposition on a strip: linear variance, Gaussian limits and a Poisson regime" tackle the statistics of root gaps by showing they are valleys in a uniformly random circular arrangement <ref:2610.21094#pg1>.

Emmy: They manage to establish that the mean and variance of these gap counts, D i,K, are exactly linear in K and provide a closed form for the constants a i and b i <ref:2610.21094#pg2>.

Kolya: The work confirms they can prove that the standardized variables converge to a Gaussian process, which is shown through Stein's method and local limit theorems <ref:2610.21094#pg3>.

Ada: This means we have a complete picture of the statistical behavior for these root gaps, from the exact moments to how they behave in different limits like Poisson or Gaussian <ref:2610.21094#pg3>.

Emmy: It provides rigorous bounds on the growth speed and variance, confirming many conjectures in this area <ref:2610.21094#pg3>.

Kolya: The paper's limitation is that while it proves the convergence to a Gaussian process, it doesn't automatically give you the exact covariance structure with size thresholds for K that cannot be lowered in any case they checked <ref:2610.21094#pg3>.

Ada: So, what does this mean for us? It gives us a very solid foundation for understanding how these structures evolve statistically in complex growth models <ref:2610.21094#pg3>.

Conclusion: Ada: So we're wrapping up this look at these root gaps in ballistic deposition on a strip <ref:2610.21094#pg3>. We saw how the paper tackled the title, "Gaps between roots in ballistic deposition on a strip: linear variance, Gaussian limits and a Poisson regime."

Emmy: Yeah, I think it’s structured really nicely. It takes this complex growth process and breaks it down into these specific statistical limits. It's about finding structure behind the noise.

Kolya: From my side, what’s important is that they didn't just find some pretty numbers. They proved the mean and variance of these gaps are exactly linear in K, which is a big deal for understanding how much stuff we can expect to see.

Ada: Exactly. And they showed those standardized variables actually go to a Gaussian process when K gets really large, which is what we hope for in many complex systems.

Emmy: The authors use this idea of valleys in a random circle as the bridge between the physics and the math. It’s an elegant way to see why things behave predictably at scale.

Kolya: But there are still caveats, right? They do give us bounds on how fast these things grow and how much variation they have, but those bounds depend on some constants that aren't perfectly known yet.

Ada: That’s the thing with these kinds of proofs. You get the main idea confirmed, but then you're left looking at those exact constants and their precise values. It sets up the next big challenge for researchers.

math.PR

Submitted: 2026-10-15

Updated: 2026-10-30

Comments: 16 pages, 2 figures

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Importance score: 82/100

The gist: The paper investigates the statistical properties of roots in ballistic deposition on a strip by proving conjectures regarding linear variance, Gaussian limits, and Poisson regimes.

Key concepts

Ballistic Deposition
A process where particles are added sequentially to sites on a strip based on local rules. The height of a site changes depending on its neighbors, creating a complex growth pattern that the paper studies.
Root Identification
A specific site in the deposition process is defined as a 'root' if it receives a particle at height one. This condition is mathematically equivalent to identifying valleys within a uniformly random circular arrangement of sites.
Gaussian Limits
The standardized gap counts between roots converge weakly to a normal (Gaussian) distribution as the number of sites K becomes very large. This convergence is proven using Stein's method, providing strong statistical guarantees for the root statistics.

Terminology

Summary

The paper investigates the statistical properties of roots in ballistic deposition on a strip by proving conjectures regarding linear variance, Gaussian limits, and Poisson regimes. p. 0 The key finding is that the roots correspond to valleys of a uniformly random circular arrangement, which allows for exact moment calculations and convergence to Gaussian processes under certain conditions. p. 0

Model and Reduction

The ballistic deposition process on a cyclic strip of K sites is defined by a rule where the height of a site changes based on its neighbors. A site is identified as a root if it receives a particle at height one, which Lemma 2. p. 01 establishes occurs if and only if it is visited before both of its neighbours. p. 1 This observation reduces the complex growth process to the study of valleys in a uniformly random circular arrangement of K distinct numbers. p. 1

Exact Moment Calculations

The paper computes exact formulas for the mean and variance of the number of consecutive roots at distance i+1, denoted as D i,K. Theorem A provides exact linear moments for every i ≥ 1, stating that E D i,K = a i K (for K ≥ i + 4) and Var D i,K = b i K (for K ≥ 2i + 7). p. 1 The constants a i and b i are given by closed forms derived from integral representations involving the kernel function k(s, t). p. 0

Gaussian and Poisson Limits

The standardized variables (D i,K - E D i,K)/√b i K converge weakly to a Gaussian process as K → ∞. Theorem B confirms that for every i ≥ 1, W i,K ⇒ N(0, 1) as K → ∞. p. 0 Furthermore, the local limit theorem shows that supk √b i K P(D i,K = k) − φ((k - a i K)/√b i K) = O(log K/√K). p. 1

Growth and Nonuniform Rates

The paper also addresses the behavior of the gap length as i grows with K, showing that Di(K),K → 0 in probability when lambda K → 0, converges to Poi(λ) when λ K → λ ∈ (0, ∞), and Wi(K),K ⇒ N(0, 1) when λ K → ∞. Proposition 7. p. 44 establishes that the growth speed H n(j)/n converges to a value v K for every j ∈ ZK. p. 2 Finally, Proposition 7. p. 05 provides bounds on the variance of D i,K in terms of K when arrival rates are non-uniform. p. 2

Further Results and Verification

The reduction also yields results for R[K], the total number of roots, confirming Var R[K] = 2K/45 for K ≥ 5. Appendix A details computer verification of all finite claims using exact computation and simulations. p. 6 The correlation structure between gap counts is also analyzed, showing negative correlations between different gap lengths. p. 6 The paper concludes by providing rigorous brackets for the conjectured growth speed KvK. p. 2

Constants and Bounds

The paper derives bounds on the constants a i and b i, noting that bi/ai → 1 as i → ∞. Corollary 4. p. 66 establishes that ai and bi are rational, with specific inequalities holding for small i. p. 6 The Wasserstein bound is shown to be uniform in i, leading to dW(Wi,K, Z) ≤ 133/√a i K. p. 0 The local limit theorem is established with a Kolmogorov bound of order (a i K)−1/2. p. 9 The growth speed conjecture is bracketed between 3 and 4, with simulations suggesting a limit c∞ ≈ 4. p. 206. The upper bound on the growth speed is shown to be off scale. p. 2 The exact enumeration confirms the variance formula for R[K] at and above its thresholds. p. 4

Summary of Key Findings

The paper rigorously proves that the roots of ballistic deposition on a strip are equivalent to the valleys of a uniformly random circular arrangement. This equivalence allows for the exact determination of moments, establishing linear growth in K for mean and variance. p. 0 The convergence to a Gaussian process is proven via Stein's method and local limit theorems. The analysis covers the Poisson regime where gap counts converge to a Poisson distribution under specific conditions on lambda K. p. 0 The results provide rigorous bounds for the growth speed and variance, confirming conjectures in the literature. p. 2 The work is further supported by computer verification of exact constants and simulations of the deposition process. p. 2 The paper also explores non-uniform arrival rates, showing that the root set law remains unchanged under annealed laws. p. 2 The overall contribution is a complete characterization of the statistical behavior of root gaps in this model. p. 0

Conclusion

The research successfully establishes the linear variance, Gaussian limits, and Poisson regimes for gap counts between roots in ballistic deposition on a strip. The results provide exact formulas for moments and asymptotic behavior of the standardized variables. p. 1 p. 1 The paper provides rigorous bounds for the growth speed and variance, confirming conjectures in the field. p. 2 p. 2 This work provides a complete understanding of root statistics in this stochastic process.

References

[1] R. Arratia, L. Goldstein and L. Gordon, Two moments suffice for Poisson approximations: the Chen–Stein method, Ann. p. 0 Probab. 17 (1989), 9–25 [2] R. Atar, S. Athreya and M. Kang, Ballistic deposition on a planar strip, Electron. p. 0 Commun. Probab. 6 (2001), 31–38 [3] S. Billey, K. Burdzy and B. p. 2 E. Sagan, Permutations with given peak set, J. p. 2 Integer Seq. 16 (2013), Article 13.6.1 [4] P. Billingsley, Convergence of Probability Measures, 2nd ed. p. 8, Wiley, New York, 1999 [5] L. H. Y. Chen and Q. p. 9-M. Shao, Normal approximation under local dependence, Ann. p. 9 Probab. 32 (2004), 1985–2028 [6] S. Elizalde and M. Noy, Consecutive patterns in permutations, Adv. p. 0 in Appl. Math. 30 (2003), 110–125 [7] L. Goldstein, Berry–Esseen bounds for combinatorial central limit theorems and pattern occurrences, using zero and size biasing, J. p. 2 Appl. Probab. 42 (2005), 661–683 [8] W. Hoeffding and H. Robbins, The central limit theorem for dependent random variables, Duke Math. p. 0 J. 15 (1948), 773–780 [9] J. F. C. Kingman, The ergodic theory of subadditive stochastic processes, J. p. 2 Roy. Statist. Soc. Ser. B 30 (1968), 499–510 [10] H. Levene and J. Wolfowitz, The covariance matrix of runs up and down, Ann. p. 2 Math. Statist. 15 (1944), 58–69 [11] T. Mansour, Rastegar and Roitershtein, On ballistic deposition process on a strip, J. p. 0 Stat. Phys. 177 (2019), 626–650; arXiv:1903. p. 012548 [12] T. Mansour, Rastegar and Roitershtein, Staircase patterns in words: subsequences, subwords, and separation number, European J. p. 0 Combin. 86 (2020), 103099 [13] M. p. 0 D. Penrose, Growth and roughness of the interface for ballistic deposition, J. p. 0 Stat. Phys. 131 (2008), 247–268 [14] Y. Rinott, On normal approximation rates for certain sums of dependent random variables, J. p. 7 Comput. Appl. Math. 55 (1994), 135–143 [15] N. Ross, Fundamentals of Stein’s method, Probab. p. 0 Surv. 8 (2011), 210–293 [Purdue University] mmatijas@purdue.edu email address: mmatijas@purdue.edu [AI tools (Anthropic’s Claude)] used to assist with the exhaustive computations, with a Lean formalization of the combinatorial lemmas, and with checking grammar. p. 4 The author takes full responsibility for the content.

Pruning redundant reasoning tokens

The reduction to valleys of a random circular arrangement is based on the observation that a site becomes a root if it is visited before both its neighbours. Lemma 2.3 describes the local structure of these valley indicators Y(g). p. 8 The covariance structure Cov(D i,K, D j,K) = c ij K is proven by showing that for large K, the windows defining the covariance are disjoint modulo K. p. 4

How the training signal is built

The exact moments E D i,K = a i K and Var D i,K = b i K are derived using integral representations involving functions α i(t) and β i(x). Theorem 4.3 provides the closed form for the mean constant a i. p. 5 The second-moment constants u ij and v ij are given by complex integrals involving α i(t) and β j(x). p. 6 These constants are checked against exact permutation counts for i ≤ 30. p. 6

Where the gains come from

The convergence to a Gaussian process is established using Stein's method, yielding dW(W i,K, Z) ≤ 133/√a i K. The local limit theorem is proven using Proposition 5. p. 83 and Fourier inversion. p. 9 The analysis of growing gap lengths shows that the convergence behavior depends on lambda K, leading to Poisson approximation when lambda K → λ ∈ (0, ∞). p. 2 The growth speed is bracketed between 3 and 4 based on exact enumeration and simulations. p. 2 The paper provides rigorous bounds for the variance of D i,K in terms of K when arrival rates are non-uniform. p. 2 The overall structure confirms that the roots exhibit predictable statistical behavior governed by underlying random permutations. p. 0

Final Review

The research successfully establishes the linear variance, Gaussian limits, and Poisson regimes for gap counts between roots in ballistic deposition on a strip. The results provide exact formulas for moments and asymptotic behavior of the standardized variables. The paper provides rigorous bounds for the growth speed and variance, confirming conjectures in the field. This work provides a complete understanding of root statistics in this stochastic process.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Improve pattern detection in sequence analysis by utilizing a Poisson regime approximation for gap counts Di,K when i(K) approaches infinity to determine if Di(K),K is tending to zero, a positive constant, or infinity based on the asymptotic behavior of EDi,K.

  2. Develop robust statistical inference methods for counting consecutive patterns in sequences by applying the exact linear moment formulas derived in Theorem A and B for Cov(Di,K, Dj,K) to establish exact covariance structures rather than relying solely on asymptotic results from [11].

  3. Enhance model validation for complex random variables by implementing Stein's method with dependency neighbourhoods as described in Lemma 5.1 to derive explicit Wasserstein bounds dW(Wi,K, Z) uniformly in i and obtain tighter Kolmogorov distance bounds dK(Wi,K, Z).

  4. Create high-precision estimators for the mean and variance of root counts by using the closed forms for ai and bi from Theorem 4.3 and 4.5 to ensure accuracy across all relevant sample sizes K, including handling the sharp size thresholds identified in Remark 3.2 regarding moment linearity.

  5. Implement a local limit theorem for root counts by leveraging Proposition 7.4, which provides bounds of order Oi log K/sqrt(K) on the error between the empirical distribution of Di,K and the standard normal density phi when considering Bernoulli components within special blocks.

Sources

Related papers