Random Simplicial Complexes in the Medial Regime

Lewis Mead; Michael Farber

arxiv: 1907.00653 · v3 · pith:VZY5FWC6new · submitted 2019-07-01 · 🧮 math.AT · math.CO

Random Simplicial Complexes in the Medial Regime

Michael Farber , Lewis Mead This is my paper

Pith reviewed 2026-05-25 11:44 UTC · model grok-4.3

classification 🧮 math.AT math.CO

keywords random simplicial complexesmedial regimeBetti numbersAlexander dualityhomological connectivitydimension concentration

0 comments

The pith

Random simplicial complexes in the medial regime concentrate their nontrivial Betti numbers in a narrow dimensional window around log log n.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper studies random simplicial complexes where each simplex is added independently with probability bounded away from 0 and 1. It proves that in this medial regime the dimensions where the Betti numbers are nonzero form a narrow interval whose location is determined by log log n. The upper model has homology only when the codimension is between k and k plus log k for k=log2 ln n, while the lower model is highly connected and has dimension close to that value. The proof introduces a technique using Alexander duality to connect the two models.

Core claim

Nontrivial Betti numbers of typical lower and upper random simplicial complexes in the medial regime lie in a narrow range of dimensions. An upper random simplicial complex Y on n vertices has non-vanishing Betti numbers b_j(Y) only for k+c < n-j < k+log_2 k +c' with high probability, where k=log_2 ln n. A lower random simplicial complex is with high probability (k+a)-connected and its dimension d satisfies d ~ k + log_2 k + a'.

What carries the argument

Alexander duality relating the homology of the lower and upper random simplicial complex models.

If this is right

The Betti numbers of an upper random complex vanish outside a window of width approximately log log n.
Lower random complexes are connected up to dimension roughly log log n with high probability.
The dimension of a typical lower random complex is asymptotically k + log_2 k where k = log_2 ln n.
The lower and upper models share topological properties through the duality relation.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

This concentration suggests that the expected topological complexity is limited to a small number of dimensions.
The duality technique may apply to other random topological models beyond simplicial complexes.
Such results could inform the design of algorithms for computing homology in random settings.

Load-bearing premise

The inclusion probabilities for all simplices stay bounded away from zero and one even as the number of vertices increases to infinity.

What would settle it

Explicitly constructing or sampling a medial regime random simplicial complex on several thousand vertices and verifying that all Betti numbers outside the predicted range are zero.

read the original abstract

We describe topology of random simplicial complexes in the lower and upper models in the medial regime, i.e. under the assumption that the probability parameters $p_\sigma$ approach neither $0$ nor $1$. We show that nontrivial Betti numbers of typical lower and upper random simplicial complexes in the medial regime lie in a narrow range of dimensions. For instance, an upper random simplicial complex $Y$ on $n$ vertices in the medial regime with high probability has non-vanishing Betti numbers $b_{j}(Y)$ only for $k+c <n-j<k+\log_2 k +c'$ where $k=\log_2 \ln n$ and $c, c' $ are constants. A lower random simplicial complex on $n$ vertices in the medial regime is with high probability $(k+a)$-connected and its dimension $d$ satisfies $d\sim k+\log_2 k+ a'$ where $a, \, a'$ are constants. The paper develops a new technique, based on Alexander duality, which relates the lower and upper models.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The abstract gives plausible concentration results for Betti numbers in the medial regime via Alexander duality; the stress-test concern misapplies union bound and does not contradict the claims.

read the letter

The main takeaway is that this paper treats random simplicial complexes when every face-inclusion probability p_σ stays bounded away from both 0 and 1. It claims that, with high probability, the nontrivial Betti numbers sit in a narrow dimensional window and that the lower model is only logarithmically connected, with the bounds expressed in terms of k = log₂ ln n. The technical step is a new application of Alexander duality that relates the lower and upper models directly. That duality move and the explicit medial-regime statements are the parts that are not already in the sparse or dense literature. The stress-test note does not hold up. It claims the regime forces a complete complex, but the union-bound argument is backwards: each candidate face is omitted with probability at least a fixed positive constant, so the expected number of omissions is large rather than vanishing. The claimed narrow support for homology is therefore consistent with the model rather than ruled out by it. The obvious limitation is that only the abstract is available, so the actual derivations, error terms, and handling of dependencies cannot be checked. The modeling choices look standard and the circularity burden is low. This is aimed at people working on probabilistic topology and its links to topological data analysis. A reader who needs concrete ranges for homology in an intermediate probability window would find the statements useful. The work is coherent on its own terms and the new regime plus the duality technique are worth referee time, so it should go out for peer review.

Referee Report

0 major / 3 minor

Summary. The manuscript analyzes random simplicial complexes in the lower and upper models in the medial regime (probability parameters p_σ bounded away from 0 and 1). It claims that nontrivial Betti numbers of a typical upper complex Y on n vertices are supported only in the narrow window k + c < n - j < k + log₂ k + c' (k = log₂ ln n), while a typical lower complex is (k + a)-connected with dimension d ∼ k + log₂ k + a'. The central technical contribution is a new Alexander duality relating the two models.

