graph_idle_transport_plan_main
def
The main transport plan at idleness 1/2: with β = (1/2)/d_x, γ = (1/2)/d_y, π(u,v) = γ·[u=x][v=x] + ψ(u)[v=y] + γ[u=v][u∈C] + κ(u)·[v∈B]/|B|, where ψ(x) = 1/2 − β, ψ(y) = β, ψ = 0 elsewhere, and κ(u) = β − γ on {x} ∪ C and β on A, 0 elsewhere.
Statement
noncomputable def graph_idle_transport_plan_main {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (x y : V) (A B C : Finset V) : V → V → ℝ
- Source
- step towards exists_idle_measure_wasserstein_dist_lt_one_of_ediam_le_two_and_minDegree_ge
- Verified
- 17 Oct 2026
- Axioms
- none listed
- Used by 4
- exists_idle_measure_wasserstein_dist_lt_one_of_ediam_le_two_and_minDegree_geIn a connected graph of diameter at most 2 with minimum degree at least 2n/3 − 1, for every edge xy there exists α ∈ (0, 1) such that the…
- graph_idle_transport_plan_main_costFor an edge xy in a graph of diameter at most 2, the main plan from μ_x^{1/2} to μ_y^{1/2} costs at most 1/2 − (1/2)/d_x + 2|B|·(1/2)/d_y.
- graph_idle_transport_plan_main_marginalsWith β = (1/2)/d_x, γ = (1/2)/d_y and d_x ≤ d_y, A.card ≤ B.card, the main plan has nonnegative entries, row sums μ_x^{1/2} and column…
- graph_idle_wasserstein_lt_one_of_edge_partitionGiven the edge partition of a graph of diameter at most 2 whose minimum degree is at least 2n/3 − 1, the idleness-1/2 measures at the…
Lean source view module on GitHub
/-- Explicit transport plan between the idleness-1/2 measures at x and at y, built from the edge partition. -/ noncomputable def graph_idle_transport_plan_main {V : Type*} [Fintype V] [DecidableEq V] (G : SimpleGraph V) [DecidableRel G.Adj] (x y : V) (A B C : Finset V) : V → V → ℝ := fun u v => (if u = x ∧ v = x then (1/2)/(G.degree y : ℝ) else 0) + (if v = y then (if u = x then 1/2 - (1/2)/(G.degree x : ℝ) else if u = y then (1/2)/(G.degree x : ℝ) else 0) else 0) + (if u = v then (if u ∈ C then (1/2)/(G.degree y : ℝ) else 0) else 0) + (if v ∈ B then (if (u = x ∨ u ∈ C) then (1/2)/(G.degree x : ℝ) - (1/2)/(G.degree y : ℝ) else if u ∈ A then (1/2)/(G.degree x : ℝ) else 0) / (B.card : ℝ) else 0)