Explicit co-occurrence graph of factor variables
DefinitionStableMSR_Recovery_Supplement_ScopeGraphalgorithmsclustering
The finite graph has one vertex for each distinct input label and joins two distinct labels that occur in a common scope.
Definition code
import Definitions.Def_StableMSR_Recovery_Supplement_CliqueFactors
set_option autoImplicit false
namespace StableMSR.Recovery.Supplement.BinaryRecovery.Regional
def scopeGraph (vs : Block) (scopes : List Block) : SimpleGraph (↥vs.toFinset) where
Adj a b := a≠b ∧ ∃ u∈scopes,a.val∈u ∧ b.val∈u
symm := ⟨by
intro a b h
obtain ⟨diff,u,hu,ha,hb⟩ := h
exact ⟨diff.symm,u,hu,hb,ha⟩⟩
loopless := ⟨fun _ h => h.1 rfl⟩
end StableMSR.Recovery.Supplement.BinaryRecovery.Regional
Source
Standard primal graph for finite-domain factor optimization.