Constrained Monte Carlo Markov Chains on Graphs
arXiv:1907.00779
Abstract
This paper presents a novel theoretical Monte Carlo Markov chain procedure in the framework of graphs. It specifically deals with the construction of a Markov chain whose empirical distribution converges to a given reference one. The Markov chain is constrained over an underlying graph, so that states are viewed as vertices and the transition between two states can have positive probability only in presence of an edge connecting them. The analysis is carried out on the basis of the relationship between the support of the target distribution and the connectedness of the graph.
arXiv comment15 pages, no figures. arXiv admin note: substantial text overlap with arXiv:1803.01738
References in corpus (5)
- MCMC using Hamiltonian dynamics
- Tunneling and Metastability of continuous time Markov chains
- Some things we've learned (about Markov chain Monte Carlo)
- Metastable Markov chains: from the convergence of the trace to the convergence of the finite-dimensional distributions
- Developments in perfect simulation of Gibbs measures through a new result for the extinction of Galton-Watson-like processes