Convex rank tests and semigraphoids
Convex rank tests are partitions of the symmetric group which have desirable geometric
properties. The statistical tests defined by such partitions involve counting all permutations in …
properties. The statistical tests defined by such partitions involve counting all permutations in …
The Gaussian conditional independence inference problem
T Boege - 2022 - repo.bibliothek.uni-halle.de
The present thesis deals with Gaussian conditional independence structures and their
inference problem. Conditional independence (CI) is a notion from statistics and information …
inference problem. Conditional independence (CI) is a notion from statistics and information …
[HTML][HTML] Self-adhesivity in lattices of abstract conditional independence models
We introduce an algebraic concept of the frame for abstract conditional independence (CI)
models, together with basic operations with respect to which such a frame should be closed …
models, together with basic operations with respect to which such a frame should be closed …
[HTML][HTML] On the conditional independence implication problem: A lattice-theoretic approach
Conditional independence is a crucial notion in the development of probabilistic systems
which are successfully employed in areas such as computer vision, computational biology …
which are successfully employed in areas such as computer vision, computational biology …
Generalized permutohedra from probabilistic graphical models
A graphical model encodes conditional independence relations via the Markov properties.
For an undirected graph these conditional independence relations can be represented by a …
For an undirected graph these conditional independence relations can be represented by a …
Challenging computations of Hilbert bases of cones associated with algebraic statistics
In this paper we present two independent computational proofs that the monoid derived from
5× 5× 3 contingency tables is normal, completing the classification by Hibi and Ohsugi. We …
5× 5× 3 contingency tables is normal, completing the classification by Hibi and Ohsugi. We …
Decompositions of binomial ideals
T Kahle - Annals of the institute of statistical mathematics, 2010 - Springer
We present Binomials, a package for the computer algebra system Macaulay 2, which
specializes well-known algorithms to binomial ideals. These come up frequently in algebraic …
specializes well-known algorithms to binomial ideals. These come up frequently in algebraic …
[PDF][PDF] Efficient algorithms for conditional independence inference
The topic of the paper is computer testing of (probabilistic) conditional independence (CI)
implications by an algebraic method of structural imsets. The basic idea is to transform (sets …
implications by an algebraic method of structural imsets. The basic idea is to transform (sets …
Towards standard imsets for maximal ancestral graphs
Towards standard imsets for maximal ancestral graphs Page 1 Bernoulli 30(3), 2024, 2026–2051
https://doi.org/10.3150/23-BEJ1663 Towards standard imsets for maximal ancestral graphs …
https://doi.org/10.3150/23-BEJ1663 Towards standard imsets for maximal ancestral graphs …
Conditional independence and basic Markov properties
M Studený - Handbook of Graphical Models, 2018 - taylorfrancis.com
This chapter examines the concept of conditional independence (CI) and provides an
overview of both former and results on the description of CI structures. The idea to use …
overview of both former and results on the description of CI structures. The idea to use …