High-dimensional random geometric graphs and their clique number
From MaRDI portal
Publication:428594
DOI10.1214/EJP.v16-967zbMath1244.05200OpenAlexW2119509057MaRDI QIDQ428594
András György, Frederic Udina, Gábor Lugosi, Luc P. Devroye
Publication date: 22 June 2012
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/ejp.v16-967
Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
On the clique number of noisy random geometric graphs, On the distances within cliques in a soft random geometric graph, Random geometric graph: some recent developments and perspectives, A probabilistic view of latent space graphs and phase transitions, Limit theory of sparse random geometric graphs in high dimensions, Phase transition in noisy high-dimensional random geometric graphs, Threshold for detecting high dimensional geometry in anisotropic random geometric graphs, Guarantees for Spontaneous Synchronization on Random Geometric Graphs, Phase transitions for detecting latent geometry in random graphs, Detection of correlations, Clique colourings of geometric graphs, A smooth transition from Wishart to GOE, Corrected mean-field model for random sequential adsorption on random geometric graphs, Birthday inequalities, repulsion, and hard spheres, Adaptive estimation of nonparametric geometric graphs, Gaussian fluctuations for edge counts in high-dimensional random geometric graphs, Testing for high-dimensional geometry in random graphs, Superlogarithmic Cliques in Dense Inhomogeneous Random Graphs, Clustering in preferential attachment random graphs with edge-step, Detecting positive correlations in a multivariate sample
