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 2026 · math.PRShow all

2 papers · 2 filters

math.PR2026

Sharp detection thresholds for random geometric graphs with polynomial average degrees

Hang Du, Cheng Mao, Nike Sun +2

We study the random geometric graph formed by connecting $n$ independent uniform points on $S^{d - 1}$ whenever their inner product exceeds a threshold chosen to give edge de…

math.PR2026

Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d > n$ Regime

Hang Du, Cheng Mao, Nike Sun +2

A random geometric graph (RGG) is generated by first sampling latent points $x_{1}, \dots, x_{n}$ independently and uniformly from the unit sphere in $R^{d}$ , and then connecting…

Sharp detection thresholds for random geometric graphs with polynomial average degrees

Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the d>n Regime

Resolution of the Detection Threshold Conjecture for Random Geometric Graphs in the $d > n$ Regime