Coupling any number of balls in the infinite-bin model

Abstract

The infinite-bin model, introduced by Foss and Konstantopoulos, describes the Markovian evolution of configurations of balls placed inside bins, obeying certain transition rules. We prove that we can couple the behaviour of any finite number of balls, provided at least two different transition rules are allowed. This coupling makes it possible to define the regeneration events needed by Foss and Zachary to prove convergence results for the distribution of the balls.

12 pages, 2 figures

References in corpus (1)

• Barak-Erdős graphs and the infinite-bin model

Cited by in corpus (6)

• Two-sided infinite-bin models and analyticity for Barak-Erdős graphs
• Barak-Erdős graphs and the infinite-bin model
• The Hilbert-Galton board
• Estimation of the last passage percolation constant in a charged complete directed acyclic graph via perfect simulation
• Last passage percolation and limit theorems in Barak-Erdős directed random graphs and related models
• Freezing in the Infinite-Bin Model