Ballot theorems revisited
Ballot theorems yield a simple relation for the probability that a non-decreasing process with cyclically interchangeable increments and piecewise constant paths stay below a linear function for a certain period of time. A particular instance of the problem is the classical ballot theorem that computes the chance that, in a ballot, votes of type A are always ahead of votes of type B during counting. Traditionally, one uses a combinatorial or analytic lemma to prove such theorems. In this paper we make the simple observation that all ballot theorems can be proved by direct probabilistic arguments if the stationarity of the processes involved is properly taken into account. Our proofs use a queueing theoretic construction and thus yield a physical interpretation to ballot theorems. Furthermore, they reveal the necessity of the assumptions. The auxiliary combinatorial or analytic lemmas are finally derived as a consequence.
Year of publication: |
1995
|
---|---|
Authors: | Konstantopoulos, Takis |
Published in: |
Statistics & Probability Letters. - Elsevier, ISSN 0167-7152. - Vol. 24.1995, 4, p. 331-338
|
Publisher: |
Elsevier |
Keywords: | Ballot theorems Cyclic interchangeability Queing theory Reflection mapping Little's law |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Konstantopoulos, Takis, (1996)
-
Stationary solutions of stochastic recursions describing discrete event systems
Anantharam, Venkat, (1997)
-
On the use of Lyapunov function methods in renewal theory
Konstantopoulos, Takis, (1999)
- More ...