Khintchine-Pollaczek formula for random walks whose steps have one geometric tail
Abstract
We derive a Khinchine-Pollaczek formula for random walks whose steps have a geometric left tail. The construction rests on the memory-less property of the geometric distribution. An example from a tandem queue modeling dynamic instability in microtubules is given.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.