Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash 100 tok/s
Gemini 2.5 Pro 58 tok/s Pro
GPT-5 Medium 29 tok/s
GPT-5 High 29 tok/s Pro
GPT-4o 103 tok/s
GPT OSS 120B 480 tok/s Pro
Kimi K2 215 tok/s Pro
2000 character limit reached

Replace-after-Fixed-or-Random-Time Extensions of the Poisson Process (1812.04775v1)

Published 12 Dec 2018 in math.PR

Abstract: We analyze extensions of the Poisson process in which any interarrival time that exceeds a fixed value $r$ is counted as an interarrival of duration $r$. In the engineering application that initiated this work, one part is tested at a time, and $N(t)$ is the number of parts that, by time $t$, have either failed, or if they have reached age $r$ while still functioning, have been replaced. We refer to ${N(t), t \geq 0}$ as a replace-after-fixed-time process. We extend this idea to the case where the replacement time for the process is itself random, and refer to the resulting doubly stochastic process as a replace-after-random-time process.

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

Collections

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

Summary

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

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

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