{"title":"离散时间风险过程中作为复发序列的毁灭概率","authors":"Ernesto Cruz, Luis Rincón, David J. Santana","doi":"10.1007/s11009-024-10102-0","DOIUrl":null,"url":null,"abstract":"<p>The theory of linear recurrence sequences is applied to obtain an explicit formula for the ultimate ruin probability in a discrete-time risk process. It is assumed that the claims distribution is arbitrary but has finite support <span>\\(\\varvec{\\{0,1,\\ldots ,m+1\\}}\\)</span>, for some integer <span>\\(\\varvec{m\\ge 1}\\)</span>. The method requires finding the zeroes of an <i>m</i> degree polynomial and solving a system of <i>m</i> linear equations. An approximation is derived and some numerical results and plots are provided as examples.</p>","PeriodicalId":18442,"journal":{"name":"Methodology and Computing in Applied Probability","volume":"183 1","pages":""},"PeriodicalIF":1.0000,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Ruin Probabilities as Recurrence Sequences in a Discrete-Time Risk Process\",\"authors\":\"Ernesto Cruz, Luis Rincón, David J. Santana\",\"doi\":\"10.1007/s11009-024-10102-0\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>The theory of linear recurrence sequences is applied to obtain an explicit formula for the ultimate ruin probability in a discrete-time risk process. It is assumed that the claims distribution is arbitrary but has finite support <span>\\\\(\\\\varvec{\\\\{0,1,\\\\ldots ,m+1\\\\}}\\\\)</span>, for some integer <span>\\\\(\\\\varvec{m\\\\ge 1}\\\\)</span>. The method requires finding the zeroes of an <i>m</i> degree polynomial and solving a system of <i>m</i> linear equations. An approximation is derived and some numerical results and plots are provided as examples.</p>\",\"PeriodicalId\":18442,\"journal\":{\"name\":\"Methodology and Computing in Applied Probability\",\"volume\":\"183 1\",\"pages\":\"\"},\"PeriodicalIF\":1.0000,\"publicationDate\":\"2024-08-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Methodology and Computing in Applied Probability\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11009-024-10102-0\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"STATISTICS & PROBABILITY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Methodology and Computing in Applied Probability","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11009-024-10102-0","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0
摘要
应用线性递推序列理论得到了离散时间风险过程中最终毁灭概率的明确公式。假设索赔分布是任意的,但有有限的支持(\varvec\{0,1,\ldots ,m+1\}}),对于某个整数(\varvec{m\ge 1}\)。该方法需要找到 m 度多项式的零点,并求解 m 个线性方程组。该方法得出了一个近似值,并提供了一些数值结果和图例。
Ruin Probabilities as Recurrence Sequences in a Discrete-Time Risk Process
The theory of linear recurrence sequences is applied to obtain an explicit formula for the ultimate ruin probability in a discrete-time risk process. It is assumed that the claims distribution is arbitrary but has finite support \(\varvec{\{0,1,\ldots ,m+1\}}\), for some integer \(\varvec{m\ge 1}\). The method requires finding the zeroes of an m degree polynomial and solving a system of m linear equations. An approximation is derived and some numerical results and plots are provided as examples.
期刊介绍:
Methodology and Computing in Applied Probability will publish high quality research and review articles in the areas of applied probability that emphasize methodology and computing. Of special interest are articles in important areas of applications that include detailed case studies. Applied probability is a broad research area that is of interest to many scientists in diverse disciplines including: anthropology, biology, communication theory, economics, epidemiology, finance, linguistics, meteorology, operations research, psychology, quality control, reliability theory, sociology and statistics.
The following alphabetical listing of topics of interest to the journal is not intended to be exclusive but to demonstrate the editorial policy of attracting papers which represent a broad range of interests:
-Algorithms-
Approximations-
Asymptotic Approximations & Expansions-
Combinatorial & Geometric Probability-
Communication Networks-
Extreme Value Theory-
Finance-
Image Analysis-
Inequalities-
Information Theory-
Mathematical Physics-
Molecular Biology-
Monte Carlo Methods-
Order Statistics-
Queuing Theory-
Reliability Theory-
Stochastic Processes