374 citations · 2.2k across the 47 of their papers we have counts for
3 papers · 1 filter
Combinatorics of Tripartite Boundary Connections for Trees and Dimers
Richard W. Kenyon, David B. Wilson
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural p…
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
Omer Angel, Abraham D. Flaxman, David B. Wilson
In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)…
Chip-Firing and Rotor-Routing on Directed Graphs
Alexander E. Holroyd, Lionel Levine, Karola Meszaros +3
We give a rigorous and self-contained survey of the abelian sandpile model and rotor-router model on finite directed graphs, highlighting the connections between them. We present s…