nonadaptive_mst_expected_cost
The expected query cost of a non-adaptive querying order π on a finite graph G with decidable adjacency and edge probabilities p is the sum over all binary edge realizations α of the product Bernoulli probability of α times the stopping time of π on α.
Statement
noncomputable def nonadaptive_mst_expected_cost {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : G.edgeSet → ℝ) (π : List G.edgeSet) : ℝ
- Defined in
- arXiv:2610.40844 Sec. 6.3
- Verified
- 07 Nov 2026
- Axioms
- none listed
- Built on 2
- realization_probGiven a simple graph G with finite edge set and edge probabilities p : G.edgeSet → ℝ, the probability of a binary edge weight realization…
- nonadaptive_mst_stopping_timeGiven a simple graph G, a querying order π : List G.edgeSet, and a realization α : G.edgeSet → Bool, the stopping time is the minimum…
- Used by 1
- nonadaptive_mst_opt_costThe optimal non-adaptive expected query cost on a finite graph G with decidable adjacency and edge probabilities p is the infimum of the…
Read back from the Lean
For a finite type V with decidable equality, a simple graph G on V with decidable adjacency, an edge weight/probability function p : G.edgeSet → ℝ, and an edge ordering list π : List G.edgeSet, nonadaptive_mst_expected_cost G p π is the real number defined as the sum over all edge realizations α : G.edgeSet → Bool of the product of realization_prob G p α and the stopping time nonadaptive_mst_stopping_time G π α (cast to ℝ).
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 expected query cost of a non-adaptive querying order π under edge probabilities p. -/ noncomputable def nonadaptive_mst_expected_cost {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (p : G.edgeSet → ℝ) (π : List G.edgeSet) : ℝ := ∑ α : G.edgeSet → Bool, (realization_prob G p α) * (nonadaptive_mst_stopping_time G π α : ℝ)