Uniform sampling of directed and undirected graphs conditional on vertex connectivity

DOI10.1016/j.endm.2016.05.005zbMath1347.05105OpenAlexW2514394128MaRDI QIDQ327621

Salem A. Alyami, Jonathan M. Keith, A. K. M. Azad

Publication date: 19 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2016.05.005

zbMATH Keywords

Bayesian networksMarkov chain Monte Carlosampling graph space

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Uses Software

• TETRAD

Cites Work

• Unnamed Item
• Unnamed Item
• Causation, prediction, and search
• Markov chains for exploring posterior distributions. (With discussion)
• Adaptive Rejection Metropolis Sampling within Gibbs Sampling
• Paths in graphs
• Equation of State Calculations by Fast Computing Machines
• Random Graphs
• Monte Carlo sampling methods using Markov chains and their applications