1 citations · 1 across the 4 of their papers we have counts for
5 papers
Optimal detection of geometry in random graphs and kernel matrices at critical thresholds
Cheng Mao, Timothy L. H. Wee
Detection of geometry in random graphs and matrices has been extensively studied in recent years. For testing a dense random geometric graph on vertices with latent points in d…
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 is constructed by first sampling latent points independently and uniformly from the -dimensional unit sphere, the…
Cluster expansion of the log-likelihood ratio: Optimal detection of planted matchings
Timothy L. H. Wee, Cheng Mao
To understand how hidden information can be extracted from statistical networks, planted models in random graphs have been the focus of intensive study in recent years. In this wor…
Impossibility of latent inner product recovery via rate distortion
Cheng Mao, Shenduo Zhang
In this largely expository note, we present an impossibility result for inner product recovery in a random geometric graph or latent space model using the rate-distortion theory. M…
Information-Theoretic Thresholds for Planted Dense Cycles
Cheng Mao, Alexander S. Wein, Shenduo Zhang
We study a random graph model for small-world networks which are ubiquitous in social and biological sciences. In this model, a dense cycle of expected bandwidth , representin…