erdos_renyi_half
def
For a natural number n, erdos_renyi_half n is the MeasureTheory.Measure on SimpleGraph (Fin n) given by SimpleGraph.binomialRandom (Fin n) with edge probability parameter 1/2.
Statement
noncomputable def erdos_renyi_half (n : ℕ) : MeasureTheory.Measure (SimpleGraph (Fin n))
- Defined in
- Erdős and Rényi (1959), On Random Graphs I; Mathlib.Probability.Combinatorics.BinomialRandomGraph.Defs
- Verified
- 16 Nov 2026
- Axioms
- none listed
- Used by 1
- op_1734_random_ising_magic_oneThe expected value of random_ising_graph_magic 1 with respect to the Erdős-Rényi measure erdos_renyi_half 1 equals 2.
Read back from the Lean
Definition: For any natural number n, erdos_renyi_half n is defined as the binomial random graph measure (the Erdős–Rényi model G(n, 1/2)) on simple graphs with vertex set Fin n, with edge probability parameter 1/2.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The Erdős-Rényi G(n, 1/2) probability measure on simple graphs on Fin n. -/ noncomputable def erdos_renyi_half (n : ℕ) : MeasureTheory.Measure (SimpleGraph (Fin n)) := SimpleGraph.binomialRandom (Fin n) ⟨1 / 2, by norm_num⟩