Cooperative phenomena in crystals and the probability of tied Borda count elections (Q1613352): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: OEIS / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Random Voting Graph Almost Surely has a Hamiltonian Cycle when the Number of Alternatives is Large / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Condorcet's paradox / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4834167 / rank | |||
Normal rank | |||
Latest revision as of 15:21, 4 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cooperative phenomena in crystals and the probability of tied Borda count elections |
scientific article |
Statements
Cooperative phenomena in crystals and the probability of tied Borda count elections (English)
0 references
29 August 2002
0 references
The author derives an alternative formula for the number of \(n\)-step closed paths on a triangular lattice, and corrects the formula published by C. Domb [On the theory of cooperative phenomena in crystals. Adv. Phys. 9, 149--361 (1960)], where apparently a factor \(l!\) emerged from typesetting as \(1\). Modelling voter (strict) rankings of three candidates by the edges of the lattice, the author notes that a Borda tie corresponds to a closed path and so is able to use the formula to determine the probabilities that a vote of \(l\) voters results in a tie under Borda count.
0 references
Borda
0 references
probability of ties
0 references
random walk
0 references
triangular lattice
0 references
0 references
