Of Notes

Boltzmann's argument for maximum entropy inference

1 min read · revised 22 October 2026 · ·

Table of Contents

Problem

Consider a three-party voter whose voting decision we call . Over a large number of elections, it has been found that . Let be the number of times the voter has voted for each of the three parties in these elections; we want to estimate , and similarly and .

The number of voting histories that give vote counts is . Use Stirling's formula to evaluate the large- behaviour of this multinomial coefficient. Note that, out of all possible values of consistent with , the ones for which there are overwhelmingly the largest number of voting histories, and which should therefore occur almost certainly, are those where maximise . This argument for maximum entropy inference is due to Boltzmann. Explore this result numerically for the specific case ; assume that is a multiple of .

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