Significance. The results give a precise, quantitative description of homological behavior in the medial regime, which had received less attention than the sparse or dense regimes. The Alexander duality technique is a genuine strength, as it directly links lower and upper models and yields the narrow support and connectivity statements without post-hoc parameter fitting. The thresholds are explicit up to absolute constants and the claims are falsifiable.

minor comments (3)

The introduction should include a short paragraph contrasting the medial regime with the well-studied sparse (p_σ → 0) and dense (p_σ → 1) regimes to clarify the novelty.
Notation for the absolute constants c, c', a, a' could be standardized (e.g., as C, C', A, A') and their independence of n stated explicitly in the statements of the main theorems.
Figure captions (if present) should indicate whether the plotted Betti numbers are for a single realization or averaged, and over what range of n.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive report, accurate summary of our results on random simplicial complexes in the medial regime, and the recommendation to accept. The emphasis on the Alexander duality as a central contribution aligns with our view of the paper's main technical advance.

Circularity Check

0 steps flagged

No circularity in derivation; results derived via new duality technique

full rationale

The paper's central claims are presented as consequences of a new Alexander duality technique relating lower and upper models under the medial regime (p_σ bounded away from 0 and 1). No self-definitional reductions, fitted inputs renamed as predictions, load-bearing self-citations, uniqueness theorems imported from authors, ansatzes smuggled via citation, or renamings of known results are present. The derivation chain is self-contained against the stated modeling assumptions and duality, with no steps reducing by construction to the inputs.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Review performed on abstract only; no explicit free parameters, axioms, or invented entities are stated beyond the definition of the medial regime.

axioms (1)

domain assumption Probability parameters p_σ approach neither 0 nor 1 (medial regime)
This is the setting in which the concentration statements are claimed to hold.

pith-pipeline@v0.9.0 · 5715 in / 1243 out tokens · 47380 ms · 2026-05-25T11:44:39.297012+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/AlexanderDuality.lean alexander_duality_circle_linking echoes

?

echoes
ECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.

We show that nontrivial Betti numbers of typical lower and upper random simplicial complexes in the medial regime lie in a narrow range of dimensions... The paper develops a new technique, based on Alexander duality, which relates the lower and upper models.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages · 1 internal anchor

[1]

Ballmann and J

W. Ballmann and J. Świ¸ atkowski, On L2 cohomology and property (T) for automorphism groups of polyhedral cell complexes , GAF A, 7 (1997) 615 – 645

work page 1997
[2]

Björner, Topological methods

A. Björner, Topological methods. Handbook of combinatorics, Vol. 1, 2, pp. 1819–1872, Elsev ier Sci. B. V., Amsterdam, 1995

work page 1995
[3]

Björner and M

A. Björner and M. Tancer, Combinatorial Alexander duality - a short and elementary pr oof, Discrete and Computational Geometry, 42(2009), 586-593

work page 2009
[4]

Bollobas, Random graphs, Cambridge University Press , 2001

B. Bollobas, Random graphs, Cambridge University Press , 2001

work page 2001
[5]

Cooley, M

O. Cooley, M. Kang, Y. Person, Largest components in random hypergraphs. Combin. Probab. Com- put. 27 (2018), no. 5, 741–762

work page 2018
[6]

Costa and M

A. Costa and M. Farber, Random Simplicial Complexes , Conﬁguration spaces, 129–153, Springer INdAM Ser., 14, Springer, 2016

work page 2016
[7]

Costa and M

A. Costa and M. Farber, Large Simplicial Random Complexes I , J. Topology and Anal. 8 (2016), no. 3, 399–429

work page 2016
[8]

Costa and M

A. Costa and M. Farber, Large random simplicial complexes, II; the fundamental gro up. J. Topology and Anal. 9 (2017), no. 3, 441–483

work page 2017
[9]

Costa and M

A. Costa and M. Farber, Large Random Simplicial Complexes III: The Critical Dimens ion. J. Knot Theory Ramiﬁcations 26 (2017), no. 2, 1740010

work page 2017
[10]

Erdős and A

P. Erdős and A. Rényi, On the evolution of random graphs , Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960), 17–61. RANDOM SIMPLICIAL COMPLEXES IN THE MEDIAL REGIME 23

work page 1960
[11]

Farber, L

M. Farber, L. Mead and T. Nowik, Random Simplicial Complexes, Duality and The Critical Dime n- sion, arXiv:1901.09578,

work page arXiv 1901
[12]

Hatcher, Algebraic Topology, Cambridge University Press (2002)

A. Hatcher, Algebraic Topology, Cambridge University Press (2002)

work page 2002
[13]

Spectral gaps of random graphs and applications

C. Hoﬀman, M. Kahle, E. Paquette, Spectral gaps of random graphs and applications to random topology, arXiv:1201.0425

work page internal anchor Pith review Pith/arXiv arXiv
[14]

Janson, T

S. Janson, T. Luczak, A.Rucinski, Random graphs, 2000

work page 2000
[15]

