Freezing in the Infinite-Bin Model

Abstract

The infinite-bin model is a one-dimensional particle system on $\mathbb{Z}$ introduced by Foss and Konstantopoulos in relation with last passage percolation on complete directed acyclic graphs. In this model, at each integer time, a particle is selected at random according to its rank, and produces a child at the location immediately to its right. In this article, we consider the limiting distribution of particles after an infinite number of branching events have occurred. Under mild assumptions, we prove that the event (called freezing) that a location contains only a finite number of balls satisfies a $0-1$ law and we provide various criteria to determine whether freezing occurs.

23 pages, 2 figures. Final accepted version

References in corpus (8)

• Shift in the velocity of a front due to a cut-off
• Processes with Long Memory: Regenerative Construction and Perfect Simulation
• Speed and fluctuations of N-particle branching Brownian motion with spatial selection
• Coupling any number of balls in the infinite-bin model
• Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
• Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation
• Regularity of the time constant for last passage percolation on complete directed acyclic graphs
• Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models