Nike Sun

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 2013Show all

3 papers · 1 filter

math.PR2013★ 22 cited

Maximum independent sets on random regular graphs

Jian Ding, Allan Sly, Nike Sun

We determine the asymptotics of the independence number of the random $d$ -regular graph for all $d \geq d_{0}$ . It is highly concentrated, with constant-order fluctuations around $nα_…

math.PR2013

Satisfiability threshold for random regular NAE-SAT

Jian Ding, Allan Sly, Nike Sun

We consider the random regular $k$ -NAE-SAT problem with $n$ variables each appearing in exactly $d$ clauses. For all $k$ exceeding an absolute constant $k_{0}$ , we establish explicit…

math-ph2013★ 1 cited

On the asymptotics of dimers on tori

Richard W. Kenyon, Nike Sun, David B. Wilson

We study asymptotics of the dimer model on large toric graphs. Let $L$ be a weighted $Z^{2}$ -periodic planar graph, and let $Z^{2} E$ be a large-index sublatt…