2000 character limit reached
General Fragmentation Trees
Published 27 Mar 2013 in math.PR | (1303.6873v2)
Abstract: We show that the genealogy of any self-similar fragmentation process can be encoded in a compact measured real tree. Under some Malthusian hypotheses, we compute the fractal Hausdorff dimension of this tree through the use of a natural measure on the set of its leaves. This generalizes previous work of Haas and Miermont which was restricted to conservative fragmentation processes.
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.