Critical Self-Similar Markov Trees

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\"id\'ekon--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.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…