Jiaming Xu

activity

20142026

most citedAchieving Exact Cluster Recovery Threshold via Semidefinite Programming: Extensions

38 citations · 248 across the 24 of their papers we have counts for

collaborators

Showing math.PRShow all

3 papers · 1 filter

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…

math.PR2026

Random geometric graphs with smooth kernels: sharp detection threshold and a spectral conjecture

Cheng Mao, Yihong Wu, Jiaming Xu

A random geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_{1}, \dots, x_{n}$ independently and uniformly from the $d$ -dimensional unit sphere, the…

math.PR2019★ 21 cited

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

Zhou Fan, Cheng Mao, Yihong Wu +1

We analyze a new spectral graph matching algorithm, GRAph Matching by Pairwise eigen-Alignments (GRAMPA), for recovering the latent vertex correspondence between two unlabeled, edg…

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

Random geometric graphs with smooth kernels: sharp detection threshold and a spectral conjecture

Spectral Graph Matching and Regularized Quadratic Relaxations II: Erdős-Rényi Graphs and Universality

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