This paper presents a 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 the presence of an edge connecting them. The analysis focuses on the relevant case of support of the target distribution not connected in the graph. Some general arguments on the speed of convergence are also carried out.

Monte Carlo Markov chains constrained on graphs for a target with disconnected support∗

Cerqueti R.;De Santis E.
2022

Abstract

This paper presents a 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 the presence of an edge connecting them. The analysis focuses on the relevant case of support of the target distribution not connected in the graph. Some general arguments on the speed of convergence are also carried out.
File allegati a questo prodotto
File Dimensione Formato  
MCMC-CerDeS.pdf

accesso aperto

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Creative commons
Dimensione 261.53 kB
Formato Adobe PDF
261.53 kB Adobe PDF Visualizza/Apri PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11573/1652498
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact