Fetching the paper…
Reading the bibliography…
In the random geometric graph model $\mathsf{Geo}_d(n,p)$, we identify each of our $n$ vertices with an independently and uniformly sampled vector from the $d$-dimensional unit sphere, and we connect pairs of vertices whose vectors are ``sufficiently close'', such that the marginal probability of an edge is $p$.
On random graphs. I
Paul Erdős and Alfréd Rényi · 1959
Earlier work this paper cites.
Internal energy, specific heat and correlation function of the bond-random Ising model
Hidetoshi Nishimori · 1981
Earlier work this paper cites.
Stochastic blockmodels: First steps
Paul W Holland, Kathryn Blackmond Laskey, and Samuel Leinhardt · 1983
Earlier work this paper cites.
Large cliques elude the Metropolis process
Mark Jerrum · 1992
Earlier work this paper cites.
Transportation cost for Gaussian and other product measures
Michel Talagrand · 1996
Earlier work this paper cites.
Deterministic and randomized polynomial-time approximation of radii
Andreas Brieden, Peter Gritzmann, Ravindran Kannan, Victor Klee, László Lovász, and Miklós Simonovits · 2001
Earlier work this paper cites.
Heuristics for semirandom graph problems
Uriel Feige and Joe Kilian · 2001
Earlier work this paper cites.
Linear lower bound on degrees of positivstellensatz calculus proofs for the parity
Dima Grigoriev · 2001
Earlier work this paper cites.
Relations between average case complexity and approximation complexity
Uriel Feige · 2002
Earlier work this paper cites.
On the optimality of the random hyperplane rounding technique for MAX CUT
Uriel Feige and Gideon Schechtman · 2002
Earlier work this paper cites.
The cavity method at zero temperature
Marc Mézard and Giorgio Parisi · 2003
Earlier work this paper cites.
Random geometric graphs
Mathew Penrose · 2003
Earlier work this paper cites.
Spin glasses: a challenge for mathematicians: cavity and mean field models
Michel Talagrand · 2003
Earlier work this paper cites.
The probabilistic method
Noga Alon and Joel H Spencer · 2004
Earlier work this paper cites.
Mixing in time and space for lattice spin systems: A combinatorial view
Martin Dyer, Alistair Sinclair, Eric Vigoda, and Dror Weitz · 2004
Earlier work this paper cites.
Graphs with tiny vector chromatic numbers and huge chromatic numbers
Uriel Feige, Michael Langberg, and Gideon Schechtman · 2004
Earlier work this paper cites.
Counting independent sets up to the tree threshold
Dror Weitz · 2006
Cited alongside, same era.
Concentration inequalities and model selection
Pascal Massart · 2007
Cited alongside, same era.
On the constant-depth complexity of k-clique
Benjamin Rossman · 2008
Cited alongside, same era.
Linear level Lasserre lower bounds for certain k-CSPs
Grant Schoenebeck · 2008
Cited alongside, same era.
Optimal transport: old and new
Cédric Villani · 2008
Cited alongside, same era.
Information, physics, and computation
Marc Mézard and Andrea Montanari · 2009
Cited alongside, same era.
A characterization of strong approximation resistance
Subhash Khot, Madhur Tulsiani, and Pratik Worah · 2014
Later among the works it cites.
Probability in high dimension
Ramon Van Handel · 2014
Later among the works it cites.
Non-backtracking spectrum of random graphs: community detection and non-regular ramanujan graphs
Charles Bordenave, Marc Lelarge, and Laurent Massoulié · 2015
Later among the works it cites.
Strong spatial mixing of list coloring of graphs
David Gamarnik, Dmitriy Katz, and Sidhant Misra · 2015
Later among the works it cites.
Approximation of rectangular beta-Laguerre ensembles and large deviations
Tiefeng Jiang and Danning Li · 2015
Later among the works it cites.
Testing for high-dimensional geometry in random graphs
Sébastien Bubeck, Jian Ding, Ronen Eldan, and Miklós Z Rácz · 2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Dmitry Panchenko · 2009
Cited alongside, same era.
Detecting high log-densities: an o ( n 1 / 4 ) o(n^{1/4}) approximation for densest k-subgraph
Aditya Bhaskara, Moses Charikar, Eden Chlamtac, Uriel Feige, and Aravindan Vijayaraghavan · 2010
Cited alongside, same era.
High-dimensional random geometric graphs and their clique number
Luc Devroye, András György, Gábor Lugosi, and Frederic Udina · 2011
Cited alongside, same era.
Random geometric graphs
Mark Walters · 2011
Cited alongside, same era.
Analysis and geometry of Markov diffusion operators
Dominique Bakry, Ivan Gentil, and Michel Ledoux · 2013
Cited alongside, same era.
Lectures on discrete geometry
Jiri Matousek · 2013
Cited alongside, same era.
Improved achievability and converse bounds for erdos-rényi graph matching
Daniel Cullina and Negar Kiyavash · 2016
Later among the works it cites.
Entropic CLT and phase transition in high-dimensional Wishart matrices
Sébastien Bubeck and Shirshendu Ganguly · 2018
Later among the works it cites.
Information-theoretic thresholds from the cavity method
Amin Coja-Oghlan, Florent Krzakala, Will Perkins, and Lenka Zdeborová · 2018
Later among the works it cites.
High-dimensional probability: An introduction with applications in data science
Roman Vershynin · 2018
Later among the works it cites.
A smooth transition from Wishart to GOE
Miklós Z Rácz and Jacob Richey · 2019
Later among the works it cites.
Phase transitions for detecting latent geometry in random graphs
Matthew Brennan, Guy Bresler, and Dheeraj Nagaraj · 2020
Later among the works it cites.
Information and dimensionality of anisotropic random geometric graphs
Ronen Eldan and Dan Mikulincer · 2020
Later among the works it cites.
De Finetti-style results for Wishart matrices: Combinatorial structure and phase transitions
Matthew Brennan, Guy Bresler, and Brice Huang · 2021
Closest in time.
Phase transition in noisy high-dimensional random geometric graphs
Suqi Liu and Miklós Z Rácz · 2021
Closest in time.