Two-sided infinite-bin models and analyticity for Barak-Erdos graphs

Abstract

In this article, we prove that for any probability distribution μ on N one can construct a two-sided stationary version of the infinite-bin model (an interacting particle system introduced by Foss and Konstantopoulos) with move distribution μ. Using this result, we obtain a new formula for the speed of the front of infinite-bin models, as a series of positive terms. This implies that the growth rate C(p) of the longest path in a Barak-Erdos graph of parameter p is analytic on (0,1].

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…