Sharp concentration for the largest and smallest fragment in a k-regular self-similar fragmentation

From MaRDI portal
Publication:2135402

DOI10.1214/21-AOP1556zbMATH Open1498.60315arXiv2102.08935MaRDI QIDQ2135402FDOQ2135402


Authors: Piotr Dyszewski, Nina Gantert, Samuel Johnston, Joscha Prochno, Dominik Schmid Edit this on Wikidata


Publication date: 6 May 2022

Published in: The Annals of Probability (Search for Journal in Brave)

Abstract: We study the asymptotics of the k-regular self-similar fragmentation process. For alpha>0 and an integer kgeq2, this is the Markov process (It)tgeq0 in which each It is a union of open subsets of [0,1), and independently each subinterval of It of size u breaks into k equally sized pieces at rate ualpha. Let kmt and kMt be the respective sizes of the largest and smallest fragments in It. By relating (It)tgeq0 to a branching random walk, we find that there exist explicit deterministic functions g(t) and h(t) such that |mtg(t)|leq1 and |Mth(t)|leq1 for all sufficiently large t. Furthermore, for each n, we study the final time at which fragments of size kn exist. In particular, by relating our branching random walk to a certain point process, we show that, after suitable rescaling, the laws of these times converge to a Gumbel distribution as noinfty.


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




Recommendations




Cites Work


Cited In (2)





This page was built for publication: Sharp concentration for the largest and smallest fragment in a \(k\)-regular self-similar fragmentation

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