One-arm domination time in Cylindrical Hastings-Levitov(0)
Abstract
The cylindrical Hastings-Levitov(0) admits a single infinite connected tree (arm). For a cylinder of width N and particles of size λ, we consider the first time N, λ after which only the unique infinite tree receives particles. We prove that cN2λ3 E[N, λ]CN2λ3, and establish an exponential tail for N, λ. Moreover, we obtain an asymptotic bound to the expected total number of trees, and the last time a new tree emerges.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.