arXiv (OAI Expanded)
open access
The Marked Edge Walk: A Novel MCMC Algorithm for Sampling of Graph Partitions
Novel Markov Chain Monte Carlo (MCMC) methods have enabled the generation of large ensembles of redistricting plans modeled as a graph partitioning problem. However, existing algorithms such as Reversible Recombination (RevReCom) and Metropolized Forest Recombination (MFR) have strong preferences fo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Graph-Based Stochastic Power-UCT: Monte-Carlo Graph Search with Power Mean Estimation#1033738
- Distributed Lower Bounds via Automatic Self-Reduction#1129011
- Distributed Lower Bounds via Automatic Self-Reduction#1108707
- Polynomial-time algorithms for Path Cover and Path Partition on trees and graphs of bounded treewidth#677074
- Lighthouse RL: Sample-Efficient Circuit Optimization via Strategic Reset Points#370320
Record · ID 1109770
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive