@article{Eid_Mamitsuka_Wicker_2019, title={A Metropolis-Hastings Sampling of Subtrees in Graphs}, volume={48}, url={https://ajs.or.at/index.php/ajs/article/view/880}, DOI={10.17713/ajs.v48i5.880}, abstractNote={<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>}, number={5}, journal={Austrian Journal of Statistics}, author={Eid, Abdelrahman Munther and Mamitsuka, Hiroshi and Wicker, Nicolas}, year={2019}, month={Jul.}, pages={17–33} }