pith. sign in

arxiv: 2605.23371 · v1 · pith:JPTDDBACnew · submitted 2026-05-22 · 🧮 math.CO · math.PR

Central limit theorems for high dimensional lattice polytopes: cosmological polytopes

Torben Donzelmann , Martina Juhnke , Benedikt Redno\ss , Christoph Th\"ale This is my paper

Pith reviewed 2026-05-25 04:08 UTC · model grok-4.3

classification 🧮 math.CO math.PR
keywords cosmological polytopesErdős–Rényi graphscentral limit theoremslattice polytopesunimodular triangulationsrandom polytopesedge counts
0
0 comments X

The pith

Cosmological polytopes from random graphs obey central limit theorems for their edge counts in high dimensions.

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

The paper studies lattice polytopes constructed from Erdős–Rényi random graphs in a high-dimensional regime, where the polytope geometry is fixed by the graph structure. It derives asymptotic formulas for the expected number and variance of polytope edges as well as edges in unimodular triangulations. Quantitative central limit theorems are proved for these counts using graph-theoretic edge descriptions. A sympathetic reader would care because the results supply precise probabilistic control over geometric invariants in a concrete random model of lattice polytopes.

Core claim

Cosmological polytopes induced by Erdős–Rényi random graphs admit asymptotic formulas for the expectations and variances of the number of polytope edges and the number of edges in unimodular triangulations, together with quantitative central limit theorems for these statistics in the relevant parameter regime, obtained from explicit graph-theoretic descriptions of the edge sets and the discrete Malliavin–Stein method.

What carries the argument

Cosmological polytopes induced by Erdős–Rényi random graphs, whose edge sets admit explicit graph-theoretic descriptions that are then fed into the discrete Malliavin–Stein method for normal approximation.

If this is right

  • Asymptotic expressions hold for the expected number of edges in the polytopes and in their unimodular triangulations.
  • Asymptotic expressions hold for the variances of these edge counts.
  • The normalized edge-count statistics converge to a standard normal distribution with explicit quantitative error bounds.
  • The geometric edge features of the polytopes are completely determined by combinatorial properties of the underlying random graph.

Where Pith is reading between the lines

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

  • The same graph-theoretic reduction might be attempted for other families of random lattice polytopes whose edges also admit simple combinatorial descriptions.
  • Quantitative normal approximation bounds could be used to design efficient sampling procedures for high-dimensional polytopes with controlled edge statistics.
  • The results suggest that variance formulas for related geometric counts, such as face numbers beyond edges, may also be accessible via the same method once graph descriptions are written down.

Load-bearing premise

Explicit graph-theoretic descriptions of the edge sets exist and allow the discrete Malliavin–Stein method to be applied directly without extra error terms that would invalidate the quantitative bounds.

What would settle it

Computed edge counts on large random graphs in the high-dimensional regime whose normalized distribution deviates from the standard normal by more than the stated quantitative error bound, or whose sample variance fails to match the derived asymptotic formula.

read the original abstract

We study cosmological polytopes induced by Erd\H{o}s--R\'enyi random graphs in a high-dimensional regime. These graph-based lattice polytopes form a natural model of random lattice polytopes in which geometric features are determined by the structure of the underlying random graph. Focusing on the number of polytope edges and on the number of edges in unimodular triangulations, we derive asymptotic formulas for expectations and variances and prove quantitative central limit theorems in the relevant parameter regime. The analysis relies on explicit graph-theoretic descriptions of the corresponding edge sets and on the discrete Malliavin--Stein method for normal approximation.

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.

Referee Report

1 major / 0 minor

Summary. The manuscript studies cosmological polytopes induced by Erdős–Rényi random graphs in a high-dimensional regime. It derives asymptotic formulas for the expectations and variances of the number of polytope edges and the number of edges in unimodular triangulations, and establishes quantitative central limit theorems for these quantities, relying on explicit graph-theoretic descriptions of the edge sets together with the discrete Malliavin–Stein method.

Significance. If the graph-theoretic descriptions are fully explicit and the discrete Malliavin–Stein method applies directly without unaccounted error terms, the results would advance the probabilistic study of random lattice polytopes by supplying limit theorems for geometrically meaningful statistics determined by the underlying random graph. The quantitative nature of the CLTs and the focus on both raw polytope edges and triangulation edges constitute a clear contribution to high-dimensional combinatorial geometry.

major comments (1)
  1. The central claim requires that the discrete Malliavin–Stein method applies directly to the edge-count statistic arising from unimodular triangulations. The dependency neighborhoods of the associated indicator variables may grow with dimension or with the number of simplices; if this growth is not controlled, the Stein-equation remainder terms could exceed the stated quantitative bounds. The manuscript must supply the explicit construction of the dependency graph and the resulting neighborhood-size bounds for the triangulation edge count.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their careful reading of the manuscript and for the constructive feedback. We address the single major comment point by point below. The graph-theoretic descriptions in the paper allow us to control the dependencies explicitly, and we will strengthen the presentation accordingly.

read point-by-point responses

  1. Referee: The central claim requires that the discrete Malliavin–Stein method applies directly to the edge-count statistic arising from unimodular triangulations. The dependency neighborhoods of the associated indicator variables may grow with dimension or with the number of simplices; if this growth is not controlled, the Stein-equation remainder terms could exceed the stated quantitative bounds. The manuscript must supply the explicit construction of the dependency graph and the resulting neighborhood-size bounds for the triangulation edge count.

    Authors: We agree that an explicit construction of the dependency graph is necessary for a fully rigorous application of the discrete Malliavin–Stein method to the triangulation-edge statistic. Sections 3 and 4 of the manuscript already give combinatorial descriptions of the relevant edge sets in terms of the underlying Erdős–Rényi graph G(n,p). For the triangulation edges, each indicator is indexed by a pair of simplices that can form an edge in a unimodular triangulation; two such indicators are dependent precisely when the corresponding simplices share a vertex or an edge in G. This yields a dependency graph whose maximum degree is bounded by O(n) in the high-dimensional regime under consideration (where the expected number of simplices per vertex remains controlled). The resulting neighborhood-size bounds are therefore of the same order as those already used for the raw polytope-edge count, ensuring that the Stein-equation remainders stay within the stated quantitative error terms. To address the referee’s request directly, we will add a new subsection (provisionally 4.3) that spells out this dependency-graph construction together with the explicit degree bounds and verifies that they suffice for the Malliavin–Stein estimates. revision: yes

Circularity Check

0 steps flagged

No circularity: external method applied to explicitly described graph statistics

full rationale

The paper derives asymptotic formulas and quantitative CLTs for edge counts in cosmological polytopes and their unimodular triangulations by first obtaining explicit graph-theoretic descriptions of the relevant edge sets from the underlying Erdős–Rényi random graph, then directly applying the discrete Malliavin–Stein method. Both steps rely on external combinatorial constructions and an established approximation technique whose validity is independent of the target statistics; no parameter is fitted to the output quantities, no self-citation supplies a load-bearing uniqueness result, and no definition is introduced in terms of the claimed limit theorems. The derivation chain therefore remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review; the central claim rests on the applicability of the discrete Malliavin–Stein method and the existence of explicit edge-set descriptions, both treated as domain assumptions rather than derived inside the paper.

axioms (1)
  • domain assumption Discrete Malliavin–Stein method yields quantitative normal approximation for the edge-count statistics once explicit graph descriptions are available
    Invoked in the abstract as the tool for the CLT proofs.

pith-pipeline@v0.9.0 · 5637 in / 1231 out tokens · 38146 ms · 2026-05-25T04:08:26.934111+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

13 extracted references · 6 canonical work pages · 2 internal anchors

  1. [1]

    Cosmological Polytopes and the Wavefunction of the Universe

    Nima Arkani-Hamed, Paolo Benincasa, and Alexander Postnikov. Cosmological polytopes and the wavefunction of the universe, 2017.arXiv:1709.02813 [hep-th]

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  2. [2]

    Cosmological polytopes and the wavefunction of the universe for light states, 2019.arXiv:1909.02517 [hep-th]

    Paolo Benincasa. Cosmological polytopes and the wavefunction of the universe for light states, 2019.arXiv:1909.02517 [hep-th]. 18

    work page arXiv 2019

  3. [3]

    Good Triangulations of Cosmological Polytopes

    Aenne Benjes, Kamillo Ferry, and Benjamin Schröter. Good triangulations of cosmological polytopes, 2025.arXiv:2503.13393 [math.CO]

    work page internal anchor Pith review Pith/arXiv arXiv 2025

  4. [4]

    On cosmological polytopes, their canonical forms and their duals, 2026.arXiv:2603.03894 [math.CO]

    Anna Birkemeyer, Torben Donzelmann, Mieke Fink, and Martina Juhnke. On cosmological polytopes, their canonical forms and their duals, 2026.arXiv:2603.03894 [math.CO]

    work page arXiv 2026

  5. [5]

    Ehrhart theory of cosmological polytopes, 2024.arXiv:2412.01602 [math.CO]

    Justus Bruckamp, Lina Goltermann, Martina Juhnke, Erik Landin, and Liam Solus. Ehrhart theory of cosmological polytopes, 2024.arXiv:2412.01602 [math.CO]

    work page arXiv 2024

  6. [6]

    Central limit theorems for high dimensional lattice polytopes: symmetric edge polytopes, 2026

    Torben Donzelmann, Martina Juhnke, Benedikt Rednoß, and Christoph Thäle. Central limit theorems for high dimensional lattice polytopes: symmetric edge polytopes, 2026. arXiv:2603.10650 [math.CO]

    work page arXiv 2026

  7. [7]

    A simplified second-order Gaussian Poincaré inequality in discrete setting with applications.Ann

    Peter Eichelsbacher, Benedikt Rednoß, Christoph Thäle, and Guangqu Zheng. A simplified second-order Gaussian Poincaré inequality in discrete setting with applications.Ann. Inst. Henri Poincaré B, 59(1):271–302, 2023

    2023

  8. [8]

    Examples and counterexamples in Ehrhart theory

    Luisa Ferroni and Akihiro Higashitani. Examples and counterexamples in Ehrhart theory. EMS Surveys in Mathematical Sciences, 2023

    2023

  9. [9]

    Institute of Mathematical Statistics Textbooks

    Geoffrey Grimmett.Probability on Graphs: Random Processes on Graphs and Lattices. Institute of Mathematical Statistics Textbooks. Cambridge University Press, Cambridge, 2010

    2010

  10. [10]

    Oxford University Press, Oxford, 2001

    Geoffrey Grimmett and David Stirzaker.One Thousand Exercises in Probability. Oxford University Press, Oxford, 2001

    2001

  11. [11]

    Triangulations of cosmological poly- topes.Algebr

    Martina Juhnke, Liam Solus, and Lorenzo Venturello. Triangulations of cosmological poly- topes.Algebr. Comb., 8(4):1141–1168, 2025

    2025

  12. [12]

    Facesofcosmologicalpolytopes.Ann

    LukasKühneandLeonidMonin. Facesofcosmologicalpolytopes.Ann. Inst. Henri Poincaré D, 12(3):445–461, 2025

    2025

  13. [13]

    Stochastic analysis of Bernoulli processes.Probab

    Nicolas Privault. Stochastic analysis of Bernoulli processes.Probab. Surv., 5:435–483, 2008. 19

    2008