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

DOI10.1142/S1793830917500161zbMATH Open1362.05054OpenAlexW2568521801MaRDI QIDQ5347248FDOQ5347248

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

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

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)

Cites Work

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

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)