Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.