Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
elections
random walks |
| gptkbp:describes |
probability of one candidate staying ahead in vote count
|
| gptkbp:field |
gptkb:combinatorics
gptkb:probability_theory |
| gptkbp:firstPublished |
1887
|
| gptkbp:form |
If candidate P gets p votes and Q gets q votes (p>q), probability P is always ahead is (p-q)/(p+q)
|
| gptkbp:namedAfter |
gptkb:Joseph_Bertrand
|
| gptkbp:relatedTo |
gptkb:Bertrand's_ballot_problem
gptkb:Catalan_numbers |
| gptkbp:bfsParent |
gptkb:William_Allen_Whitworth
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Ballot theorem
|