English

On the Growth of a Ballistic Deposition Model on Finite Graphs

Probability 2020-01-28 v1 Combinatorics

Abstract

We revisit a ballistic deposition process introduced by Atar, Athreya and Kang. Let G=(V,E)\mathcal{G}=(V,E) be a finite connected graph. We choose independently and uniformly vertices in G\mathcal{G}. If a vertex xx is chosen and the previous height configuration is given by h=(hy)yVN0Vh=(h_y)_{y \in V} \in \mathbb{N}_0^V, the height hxh_x is replaced by h~x:=1+maxyxhy. \tilde{h}_x := 1 + \max_{y \sim x} h_y. We study asymptotic properties of this growth model. We determine the asymptotic growth parameter γ(G)\gamma(\mathcal{G} ) for some graphs and prove a central limit theorem for the fluctuations around γ(G)\gamma ( \mathcal{G}). We also give a new graph-theoretic interpretation of an inequality obtained by Atar et al..

Keywords

Cite

@article{arxiv.2001.09836,
  title  = {On the Growth of a Ballistic Deposition Model on Finite Graphs},
  author = {Georg Braun},
  journal= {arXiv preprint arXiv:2001.09836},
  year   = {2020}
}

Comments

24 pages