The discrete renewal theorem with bounded interevent times
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866911213814808576 |
|---|---|
| author | Shenoy, Rohan |
| author_facet | Shenoy, Rohan |
| contents | The purpose of this note is to prove the celebrated Discrete Renewal Theorem in a common special case. We use only very elementary methods from real analysis, rather than markov chain theory, complex analysis, or generating functions. Provided is an introduction to a 1d discrete renewal process via a board game example, our proof the discrete renewal theorem, as well as background and history of the Erdǒs-Feller-Pollard Theorem. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_14020 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | The discrete renewal theorem with bounded interevent times Shenoy, Rohan Probability The purpose of this note is to prove the celebrated Discrete Renewal Theorem in a common special case. We use only very elementary methods from real analysis, rather than markov chain theory, complex analysis, or generating functions. Provided is an introduction to a 1d discrete renewal process via a board game example, our proof the discrete renewal theorem, as well as background and history of the Erdǒs-Feller-Pollard Theorem. |
| title | The discrete renewal theorem with bounded interevent times |
| topic | Probability |
| url | https://arxiv.org/abs/2510.14020 |