Recommendations
- scientific article; zbMATH DE number 1058050
- Ballot theorems, old and new
- The Ballot Problem Revisited
- Bertrand's ballot theorem
- Four Proofs of the Ballot Theorem
- scientific article; zbMATH DE number 1129264
- Direct consequences of the basic ballot theorem
- A new method for solving a class of ballot problems
- The fundamental theorem of voting schemes
Cites work
- A Generalization of the Ballot Problem and its Application in the Theory of Queues
- Ballots, queues and random graphs
- Combinatorial and analytic methods in the theory of queues
- scientific article; zbMATH DE number 4013703 (Why is no real title available?)
- scientific article; zbMATH DE number 3879889 (Why is no real title available?)
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 4078444 (Why is no real title available?)
- scientific article; zbMATH DE number 46727 (Why is no real title available?)
- scientific article; zbMATH DE number 48363 (Why is no real title available?)
- scientific article; zbMATH DE number 934441 (Why is no real title available?)
- scientific article; zbMATH DE number 3249395 (Why is no real title available?)
- scientific article; zbMATH DE number 3301915 (Why is no real title available?)
- scientific article; zbMATH DE number 3342557 (Why is no real title available?)
- Palm probabilities and stationary queues
Cited in
(16)- Ballot theorems and sojourn laws for stationary processes
- Applications of the continuous-time ballot theorem to Brownian motion and related processes.
- Collisions of random walks
- Majority rule on j-rich ballot spaces
- A cyclic approach on classical ruin model
- Ballot theorems, old and new
- Four Proofs of the Ballot Theorem
- On finite-time ruin probabilities for classical risk models
- Ballots, queues and random graphs
- scientific article; zbMATH DE number 1058050 (Why is no real title available?)
- Bertrand's ballot theorem
- scientific article; zbMATH DE number 3264565 (Why is no real title available?)
- Unusually large components in near-critical Erdős–Rényi graphs via ballot theorems
- The probability of unusually large components for critical percolation on random d-regular graphs
- Direct consequences of the basic ballot theorem
- A proof of Pollaczek-Spitzer identity
This page was built for publication: Ballot theorems revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903181)