1 citations · 1 across the 1 of their papers we have counts for
3 papers
math.PR2018
Limit shapes for the asymmetric five vertex model
Jan de Gier, Richard Kenyon, Samuel S. Watson
We compute the free energy and surface tension function for the five-vertex model, a model of non-intersecting monotone lattice paths on the grid in which each corner gets a positi…
math.PR2017
Schnyder woods, SLE(16), and Liouville quantum gravity
Yiting Li, Xin Sun, Samuel S. Watson
In 1990, Schnyder used a 3-spanning-tree decomposition of a simple triangulation, now known as the Schnyder wood, to give a fundamental grid-embedding algorithm for planar maps. In…
math.CO2008★ 1 cited
A Computation of the Expected Number of Posts in a Finite Random Graph Order
Luca Bombelli, Itai Seggev, Sam Watson
A random graph order is a partial order achieved by independently sprinkling relations on a vertex set (each with probability ) and adding relations to satisfy the requirement o…