A new notion of convexity in digraphs with an application to Bayesian networks

DOI10.1142/S1793830917500161MaRDI QIDQ5347248zbMATH OpenOpenAlexFDO

Authors Francesco M. Malvestuto

Publication date 23 May 2017

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s1793830917500161

zbMATH Keywords

Bayesian networksdigraphsconvexityMarkov properties

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Axiomatic and generalized convexity (52A01)

Recommendations

• scientific article; zbMATH DE number 4085678
• Convex sets in acyclic digraphs
• Canonical and monophonic convexities in hypergraphs
• Convexity in Graphs and Hypergraphs
• Algorithms for generating convex sets in acyclic digraphs

Cites work

• scientific article; zbMATH DE number 439012 (Why is no real title available?)
• scientific article; zbMATH DE number 3823168 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 3724452 (Why is no real title available?)
• scientific article; zbMATH DE number 48812 (Why is no real title available?)
• scientific article; zbMATH DE number 1134987 (Why is no real title available?)
• Artificial life and computational intelligence. Second Australasian conference, ACALCI 2016, Canberra, ACT, Australia, February 2--5, 2016. Proceedings
• Canonical and monophonic convexities in hypergraphs
• Causality. Models, reasoning, and inference
• Closure lattices
• Closure spaces that are not uniquely generated
• Closure systems and their structure
• Computing simple-path convex hulls in hypergraphs
• Convexity in Graphs and Hypergraphs
• Convexity in directed graphs
• Decomposability of abstract and path-induced convexities in hypergraphs
• Equivalence between hypergraph convexities
• Geodesic Convexity in Graphs
• Identifying independence in bayesian networks
• Independence properties of directed markov fields
• Probabilistic graphical models.
• Pruning processes and a new characterization of convex geometries
• The hull number of a graph
• The role of continuous processes in cognitive development
• The theory of convex geometries

Cited in

(2)

• Submodular functions and rooted trees
• Algorithms for convex hull finding in undirected graphical models

This page was built for publication: A new notion of convexity in digraphs with an application to Bayesian networks

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