Kahle, Topology of random clique complexes , Discrete Math

M. Kahle, Topology of random clique complexes , Discrete Math. 309 (2009), no. 6, 1658 – 1671

work page 2009
[16]

Kahle, Topology of random simplicial complexes: a survey

M. Kahle, Topology of random simplicial complexes: a survey . In: Algebraic topology: applications and new directions, 201–221, Contemp. Math., 620, Amer. Mat h. Soc., Providence, RI, 2014

work page 2014
[17]

Linial and R

N. Linial and R. Meshulam, Homological connectivity of random 2-complexes , Combinatorica 26 (2006), 475-487

work page 2006
[18]

Meshulam and N

R. Meshulam and N. Wallach, Homological connectivity of random k-complexes , Random Structures & Algorithms 34 (2009), 408-417. School of Ma thema tical Sciences, Queen Mar y, University of London, London, E1 4NS, United Kingdom E-mail address : m.farber@qmul.ac.uk School of Ma thema tical Sciences, Queen Mar y, University of London, London, E1 4NS, Unite...

work page 2009

[1] [1]

Ballmann and J

W. Ballmann and J. Świ¸ atkowski, On L2 cohomology and property (T) for automorphism groups of polyhedral cell complexes , GAF A, 7 (1997) 615 – 645

work page 1997

[2] [2]

Björner, Topological methods

A. Björner, Topological methods. Handbook of combinatorics, Vol. 1, 2, pp. 1819–1872, Elsev ier Sci. B. V., Amsterdam, 1995

work page 1995

[3] [3]

Björner and M

A. Björner and M. Tancer, Combinatorial Alexander duality - a short and elementary pr oof, Discrete and Computational Geometry, 42(2009), 586-593

work page 2009

[4] [4]

Bollobas, Random graphs, Cambridge University Press , 2001

B. Bollobas, Random graphs, Cambridge University Press , 2001

work page 2001

[5] [5]

Cooley, M

O. Cooley, M. Kang, Y. Person, Largest components in random hypergraphs. Combin. Probab. Com- put. 27 (2018), no. 5, 741–762

work page 2018

[6] [6]

Costa and M

A. Costa and M. Farber, Random Simplicial Complexes , Conﬁguration spaces, 129–153, Springer INdAM Ser., 14, Springer, 2016

work page 2016

[7] [7]

Costa and M

A. Costa and M. Farber, Large Simplicial Random Complexes I , J. Topology and Anal. 8 (2016), no. 3, 399–429

work page 2016

[8] [8]

Costa and M

A. Costa and M. Farber, Large random simplicial complexes, II; the fundamental gro up. J. Topology and Anal. 9 (2017), no. 3, 441–483

work page 2017

[9] [9]

Costa and M

A. Costa and M. Farber, Large Random Simplicial Complexes III: The Critical Dimens ion. J. Knot Theory Ramiﬁcations 26 (2017), no. 2, 1740010

work page 2017

[10] [10]

Erdős and A

P. Erdős and A. Rényi, On the evolution of random graphs , Publ. Math. Inst. Hungar. Acad. Sci. 5 (1960), 17–61. RANDOM SIMPLICIAL COMPLEXES IN THE MEDIAL REGIME 23

work page 1960

[11] [11]

Farber, L

M. Farber, L. Mead and T. Nowik, Random Simplicial Complexes, Duality and The Critical Dime n- sion, arXiv:1901.09578,

work page arXiv 1901

[12] [12]

Hatcher, Algebraic Topology, Cambridge University Press (2002)

A. Hatcher, Algebraic Topology, Cambridge University Press (2002)

work page 2002

[13] [13]

Spectral gaps of random graphs and applications

C. Hoﬀman, M. Kahle, E. Paquette, Spectral gaps of random graphs and applications to random topology, arXiv:1201.0425

work page internal anchor Pith review Pith/arXiv arXiv

[14] [14]

Janson, T

S. Janson, T. Luczak, A.Rucinski, Random graphs, 2000

work page 2000

[15] [15]

Kahle, Topology of random clique complexes , Discrete Math

M. Kahle, Topology of random clique complexes , Discrete Math. 309 (2009), no. 6, 1658 – 1671

work page 2009

[16] [16]

Kahle, Topology of random simplicial complexes: a survey

M. Kahle, Topology of random simplicial complexes: a survey . In: Algebraic topology: applications and new directions, 201–221, Contemp. Math., 620, Amer. Mat h. Soc., Providence, RI, 2014

work page 2014

[17] [17]

Linial and R

N. Linial and R. Meshulam, Homological connectivity of random 2-complexes , Combinatorica 26 (2006), 475-487

work page 2006

[18] [18]

Meshulam and N

R. Meshulam and N. Wallach, Homological connectivity of random k-complexes , Random Structures & Algorithms 34 (2009), 408-417. School of Ma thema tical Sciences, Queen Mar y, University of London, London, E1 4NS, United Kingdom E-mail address : m.farber@qmul.ac.uk School of Ma thema tical Sciences, Queen Mar y, University of London, London, E1 4NS, Unite...

work page 2009