Uniform random generation of large acyclic digraphs
From MaRDI portal
Publication:5962736
DOI10.1007/S11222-013-9428-YzbMATH Open1331.62150arXiv1202.6590OpenAlexW2109430278MaRDI QIDQ5962736FDOQ5962736
Publication date: 23 February 2016
Published in: Statistics and Computing (Search for Journal in Brave)
Abstract: Directed acyclic graphs are the basic representation of the structure underlying Bayesian networks, which represent multivariate probability distributions. In many practical applications, such as the reverse engineering of gene regulatory networks, not only the estimation of model parameters but the reconstruction of the structure itself is of great interest. As well as for the assessment of different structure learning algorithms in simulation studies, a uniform sample from the space of directed acyclic graphs is required to evaluate the prevalence of certain structural features. Here we analyse how to sample acyclic digraphs uniformly at random through recursive enumeration, an approach previously thought too computationally involved. Based on complexity considerations, we discuss in particular how the enumeration directly provides an exact method, which avoids the convergence issues of the alternative Markov chain methods and is actually computationally much faster. The limiting behaviour of the distribution of acyclic digraphs then allows us to sample arbitrarily large graphs. Building on the ideas of recursive enumeration based sampling we also introduce a novel hybrid Markov chain with much faster convergence than current alternatives while still being easy to adapt to various restrictions. Finally we discuss how to include such restrictions in the combinatorial enumeration and the new hybrid Markov chain method for efficient uniform sampling of the corresponding graphs.
Full work available at URL: https://arxiv.org/abs/1202.6590
Recommendations
Bayesian inference (62F15) Numerical analysis or methods applied to Markov chains (65C40) Directed graphs (digraphs), tournaments (05C20)
Cites Work
- The On-Line Encyclopedia of Integer Sequences
- Improving the structure MCMC sampler for Bayesian networks by introducing a new edge reversal move
- A characterization of Markov equivalence classes for acyclic digraphs
- Being Bayesian about network structure. A Bayesian approach to structure discovery in Bayesian networks
- Bayesian model averaging and model selection for markov equivalence classes of acyclic digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bayesian Graphical Models for Discrete Data
- Learning high-dimensional directed acyclic graphs with latent and selection variables
- Acyclic orientations of graphs
- Enumeration of labelled chain graphs and labelled essential directed acyclic graphs.
- Title not available (Why is that?)
- Finding a Minimum Circuit in a Graph
- The asymptotic number of acyclic digraphs. I
- The asymptotic number of acyclic digraphs. II
- On the Number of Maximal Vertices of a Random Acyclic Digraph
- Title not available (Why is that?)
- Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
- The size distribution for Markov equivalence classes of acyclic digraph models.
- Generating connected acyclic digraphs uniformly at random
- Random Generation of Directed Acyclic Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (6)
Uses Software
This page was built for publication: Uniform random generation of large acyclic digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5962736)
