Limit theorems for monotonic particle systems and sequential deposition

We prove spatial laws of large numbers and central limit theorems for the ultimate number of adsorbed particles in a large class of multidimensional random and cooperative sequential adsorption schemes on the lattice, and also for the Johnson-Mehl model of birth, linear growth and spatial exclusion in the continuum. The lattice result is also applicable to certain telecommunications networks. The proofs are based on a general law of large numbers and central limit theorem for sums of random variables determined by the restriction of a white noise process to large spatial regions.

[1]  T. Liggett.  Interacting Particle Systems , 1985 .

[2]  Jian-Sheng Wang.  Series expansion and computer simulation studies of random sequential adsorption , 2000 .

[3]  P. Viot,et al.  From car parking to protein adsorption: an overview of sequential adsorption processes , 1999, cond-mat/9906428.

[4]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[5]  Harry Kesten,et al.  The central limit theorem for weighted minimal spanning trees on random points , 1996 .

[6]  H. Robbins,et al.  On the „Parking“ Problem , 1985 .

[7]  J. Yukich,et al.  Limit theory for random sequential packing and deposition , 2002 .

[8]  Yu Zhang.  A Martingale Approach in the Study of Percolation Clusters on the Zd Lattice , 2001 .

[9]  Central limit theory for the number of seeds in a growth model in $\bold R\sp d$ with inhomogeneous Poisson arrivals , 1997 .

[10]  Paul J. Flory,et al.  Intramolecular Reaction between Neighboring Substituents of Vinyl Polymers , 1939 .

[11]  P. Schaaf,et al.  Irreversible adsorption of colloidal particles on solid substrates , 2000 .

[12]  Eli Upfal,et al.  On-line routing of random calls in networks , 2003 .

[13]  Erwin Bolthausen,et al.  On the Central Limit Theorem for Stationary Mixing Random Fields , 1982 .

[14]  R. Durrett.  Lecture notes on particle systems and percolation , 1988 .

[15]  Predrag R. Jelenkovic,et al.  Packing Random Intervals On-Line , 1998, Algorithmica.

[16]  V. Privman.  Dynamics of nonequilibrium deposition , 1999, cond-mat/9906174.

[17]  James W. Evans,et al.  Random and cooperative sequential adsorption , 1993 .

[18]  Eli Upfal,et al.  Reducing network congestion and blocking probability through balanced allocation , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[19]  M. Penrose.  Random Parking, Sequential Adsorption,¶and the Jamming Limit , 2001 .

[20]  E. S. Page.  The Distribution of Vacancies on a Line , 1959 .

[21]  J. Mackenzie.  Sequential Filling of a Line by Intervals Placed at Random and Its Application to Linear Adsorption , 1962 .