Random generation of essential directed acyclic graphs

DOI10.13137/2464-8728/33308MaRDI QIDQ5087784zbMATH OpenFDO

Authors Romeo Rizzi, Alexandru I. Tomescu

Publication date 1 July 2022

zbMATH Keywords

samplingdirected acyclic graphcounting recurrence

Mathematics Subject Classification ID

Bayesian inference (62F15) Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30)

Recommendations

• Random Generation of Directed Acyclic Graphs
• Uniform random generation of large acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• Some results about essential graphs
• Efficient coding of labeled directed acyclic graphs

Cites work

• scientific article; zbMATH DE number 3348134 (Why is no real title available?)
• scientific article; zbMATH DE number 3409391 (Why is no real title available?)
• scientific article; zbMATH DE number 3419161 (Why is no real title available?)
• A characterization of Markov equivalence classes for acyclic digraphs
• Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
• Asymptotic enumeration of extensional acyclic digraphs
• Counting extensional acyclic digraphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• On sets and graphs. Perspectives on logic and combinatorics
• The Number of Full Sets with n Elements
• The asymptotic number of acyclic digraphs. I
• The asymptotic number of acyclic digraphs. II
• Uniform random generation of large acyclic digraphs

Cited in

(10)

• Asymptotic behaviour of essential graphs
• Random Generation of Directed Acyclic Graphs
• Telling stories: enumerating maximal directed acyclic graphs with a constrained set of sources and targets
• Uniform random generation of large acyclic digraphs
• Efficient coding of labeled directed acyclic graphs
• Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
• A Family of Tree-Based Generators for Bubbles in Directed Graphs
• scientific article; zbMATH DE number 2044702 (Why is no real title available?)
• Some results about essential graphs
• Generating connected acyclic digraphs uniformly at random

This page was built for publication: Random generation of essential directed acyclic graphs

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