1 citations · 1 across the 4 of their papers we have counts for
4 papers
Competitively Constructed Planar Graphs
Wesley Pegden, Eric Wang
We introduce and study two Maker-Breaker-like games for constructing planar graphs: the edge drawing game, where two players take turns drawing non-intersecting edges between point…
Sampling Tree-Weighted Partitions Without Sampling Trees
Sarah Cannon, Topher Pankow, Wesley Pegden +1
This paper gives a new algorithm for sampling tree-weighted partitions of a large class of planar graphs. Formally, the tree-weighted distribution on -partitions of a graph weig…
Youden's Demon is Sylvester's Problem
Florian Frick, Andrew Newman, Wesley Pegden
If four people with Gaussian-distributed heights stand at Gaussian positions on the plane, the probability that there are exactly two people whose height is above the average of th…
Sampling Balanced Forests of Grids in Polynomial Time
Sarah Cannon, Wesley Pegden, Jamie Tucker-Foltz
We prove that a polynomial fraction of the set of -component forests in the grid graph have equal numbers of vertices in each component, for any constant . This…