Phase transitions for detecting latent geometry in random graphs
- 22 September 2020
- journal article
- research article
- Published by Springer Nature in Probability Theory and Related Fields
- Vol. 178 (3-4) , 1215-1289
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- Office of Naval Research (N00014-17-1-2147)
This publication has 39 references indexed in Scilit:
- Sampling-based algorithms for optimal motion planningThe International Journal of Robotics Research, 2011
- Equivalence of a random intersection graph andG(n,p)Random Structures & Algorithms, 2010
- Asymptotic equivalence and contiguity of some random graphsRandom Structures & Algorithms, 2009
- Large independent sets in general random intersection graphsTheoretical Computer Science, 2008
- Epidemics on Random Graphs with Tunable ClusteringJournal of Applied Probability, 2008
- Topology control in wireless ad hoc and sensor networksACM Computing Surveys, 2005
- The vertex degree distribution of random intersection graphsRandom Structures & Algorithms, 2004
- On Choosing and Bounding Probability MetricsInternational Statistical Review, 2002
- Latent Space Approaches to Social Network AnalysisJournal of the American Statistical Association, 2002
- Some applications of the Stein-Chen method for proving Poisson convergenceAdvances in Applied Probability, 1989