57 citations · 177 across the 20 of their papers we have counts for
24 papers
Hamilton cycles in a semi-random graph model
Alan Frieze, Gregory B. Sorkin
We show that with high probability we can build a Hamilton cycle after at most rounds in a particular semi-random model. In this model, in one round, we are given a {unifo…
Snakes and Ladders and Intransitivity, or what mathematicians do in their time off
Gregory B. Sorkin
This recreational mathematics article shows that the game of Snakes and Ladders is intransitive: square 69 has a winning edge over 79, which in turn beats 73, which beats 69. Analy…
The Ising antiferromagnet and max cut on random regular graphs
Amin Coja-Oghlan, Philipp Loick, Balázs F. Mezei +1
The Ising antiferromagnet is an important statistical physics model with close connections to the {\sc Max Cut} problem. Combining spatial mixing arguments with the method of momen…
Successive shortest paths in complete graphs with random edge weights
Stefanie Gerke, Balázs F. Mezei, Gregory B. Sorkin
Consider a complete graph with edge weights drawn independently from a uniform distribution . The weight of the shortest (minimum-weight) path between two given…
Minimum-weight combinatorial structures under random cost-constraints
Alan Frieze, Wesley Pegden, Gregory Sorkin +1
Recall that Janson showed that if the edges of the complete graph are assigned exponentially distributed independent random weights, then the expected length of a shortest pa…
Successive minimum spanning trees
Svante Janson, Gregory B. Sorkin
In a complete graph with edge weights drawn independently from a uniform distribution (or alternatively an exponential distribution ), let $T_…