Constrained Monte Carlo Markov Chains on Graphs

06/28/2019

∙

by   Roy Cerqueti, et al.

∙

University of Macerata

∙

Sapienza University of Rome

∙

0

∙

share

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.