activity
20092026
most citedThe computational hardness of counting in two-spin models on d-regular graphs

59 citations · 216 across the 22 of their papers we have counts for

collaborators
Showing 2010Show all

2 papers · 1 filter

math.PR2010

Central limit theorem for biased random walk on multi-type Galton-Watson trees

Amir Dembo, Nike Sun

Let T be a rooted supercritical multi-type Galton-Watson (MGW) tree with types coming from a finite alphabet, conditioned to non-extinction. The lambda-biased random walk (X_t, t>=…

math.PR2010★ 14 cited

Strong path convergence from Loewner driving function convergence

Scott Sheffield, Nike Sun

We show that, under mild assumptions on the limiting curve, a sequence of simple chordal planar curves converges uniformly whenever certain Loewner driving functions converge. We e…