Source
Friedkin (2011/2012), LIT-1404, read in full in NOTE-1374; and Jia, MirTabatabaei, Friedkin and Bullo (2015), LIT-1146, read in NOTE-1135, whose result is THEORY-916.
Where the evidence stands
What Friedkin’s simulations showed is THEORY-1161, Active, which this entry
extends. Neither paper compares the two single-issue steps; the comparison is
the record’s re-run, set out with its script in THEORY-1161’s note of
2026-10-30. On random complete networks the anchored step gave a single leader
every time and the DeGroot step a median largest self-weight of about 0.27 and
0.13; on strongly connected networks of density 0.4 the anchored step gave a
single leader in 93% and 96% of runs, which sits against “almost every”. Jia
et al.’s theorem for the DeGroot step is THEORY-916, Proposed, its proofs not
yet checked. The promote_when above is THEORY-1161’s condition before the twenty-fourth status review promoted it, carried here unchanged, because it asks what would make the thesis true and not what the source says.