2017
DOI: 10.1007/s10955-017-1714-1
|View full text |Cite
|
Sign up to set email alerts
|

The Largest Fragment of a Homogeneous Fragmentation Process

Abstract: We show that in homogeneous fragmentation processes the largest fragment at time t has sizewhere Φ is the Lévy exponent of the fragmentation process, and p is the unique solution of the equation (log Φ) ′ (p) = 1 1+p . We argue that this result is in line with predictions arising from the classification of homogeneous fragmentation processes as logarithmically correlated random fields.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 28 publications
0
2
0
Order By: Relevance
“…Since (31) is bounded in L q (P 1 ) for every p < q < ω + /ω − , it also converges to 0 in L p (P 1 ) (by Hölder's inequality). Putting everything together yields (30), and thus the first part of the statement. The second part is derived from standard arguments: the space C c ((0, ∞)) of continuous functions on (0, ∞) with compact support being separable, a diagonal extraction procedure easily entails, for every sequence t n → ∞, that there exists an extraction σ : N → N such that, almost surely,…”
Section: Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…Since (31) is bounded in L q (P 1 ) for every p < q < ω + /ω − , it also converges to 0 in L p (P 1 ) (by Hölder's inequality). Putting everything together yields (30), and thus the first part of the statement. The second part is derived from standard arguments: the space C c ((0, ∞)) of continuous functions on (0, ∞) with compact support being separable, a diagonal extraction procedure easily entails, for every sequence t n → ∞, that there exists an extraction σ : N → N such that, almost surely,…”
Section: Proofmentioning
confidence: 99%
“…Remark 2.11. (i) Kyprianou et al [30] recently derived an analogue of (a) for pure homogeneous fragmentations. However the method we employ here (for both statements) is different: basically, we directly transfer the known results on branching random walks to discrete skeletons of the growthfragmentation, and then infer the behavior of the whole process with the help of the…”
Section: On the Largest Fragmentmentioning
confidence: 99%