Metraipolis › archive › dc_716906fd3dc4
Exit problems for additive-increase and multiplicative-decrease Markov-modulated processes — arXiv:2609.36269
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.36269
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T18:04:22.315Z
- SHA-256 of the archived text
5326339274368ea2fb46908804b9c81b8f63158b1e358117f25afbd9458b9b9e- Stable URL of this page
https://metraipolis.com/documento/dc_716906fd3dc4
How to cite
Exit problems for additive-increase and multiplicative-decrease Markov-modulated processes — arXiv:2609.36269 — arXiv (en), https://arxiv.org/abs/2609.36269 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_716906fd3dc4 (Metraipolis archive dc_716906fd3dc4, sha256 5326339274368ea2fb46908804b9c81b8f63158b1e358117f25afbd9458b9b9e)
BibTeX
@misc{dc716906fd3dc4,
title = {Exit problems for additive-increase and multiplicative-decrease Markov-modulated processes — arXiv:2609.36269},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.36269},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_716906fd3dc4; sha256 5326339274368ea2fb46908804b9c81b8f63158b1e358117f25afbd9458b9b9e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.36269. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study one-sided, two-sided and reflected exit problems for a finite-state Markov-modulated additive-increase and multiplicative-decrease process. For upward passage, a first-jump decomposition and a spatial Laplace transform lead to a recursion indexed by finite words of phases and to a convergent Green series. For downward passage, the first-jump operator is a strict contraction and the known contribution from $[p_i b,b]$ becomes an explicit boundary forcing term in the same spatial recursion. These allow to derive the corresponding Green representation of the first passage matrix and its finite-dimensional compatibility condition. The derivation of the two-sided exit identity is based on the Markov property, which in this context is equivalent to the cocycle property of the Laplace transform, together with the recursive equation at the upper level. For reflection at the running infimum, a finite $\bar p$-geometric method of steps realizes a certain Picard map that allows to find the exit matrix. As a result, we construct a Doob martingale related to the first passage time of the reflected Markov-modulated AIMD. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-30 in math.PR). Categorie arXiv: Probability (math.PR). Pagina del lavoro: https://arxiv.org/abs/2609.36269 — 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-10-07T17:37:10.653Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-30?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).