Acyclic Directed Graphs to Represent Conditional Independence Models

DOI10.1007/978-3-642-02906-6_46zbMATH Open1203.68120OpenAlexW154881038MaRDI QIDQ3638176FDOQ3638176

Authors: Marco Baioletti, Giuseppe Busanello, Barbara Vantaggi 

Publication date: 2 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02906-6_46

Recommendations

• The infinity norm bound for the inverse of nonsingular diagonal dominant matrices
• New upper bounds for the infinity norm of inverse matrices of strictly diagonally dominant \(M\)-matrices
• Estimation on upper bounds for the infinity norms of inverses of strictly diagonally dominant M-matrices
• New upper bounds for \(\|A^{-1}\|_{\infty}\) of strictly diagonally dominant \(M\)-matrices
• Some new upper bounds for the infinity norm of the inverse matrix of a strictly diagonally dominant \(M\)-matrix

zbMATH Keywords

Perfect mapAcyclic directed graphsConditional independence modelsGraphoid propertiesInferential rules

Mathematics Subject Classification ID

Measures of association (correlation, canonical correlation, etc.) (62H20) Graph theory (including graph drawing) in computer science (68R10) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Stochastic independence in a coherent setting
• Semigraphoids and structures of probabilistic conditional independence
• On chain graph models for description of conditional independence structures
• Conditional independence in a coherent finite setting
• Conditional independence structure and its closure: inferential rules and algorithms

Cited In (16)

• Title not available (Why is that?)
• REPRESENTING CONDITIONAL INDEPENDENCE RELATIONS BY VALUATION NETWORKS
• Comparison of infinity norms of matrix inverses
• Sparse directed acyclic graphs incorporating the covariates
• CONDITIONAL INDEPENDENCE STRUCTURES AND GRAPHICAL MODELS
• Exploiting independencies to compute semigraphoid and graphoid structures
• Signed Directed Acyclic Graphs for Causal Inference
• On the relation between conditional independence models determined by finite distributive lattices and by directed acyclic graphs
• Acyclic directed graphs representing independence models
• THE REPRESENTATION POWER OF PROBABILISTIC KNOWLEDGE BY UNDIRECTED GRAPHS AND DIRECTED ACYCLIC GRAPHS: A COMPARISON
• An algorithm to find a perfect map for graphoid structures
• A heuristic procedure for finding hidden variables
• Finding P-maps and I-maps to represent conditional independencies
• Matrix representations and independencies in directed acyclic graphs
• Parsimonious graphical dependence models constructed from vines
• Title not available (Why is that?)

This page was built for publication: Acyclic Directed Graphs to Represent Conditional Independence Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638176)