Irreducibility of recombination Markov chains in the triangular lattice

DOI10.1016/j.dam.2023.12.019arXiv2305.17239OpenAlexW4391074073MaRDI QIDQ6202939

Sarah M. Cannon

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Markov chainirreducibletriangular latticerecombinationgraph partitionmath of redistricting

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Planar graphs; geometric and topological aspects of graph theory (05C10) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Cites Work

• Unnamed Item
• Sequential Monte Carlo for Sampling Balanced and Compact Redistricting Plans
• Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions
• Voting Rights, Markov Chains, and Optimization by Short Bursts
• Markov Chain Algorithms for Planar Lattice Structures
• Assessing significance in a Markov chain without mixing
• Metropolized Multiscale Forest Recombination for Redistricting
• Explainer: Compactness, by the numbers
• Automated Redistricting Simulation Using Markov Chain Monte Carlo
• Political Geometry
• A Markov Chain Algorithm for Compression in Self-Organizing Particle Systems
• Reconfiguration of connected graph partitions via recombination
• Reconfiguration of connected graph partitions