A central limit theorem for an omnibus embedding of multiple random graphs and implications for multiscale network inference

By Keith D. Levin, Avanti Athreya, Minh Tang, Vince Lyzinski, Youngser Park, Carey E. Priebe. 2017

Subfields: Statistics and Probability, Network Science & Complex Systems

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Statistics and Probability

1. Hayden S. Helm
2. Carey E. Priebe
3. Brandon Duderstadt
4. Youngser Park

Citations in the corpus

• Comparing Foundation Models using Data Kernels (2023, background): “When A ( m ) and A ( m ′ ) are instances of the same RDPG model, both m,m ′ are consistent estimates for the true-but-unknown underlying latent positions Z [13].”