The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes
Abstract
We consider a natural destruction process of an infinite recursive tree by removing each edge after an independent exponential time. The destruction up to time t is encoded by a partition (t) of N into blocks of connected vertices. Despite the lack of exchangeability, just like for an exchangeable fragmentation process, the process is Markovian with transitions determined by a splitting rates measure r. However, somewhat surprisingly, r fails to fulfill the usual integrability condition for the dislocation measure of exchangeable fragmentations. We further observe that a time-dependent normalization enables us to define the weights of the blocks of (t). We study the process of these weights and point at connections with Ornstein-Uhlenbeck type processes.
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.