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

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Continuous-time Markov processes on discrete state spaces (60J27) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Abstract: We study the asymptotics of the

k

-regular self-similar fragmentation process. For

a l p h a > 0

and an integer

k g e q 2

, this is the Markov process

(I_{t})_{t g e q 0}

in which each

I_{t}

is a union of open subsets of

[0, 1)

, and independently each subinterval of

I_{t}

of size

u

breaks into

k

equally sized pieces at rate

u^{a} l p h a

. Let

k^{- m_{t}}

and

k^{- M_{t}}

be the respective sizes of the largest and smallest fragments in

I_{t}

. By relating

(I_{t})_{t g e q 0}

to a branching random walk, we find that there exist explicit deterministic functions

g (t)

and

h (t)

such that

| m_{t} - g (t) | l e q 1

and

| M_{t} - h (t) | l e q 1

for all sufficiently large

t

. Furthermore, for each

n

, we study the final time at which fragments of size

k^{- n}

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

n o i n f t y

.

Recommendations

Cites work

Cited in

(3)

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)