A Metropolis-Hastings Sampling of Subtrees in Graphs
- Publication Type
- Original research
- Authors
- Fulltext
- Download
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.
In addition to the theoretical contributions, we present simulation studies which con-
firm the theoretical convergence results on our methods by monitoring the convergence of
our Markov chains to the equilibrium distribution
Journal
- Title
- Austrian Journal of Statistics
- Publisher
- the Austrian Statistical Society
- Publisher Country
- Austria
- Indexing
- Scopus
- Impact Factor
- None
- Publication Type
- Both (Printed and Online)
- Volume
- --
- Year
- 2019
- Pages
- --