Monte Carlo Markov chains constrained on graphs for a target with disconnected support (Q2168087)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Monte Carlo Markov chains constrained on graphs for a target with disconnected support |
scientific article; zbMATH DE number 7578471
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Monte Carlo Markov chains constrained on graphs for a target with disconnected support |
scientific article; zbMATH DE number 7578471 |
Statements
Monte Carlo Markov chains constrained on graphs for a target with disconnected support (English)
0 references
31 August 2022
0 references
The article deals with the Monte Carlo Markov chain problem on a connected graph, where the target distribution has not connected support in the graph. In particular, some Markov chains are constructed whose empirical distributions converge to such a target distribution as time tends to infinity. At the same time, the rate of convergence is also discussed.
0 references
Markov chain Monte Carlo
0 references
graphs
0 references
convergence of probability distributions
0 references
0 references
0 references
0.7213987112045288
0 references
0.7210108637809753
0 references
0.7188116908073425
0 references
