Pages that link to "Item:Q1431212"
From MaRDI portal
The following pages link to A geometric interpretation of the Metropolis-Hastings algorithm. (Q1431212):
Displaying 17 items.
- Potential induced random teleportation on finite graphs (Q493692) (← links)
- Micro-local analysis for the Metropolis algorithm (Q1024207) (← links)
- Honest exploration of intractable probability distributions via Markov chain Monte Carlo. (Q1431211) (← links)
- Ordering and improving the performance of Monte Carlo Markov chains. (Q1431213) (← links)
- Safe Metropolis-Hastings algorithm and its application to swarm control (Q1697161) (← links)
- Algorithms for improving efficiency of discrete Markov chains (Q1745667) (← links)
- On hitting time, mixing time and geometric interpretations of Metropolis-Hastings reversiblizations (Q2181629) (← links)
- Stationarity preserving and efficiency increasing probability mass transfers made possible (Q2463660) (← links)
- Markov Chain Approach to Probabilistic Guidance for Swarms of Autonomous Agents (Q2813952) (← links)
- The Markov chain Monte Carlo revolution (Q3623558) (← links)
- Analytic-geometric methods for finite Markov chains with applications to quasi-stationarity (Q5140270) (← links)
- Understanding the Hastings Algorithm (Q5252830) (← links)
- Measuring Segregation via Analysis on Graphs (Q5885803) (← links)
- Optimal scaling of MCMC beyond Metropolis (Q6159395) (← links)
- Mixing of Metropolis-adjusted Markov chains via couplings: the high acceptance regime (Q6595705) (← links)
- Density regulation of large-scale robotic swarm using robust model predictive mean-field control (Q6605977) (← links)
- Assigning stationary distributions to sparse stochastic matrices (Q6641768) (← links)