The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes

DOI10.1214/EJP.V20-3866zbMATH Open1333.60186arXiv1501.01400MaRDI QIDQ894156FDOQ894156

Authors: Erich Baur, Jean Bertoin 

Publication date: 27 November 2015

Published in: Electronic Journal of Probability (Search for Journal in Brave)

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 $Pi$(t) of N into blocks of connected vertices. Despite the lack of exchangeability, just like for an exchangeable fragmentation process, the process $Pi$ 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 $Pi$(t). We study the process of these weights and point at connections with Ornstein-Uhlenbeck type processes.

Full work available at URL: https://arxiv.org/abs/1501.01400

Recommendations

• Homogeneous fragmentation processes
• Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
• Self-similar fragmentation derived from the stable tree. I: Splitting at heights
• General fragmentation trees
• The size of random fragmentation trees

zbMATH Keywords

random recursive treefragmentation processOrnstein-Uhlenbeck type processcluster sizesdestruction of graphs

Mathematics Subject Classification ID

Interacting random processes; statistical mechanics type models; percolation theory (60K35) Continuous-time Markov processes on general state spaces (60J25) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Cited In (15)

• Weak limits for the largest subpopulations in Yule processes with high mutation probabilities
• On the block counting process and the fixation line of the Bolthausen-Sznitman coalescent
• Probability tilting of compensated fragmentations
• Large-scale behaviour and hydrodynamic limit of beta coalescents
• Scaling limits for the block counting process and the fixation line for a class of \(\Lambda\)-coalescents
• The shark random swim. (Lévy flight with memory)
• Coalescences in continuous-state branching processes
• Coagulation-fragmentation duality, Poisson-Dirichlet distributions and random recursive trees
• Broadcasting‐induced colorings of preferential attachment trees
• Correction to: ``How linear reinforcement affects Donsker's theorem for empirical processes
• Population dynamics and statistical physics in synergy. Abstracts from the workshop held March 6--12, 2022
• How linear reinforcement affects Donsker's theorem for empirical processes
• A growth-fragmentation model related to Ornstein-Uhlenbeck type processes
• On the exponential functional of Markov Additive Processes, and applications to multi-type self-similar fragmentation processes and trees
• Scaling limits for a class of regular \(\Xi\)-coalescents

This page was built for publication: The fragmentation process of an infinite recursive tree and Ornstein-Uhlenbeck type processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q894156)