Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 67 tok/s
Gemini 2.5 Pro 52 tok/s Pro
GPT-5 Medium 30 tok/s Pro
GPT-5 High 29 tok/s Pro
GPT-4o 128 tok/s Pro
Kimi K2 204 tok/s Pro
GPT OSS 120B 461 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Ruin probabilities as recurrence sequences in a discrete-time risk process (2302.05568v1)

Published 11 Feb 2023 in math.PR

Abstract: We apply the theory of linear recurrence sequences to find an expression for the ultimate ruin probability in a discrete-time risk process. We assume the claims follow an arbitrary distribution with support ${0,1,\ldots,m}$, for some integer $m\ge2$. The method requires to find the zeroes of an $m$ degree polynomial and to solve a system of $m$ linear equations. An approximation is derived from the exact ruin formula and several numerical results and plots are provided as examples.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.