scientific article; zbMATH DE number 176091
From MaRDI portal
Publication:4035192
zbMATH Open0764.60002MaRDI QIDQ4035192FDOQ4035192
Authors: František Matúš
Publication date: 18 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
- Conditional independence structures examined via minors
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- DESCRIPTION OF STRUCTURES OF STOCHASTIC CONDITIONAL INDEPENDENCE BY MEANS OF FACES AND IMSETS 1st part: introduction and basic concepts1
- scientific article; zbMATH DE number 2150792
connectednessMarkov networksconditional probabilistic independencesprobabilistic representations of matroids
Cited In (20)
- Towards classification of semigraphoids.
- Generalized Permutohedra from Probabilistic Graphical Models
- On patterns of conditional independences and covariance signs among binary variables
- Logical and algorithmic properties of stable conditional independence
- Stochastic independence, algebraic independence and abstract connectedness
- Sound approximate reasoning about saturated conditional probabilistic independence under controlled uncertainty
- Conditional independence and natural conditional functions
- Matroid representations by partitions
- Contribution of František Matúš to the research on conditional independence.
- Characterisation of conditional independence structures for polymatroids using vanishing sets.
- Selfadhesivity in Gaussian conditional independence structures
- PROBABILISTIC CONDITIONAL INDEPENDENCE STRUCTURES AND MATROID THEORY: BACKGROUND1
- An axiomatization of matroids and oriented matroids as conditional independence models
- On conditional independence and log-convexity
- Self-adhesivity in lattices of abstract conditional independence models
- Poisson process approximation under stabilization and Palm coupling
- On Gaussian conditional independence structures
- Representing independence models with elementary triplets
- On finite exchangeability and conditional independence
- Two generalizations of the semi-graphoid rule of probabilistic independence and more
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035192)