Metraipolis › archive › dc_9b22bf401b74

When is the deepest drawdown also the longest? — arXiv:2610.41990

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.41990
License (as archived)
CC0-1.0
Archived
2026-11-02T04:58:26.323Z
SHA-256 of the archived text
a85d11657aafccbc1d9fc7afc2e89ad3f5c0fbb79c644aa7b7768612fcedfea4
Stable URL of this page
https://metraipolis.com/documento/dc_9b22bf401b74

How to cite

When is the deepest drawdown also the longest? — arXiv:2610.41990 — arXiv (en), https://arxiv.org/abs/2610.41990 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9b22bf401b74 (Metraipolis archive dc_9b22bf401b74, sha256 a85d11657aafccbc1d9fc7afc2e89ad3f5c0fbb79c644aa7b7768612fcedfea4)
BibTeX
@misc{dc9b22bf401b74,
  title = {When is the deepest drawdown also the longest? — arXiv:2610.41990},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.41990},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9b22bf401b74; sha256 a85d11657aafccbc1d9fc7afc2e89ad3f5c0fbb79c644aa7b7768612fcedfea4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41990. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Does the deepest drawdown take the longest to recover? For random walks with iid increments of positive finite mean, we find that the deepest and longest episodes are eventually distinct almost surely under light-tailed losses, but coincide with probability tending to one under heavy-tailed losses. More precisely, when losses have a finite exponential moment, the deepest episode's duration, relative to the longest among $n$ episodes, converges in probability to an explicit $\rho\in(0,1)$, while its descending duration rank is $n^{1-\rho+o_{\mathbb{P}}(1)}$. These limits hold for every fixed number of leading depths; in the Gaussian model, $\rho=1/2$, independently of drift and variance. The separation reflects the different exponential costs of reaching a large depth and sustaining a long episode. For regularly varying losses, a common large loss governs both depth and duration: the duration ratio tends to one almost surely, and for every fixed $k$, the $k$ deepest and $k$ longest episodes have the same indices in the same order with probability tending to one. For any $k_n\to\infty$ with $k_n=o(n)$, the proportion of common episodes among the $k_n$ deepest and $k_n$ longest converges in probability to zero in the light-tailed case and to one in the heavy-tailed case. These ranking laws also hold for completed drawdowns within a deterministic observation horizon.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.PR, nuovi lavori del giorno).
Categorie arXiv: Probability (math.PR) ; Risk Management (q-fin.RM).
Pagina del lavoro: https://arxiv.org/abs/2610.41990 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-02T04:47:27.615Z dalla pagina https://arxiv.org/list/math.PR/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).