3 problems

Let $G(n,n)$ be the $n\times n$ grid graph, and let $\mathcal{M}(G(n,n),3)$ be the metagraph whose vertices are partitions of $G(n,n)$ into three connected subgraphs of equal size,…

Let $P$ be the target measure on spanning forests and linking edges. A state has the form $S=(T,L)$, where $T$ is a multi-scale hierarchical forest and $L$ is a linking edge set; p…

A redistricting plan is a state in an ensemble generated by a Markov chain, and tree-based methods make relatively global changes to the plan. By contrast, moving-boundary and sing…