2000 character limit reached
Critical Self-Similar Markov Trees
Published 17 Mar 2026 in math.PR | (2603.16408v1)
Abstract: Recently introduced and studied in arXiv:2407.07888, a self-similar Markov tree (ssMt) is a random decorated tree that vastly generalises the fragmentation tree. We study here the critical case that was left aside in arXiv:2407.07888. Borrowing techniques from branching random walk, in particular the recent result of Aïdékon--Hu--Shi arXiv:2409.01048, we can complete the picture by constructing critical ssMt, computing their fractal dimension and studying their associated harmonic and length measures using spinal decomposition.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.