A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

DOI10.1007/s11222-020-09977-zzbMath1461.62016arXiv2007.11461OpenAlexW3119098317MaRDI QIDQ2029093

Yanyan Li

Publication date: 3 June 2021

Published in: Statistics and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.11461

zbMATH Keywords

Markov chain Monte Carloevolutionary algorithmsspatial partitioning

Mathematics Subject Classification ID

Computational methods in Markov chains (60J22) Computational methods for problems pertaining to statistics (62-08)

Related Items (2)

Redistricting optimization with recombination: a local search case study ⋮ Bayesian semiparametric joint model of multivariate longitudinal and survival data with dependent censoring

Uses Software

• Scatter Search

Cites Work

• Unnamed Item
• Unnamed Item
• Equi-energy sampler with applications in statistical inference and statistical mechanics
• Interacting multiple try algorithms with different proposal distributions
• Convergence of adaptive direction sampling
• Population Markov chain Monte Carlo
• Inference from iterative simulation using multiple sequences
• Real-Parameter Evolutionary Monte Carlo With Applications to Bayesian Mixture Models
• The Multiple-Try Method and Local Optimization in Metropolis Sampling
• Automated Redistricting Simulation Using Markov Chain Monte Carlo
• Equation of State Calculations by Fast Computing Machines
• Hit-and-Run Algorithms for Generating Multivariate Distributions
• Stochastic Approximation in Monte Carlo Computation
• Monte Carlo sampling methods using Markov chains and their applications

This page was built for publication: A parallel evolutionary multiple-try Metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions