1 citations · 1 across the 5 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.CY2019
Recombination: A family of Markov chains for redistricting
Daryl DeFord, Moon Duchin, Justin Solomon
Redistricting is the problem of partitioning a set of geographical units into a fixed number of districts, subject to a list of often-vague rules and priorities. In recent years, t…
cs.CC2019
Complexity and Geometry of Sampling Connected Graph Partitions
Elle Najt, Daryl DeFord, Justin Solomon
In this paper, we prove intractability results about sampling from the set of partitions of a planar graph into connected components. Our proofs are motivated by a technique introd…
math.RT2019
On the Spectrum of Finite, Rooted Homogeneous Trees
Daryl R. DeFord, Daniel N. Rockmore
In this paper we study the adjacency spectrum of families of finite rooted trees with regular branching properties. In particular, we show that in the case of constant branching, t…