What does Multi-Model Voting with Correlated Errors conclude, in numbers, about “Correlated Errors and the Ceiling: the Beta-Binomial Model, Opinion Leaders and Shared Origins”?
Answer: Whenever errors share a source, majority accuracy has a ceiling below 1. In the Beta-binomial model the ceiling is the share of questions on the right side of one half; in the opinion-leader model it depends on whether the copying probability crosses \(1-1/(2p)\). Under weak correlation, more votes still bring more accuracy, at a discount; under moderately strong correlation the ceiling lies far below 1, and more votes only mark time or even make matters worse. The next chapter turns to a practical question: what is the correlation in the owner's own pool of models, and how can it be measured from data?
Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is general business analysis, not business advice. Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python only
| A. majority accuracy at p | 0.70, n odd, by correlation rho |
| rho n | 1 n=5 n=15 n=51 n=301 limit |
| 0.0 | 0.7000 0.8369 0.9500 0.9986 1.0000 1.0000 |
| 0.05 | 0.7000 0.8132 0.8927 0.9409 0.9607 0.9649 |
| 0.1 | 0.7000 0.7940 0.8507 0.8829 0.8966 0.8996 |
| 0.2 | 0.7000 0.7649 0.7955 0.8107 0.8167 0.8180 |
| 0.3 | 0.7000 0.7443 0.7617 0.7695 0.7725 0.7731 |
| 0.5 | 0.7000 0.7186 0.7243 0.7266 0.7274 0.7276 |
| B. Beta parameters behind each row | |
| rho 0.05 a | 13.300 b = 5.700 |
| rho 0.1 a | 6.300 b = 2.700 |
| rho 0.2 a | 2.800 b = 1.200 |
| rho 0.3 a | 1.633 b = 0.700 |
| rho 0.5 a | 0.700 b = 0.300 |
| C. check: rho | 0.3 limit by midpoint rule, 200000 cells |
| continued fraction 0.7731, midpoint 0.7731 |
Show the full program
# Chapter 2. p21: majority accuracy when errors are correlated.
# Model: exchangeable Beta-binomial (the Polya-Eggenberger family used
# for dependent juries). On each question a shared difficulty theta is
# drawn from Beta(a, b); given theta the n voters are right
# independently with probability theta. Mean accuracy p = a / (a + b);
# correlation of any two voters' correctness rho = 1 / (a + b + 1).
# As n grows the majority is right exactly when theta > 1/2, so the
# limit is P(theta > 1/2) = 1 - I(1/2; a, b), not 1. Exact finite-n
# tails by log-gamma terms and math.fsum; the incomplete beta by the
# Lentz continued fraction. p and rho are illustrative.
import math
def lbeta(a, b):
return math.lgamma(a) + math.lgamma(b) - math.lgamma(a + b)
def ab(p, rho):
s = 1 / rho - 1
return p * s, (1 - p) * s
def bb_major(n, p, rho):
if rho == 0:
lp, lq = math.log(p), math.log(1 - p)
terms = [math.exp(math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + k * lp
+ (n - k) * lq)
for k in range(n // 2 + 1, n + 1)]
return math.fsum(terms)
a, b = ab(p, rho)
terms = [math.exp(math.lgamma(n + 1) - math.lgamma(k + 1)
- math.lgamma(n - k + 1) + lbeta(k + a, n - k + b)
- lbeta(a, b))
for k in range(n // 2 + 1, n + 1)]
return math.fsum(terms)
def betacf(a, b, x):
tiny = 1e-300
c, d = 1.0, 1.0 - (a + b) * x / (a + 1)
d = 1.0 / (d if abs(d) > tiny else tiny)
h = d
for m in range(1, 400):
m2 = 2 * m
for num in (m * (b - m) * x / ((a + m2 - 1) * (a + m2)),
-(a + m) * (a + b + m) * x / ((a + m2) * (a + m2 + 1))):
d = 1.0 + num * d
d = 1.0 / (d if abs(d) > tiny else tiny)
c = 1.0 + num / c
c = c if abs(c) > tiny else tiny
h *= d * c
if abs(d * c - 1.0) < 1e-15:
break
return h
def betai(a, b, x):
if x <= 0:
return 0.0
if x >= 1:
return 1.0
lead = math.exp(a * math.log(x) + b * math.log(1 - x) - lbeta(a, b))
if x < (a + 1) / (a + b + 2):
return lead * betacf(a, b, x) / a
return 1.0 - lead * betacf(b, a, 1 - x) / b
def limit(p, rho):
if rho == 0:
return 1.0 if p > 0.5 else 0.0
a, b = ab(p, rho)
return 1.0 - betai(a, b, 0.5)
if __name__ == "__main__":
p = 0.7
print("A. majority accuracy at p = 0.70, n odd, by correlation rho")
print(" rho n=1 n=5 n=15 n=51 n=301 limit")
for rho in (0.0, 0.05, 0.1, 0.2, 0.3, 0.5):
cells = [bb_major(n, p, rho) for n in (1, 5, 15, 51, 301)]
print(" {:<5} {} {:.4f}".format(
rho, " ".join("{:7.4f}".format(c) for c in cells),
limit(p, rho)))
print("B. Beta parameters behind each row")
for rho in (0.05, 0.1, 0.2, 0.3, 0.5):
a, b = ab(p, rho)
print(" rho {:<5} a = {:6.3f} b = {:6.3f}".format(rho, a, b))
print("C. check: rho = 0.3 limit by midpoint rule, 200000 cells")
a, b = ab(p, 0.3)
h = 0.5 / 200000
mids = [math.exp((a - 1) * math.log(0.5 + (i + 0.5) * h)
+ (b - 1) * math.log(0.5 - (i + 0.5) * h)
- lbeta(a, b)) * h for i in range(200000)]
print(" continued fraction {:.4f}, midpoint {:.4f}".format(
limit(p, 0.3), math.fsum(mids)))Single source and citation
Fan, Y. (2026). Condorcet's Jury Theorem with Correlated Errors: When Multi-Model Voting Gets More Accurate and When Shared Origins Make Everyone Wrong Together (Version 1.0.0), Chapter 2: Correlated Errors and the Ceiling: the Beta-Binomial Model, Opinion Leaders and Shared Origins. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-309 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026309,
author = {Fan, Yafu},
title = {Condorcet's Jury Theorem with Correlated Errors: When Multi-Model Voting Gets More Accurate and When Shared Origins Make Everyone Wrong Together},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Condorcet's Binomial Majority: Why Independent Votes Grow More Accurate
- Chapter 3 · Measuring Correlation: Pairwise Correlation, the Q Statistic, Effective Votes and Colliding Wrong Answers
- Chapter 4 · Comparing Ways to Decorrelate: Resampling, Different Prompts, Different Models and Standard-Library Checks
- Chapter 5 · Weighted Majorities: Log-Odds Weights and the Double Counting of Correlated Clusters
- Chapter 6 · How Many Models and How Many Labelled Questions: the Vote Ledger and the Labelling Ledger below the Ceiling
- Chapter 7 · Classical Sources East and West: "When Three Read, Follow the Two" in the Great Plan and Condorcet's Essai of 1785
- Chapter 8 · Closing the Loop on Decorrelated Multi-Model Verdicts: a Procedure, the Correlated Voting Accuracy Calculator and a Pre-Registered Plan of Refutation