Pregled bibliografske jedinice broj: 1044527
Ruin probability for discrete risk processes
Ruin probability for discrete risk processes // Studia scientiarum mathematicarum Hungarica, 56 (2019), 4; 420-439 doi:10.1556/012.2019.56.4.1441 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1044527 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Ruin probability for discrete risk processes
Autori
Geček Tuđen, Ivana
Izvornik
Studia scientiarum mathematicarum Hungarica (0081-6906) 56
(2019), 4;
420-439
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
Skip-free random walk ; ballot theorem ; Kemperman's formula ; level crossing ; ruin probability ; Pollaczek-Khinchine formula
Sažetak
We study the discrete time risk process modelled by the skip-free random walk and derive results connected to the ruin probability and crossing a fixed level for this type of process. We use the method relying on the classical ballot theorems to derive the results for crossing a fixed level and compare them to the results known for the continuous time version of the risk process. We generalize this model by adding a perturbation and, still relying on the skip-free structure of that process, we generalize the previous results on crossing the fixed level for the generalized discrete time risk process. We further derive the famous Pollaczek-Khinchine type formula for this generalized process, using the decomposition of the supremum of the dual process at some special instants of time.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-IP-2018-01-4197 - Stohastički procesi sa skokovima i nelokalni operatori (DISPNOLO) (Vondraček, Zoran, HRZZ - 2018-01) ( CroRIS)
Ustanove:
Prirodoslovno-matematički fakultet, Matematički odjel, Zagreb,
Prirodoslovno-matematički fakultet, Zagreb
Profili:
Ivana Geček Tuđen
(autor)
Citiraj ovu publikaciju:
Časopis indeksira:
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus