Phase transitions for detecting latent geometry in random graphs
From MaRDI portal
Publication:2210754
DOI10.1007/s00440-020-00998-3zbMath1468.60011arXiv1910.14167OpenAlexW3087982197MaRDI QIDQ2210754
Guy Bresler, Matthew Brennan, Dheeraj Nagaraj
Publication date: 8 November 2020
Published in: Probability Theory and Related Fields (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1910.14167
Hypothesis testing in multivariate analysis (62H15) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Related Items
Anti-concentration of polynomials: dimension-free covariance bounds and decay of Fourier coefficients, High-dimensional regimes of non-stationary Gaussian correlated Wishart matrices, Random geometric graph: some recent developments and perspectives, A probabilistic view of latent space graphs and phase transitions, 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
Cites Work
- Unnamed Item
- Optimal detection of sparse principal components in high dimension
- High-dimensional random geometric graphs and their clique number
- Reconstruction and estimation in the planted partition model
- Large cliques in sparse random intersection graphs
- Sharp threshold functions for random intersection graphs via a coupling method
- Approximation of rectangular beta-Laguerre ensembles and large deviations
- Large independent sets in general random intersection graphs
- Connectivity of the uniform random intersection graph
- A smooth transition from Wishart to GOE
- Degree and clustering coefficient in sparse random intersection graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- Gaussian fluctuations for edge counts in high-dimensional random geometric graphs
- The middle-scale asymptotics of Wishart matrices
- Detecting positive correlations in a multivariate sample
- Computational barriers in minimax submatrix detection
- Concentration of measure without independence: a unified approach via the martingale method
- Basic models and questions in statistical network analysis
- Epidemics on random intersection graphs
- The degree of a typical vertex in generalized random intersection graph models
- Birthday inequalities, repulsion, and hard spheres
- Testing for high-dimensional geometry in random graphs
- Introduction to Random Graphs
- Asymptotic equivalence and contiguity of some random graphs
- Equivalence of a random intersection graph and G (n ,p )
- Epidemics on Random Graphs with Tunable Clustering
- Some applications of the Stein-Chen method for proving Poisson convergence
- On Random Intersection Graphs: The Subgraph Problem
- Random Geometric Graphs
- Latent Space Approaches to Social Network Analysis
- On the total variation distance between the binomial random graph and the random intersection graph
- Entropic CLT and Phase Transition in High-dimensional Wishart Matrices
- The vertex degree distribution of random intersection graphs
- On Choosing and Bounding Probability Metrics
- Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
- Information and Dimensionality of Anisotropic Random Geometric Graphs
- Component evolution in a secure wireless sensor network
- Tail-Sensitive Gaussian Asymptotics for Marginals of Concentrated Measures in High Dimension