Construction Methods for Gaussoids

Abstract

The number of $n$-gaussoids is shown to be a double exponential function in $n$. The necessary bounds are achieved by studying construction methods for gaussoids that rely on prescribing $3$-minors and encoding the resulting combinatorial constraints in a suitable transitive graph. Various special classes of gaussoids arise from restricting the allowed $3$-minors.

18 pages, 3 figures, 1 table; corrected Remark 3.13 and minor changes

Cited by in corpus (2)

• Gaussoids are two-antecedental approximations of Gaussian conditional independence structures
• The geometry of Gaussian double Markovian distributions