Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions

DOI10.48550/arXiv.1911.01503zbMath1522.65008arXiv1911.01503OpenAlexW3162705107WikidataQ122909260 ScholiaQ122909260MaRDI QIDQ58516

Eric Autrey, Daniel Carter, Jonathan C. Mattingly, Gregory Herschlag, Zach Hunter, Daniel Carter, Zach Hunter, Jonathan C. Mattingly, Eric A. Autry, Gregory Herschlag

Publication date: 28 October 2019

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Markov chain Monte CarloMetropolis-Hastingsspanning treesbalanced graph partitioning

Mathematics Subject Classification ID

Monte Carlo methods (65C05) History, political science (91F10) Models of societies, social and urban evolution (91D10) Mathematical geography and demography (91D20)

Related Items (3)

Spanning tree bounds for grid graphs ⋮ Irreducibility of recombination Markov chains in the triangular lattice ⋮ redist

Cites Work

• Graph partitioning models for parallel computing
• The average number of spanning trees in sparse graphs with given degrees
• Spatial clustering of average risks and risk trends in Bayesian disease mapping
• Partitioning graphs to speedup Dijkstra's algorithm
• Assessing significance in a Markov chain without mixing
• Graph Partitioning and Graph Clustering
• Metropolized Multiscale Forest Recombination for Redistricting
• Automated Redistricting Simulation Using Markov Chain Monte Carlo
• Crime in Philadelphia: Bayesian Clustering with Particle Optimization

This page was built for publication: Metropolized Forest Recombination for Monte Carlo Sampling of Graph Partitions