checkMatchingCriterion: Check Matching Criterion

In SEMID: Identifiability of Linear Structural Equation Models

Check Matching Criterion

Description

for a latent node h, find a single observed node v and two sets of observed nodes W and U so that the tuple satisfies the matching criterion

Usage

checkMatchingCriterion(
  flowGraphAdjMatrix,
  adjMatrix,
  h,
  latentNodes,
  observedNodes,
  maxCard = length(observedNodes)
)

Arguments

flowGraphAdjMatrix	matrix representing the basis flow graph for any latent node h
adjMatrix	of the graph
h	latent node for which a tuple satisfying the criterion is sought
latentNodes	set of latent nodes
observedNodes	set of observed nodes
maxCard	maximum size of set W

Value

a list consisting of a Boolean, whether the graph is sign-identifiable and if yes, a list consisting of the sets

References

Sturma, N., Kranzlmüller, M., Portakal, I., and Drton, M. (2025) Matching Criterion for Identifiability in Sparse Factor Analysis. arXiv:2502.02986

SEMID documentation built on Jan. 30, 2026, 9:06 a.m.