Equation (19) parameters and real degree bounds
DefinitionLocalOccupancyIS_Glauber_Supplement_MadParametersgraph-theoryindependent-setsp2o-batch-stoc27sp2o-gran-per-chapterp2o-plan-paperp2o-v1probability
For a finite graph, a real degree upper bound means for every vertex; triangle freeness excludes every three-edge triangle. For , and , write and define
Here is the published principal Lambert function on nonnegative inputs. These are computed parameters, separate from the main-text biclique-density parameters. The published predicate is exactly the source's local maximum-average-degree bound, including empty induced neighborhoods.
Definition code
import Definitions.Def_LocalOccupancyIS_Glauber_Parameters
namespace LocalOccupancyIS.Glauber.Supplement
noncomputable section
/-- A real upper bound; no regularity or minimum-degree restriction. -/
def RealDegreeBound {V : Type} [Fintype V] (G : SimpleGraph V)
[DecidableRel G.Adj] (Δ : ℝ) : Prop := ∀ v, (G.degree v : ℝ) ≤ Δ
def TriangleFree {V : Type} (G : SimpleGraph V) : Prop :=
∀ u v w, ¬ (G.Adj u v ∧ G.Adj v w ∧ G.Adj w u)
/-- Equation (19), distinct from the biclique-density parameter choice. -/
def madW (Δ a lam : ℝ) : ℝ :=
RiskBalancingMNL.lambertW (Δ * (1+lam)^a * Real.log (1+lam))
def madBeta (Δ a lam : ℝ) : ℝ :=
Real.exp (madW Δ a lam) / (p lam * (1 + madW Δ a lam))
def madGamma (Δ a lam : ℝ) : ℝ :=
(1+lam)^a * Real.log (1+lam) / (p lam * (1 + madW Δ a lam))
end
end LocalOccupancyIS.Glauber.Supplement
Source
Ewan Davies, Brian Tan, STOC 2027 submission #982 (October 2026), p.15, equations (19)–(20) and §5 definitions