TY - JOUR AU - Eid, Abdelrahman Munther AU - Mamitsuka, Hiroshi AU - Wicker, Nicolas PY - 2019/07/25 Y2 - 2024/03/19 TI - A Metropolis-Hastings Sampling of Subtrees in Graphs JF - Austrian Journal of Statistics JA - AJS VL - 48 IS - 5 SE - Articles DO - 10.17713/ajs.v48i5.880 UR - https://ajs.or.at/index.php/ajs/article/view/880 SP - 17-33 AB - <p>This article presents two methods to sample uniform subtrees from graphs using Metropolis-Hastings algorithms. One method is an independent Metropolis-Hastings and the other one is a type of add-and-delete MCMC.</p><p>In addition to the theoretical contributions, we present simulation studies which confirm the theoretical convergence results on our methods by monitoring the convergence of our Markov chains to the equilibrium distribution.</p> ER -