Of Notes

Joint pmf and rate function for three-party voting counts

1 min read · revised 22 October 2026 · ·

Table of Contents

Problem

The MaxEnt probabilities for the voting patterns in the independent three-party voters problem discussed in the previous problem, depend only on the total numbers , and of , and votes and can be written as where and are the single-voter marginal probabilities to vote , and , given by

(a) Verify the expressions for the marginal probabilities and .

(b) Using the expression for and the fact that it depends only on , derive the joint pmf of the numbers of votes cast for the three options. [Hint: you will need the number of ways to partition a set of elements into 3 non-overlapping subsets of sizes , i.e. a multinomial coefficient.]

(c) Use the Stirling approximation of the factorials in the multinomial coefficient of (b) to show that the joint pmf for the fractions , is for approximated by in which the rate function is

(d) From the structure of the expression for in terms of the rate function, argue that in the limit the pmf is exponentially small in unless . [Hint: the reasoning is completely analogous to that used in the two-party voter case.]

Solution

/ or Ctrl K
search; empty, it shows notes to revise and lately read
m
mark this note to revise, or unmark it
c
cover maths, proofs and solutions to test yourself
n
uncover the next covered item
y
copy this note’s org-roam link
e
copy this note as markdown, LaTeX kept as TeX
p
the next problem to work; there h hints, s shows the solution, x passes it for today
→ ← j k space
turn the page, when reading in pages
l
on the map, trace the greatest distance, then the longest path
double-click
a formula, to copy its TeX
rest on maths
bind a part of a formula and open the wheel of notes it comes from; scroll or ↑ ↓ widens it, 1–6 goes
?
this card