Random geometric graph: some recent developments and perspectives
DOI10.1007/978-3-031-26979-0_14arXiv2203.15351MaRDI QIDQ6150882
Yohann de Castro, Quentin Duchemin
Publication date: 7 March 2024
Published in: Progress in Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.15351
random matricescouplinginformation inequalitiesspectral clusteringrandom geometric graphsnon-parametric estimationconcentration inequality for U-statistics
Inequalities; stochastic orderings (60E15) Nonparametric estimation (62G05) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Two-sample Hypothesis Testing for Inhomogeneous Random Graphs
- Connectivity of soft random geometric graphs
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Robust estimation of \(U\)-statistics
- High-dimensional random geometric graphs and their clique number
- Reconstruction and estimation in the planted partition model
- Limit theorems for \(U\)-processes
- Algorithmic thresholds for tensor PCA
- Unit disk graph recognition is NP-hard
- A random geometric graph built on a time-varying Riemannian manifold
- Random matrix approximation of spectra of integral operators
- Adaptive estimation of nonparametric geometric graphs
- Optimal adaptivity of signed-polygon statistics for network testing
- Markov random geometric graph, MRGG: a growth model for temporal dynamic networks
- Phase transitions for detecting latent geometry in random graphs
- Spectral radii of sparse random matrices
- Gaussian fluctuations for edge counts in high-dimensional random geometric graphs
- The geometry of continuous latent space models for network data
- Optimal graphon estimation in cut distance
- Matrix estimation by universal singular value thresholding
- The acquaintance time of (percolated) random geometric graphs
- An efficiency upper bound for inverse covariance estimation
- Consensus dynamics on random rectangular graphs
- Concentration of measure without independence: a unified approach via the martingale method
- Basic models and questions in statistical network analysis
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- Ranking and empirical minimization of \(U\)-statistics
- Monotone properties of random geometric graphs have sharp thresholds
- Adaptive goodness-of-fit tests in a density model
- Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group
- The spectrum of a random geometric graph is concentrated
- Higher-order spectral clustering for geometric graphs
- Concentration inequality for U-statistics of order two for uniformly ergodic Markov chains
- Testing for high-dimensional geometry in random graphs
- Connectivity of Large Wireless Networks Under A General Connection Model
- Scale-Free Networks: A Decade and Beyond
- Random Plane Networks
- Random Geometric Graphs
- Community Detection and Stochastic Block Models
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- Information and Dimensionality of Anisotropic Random Geometric Graphs
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
- Minimal penalties and the slope heuristics: a survey
- Phase Transitions for Random Geometric Preferential Attachment Graphs
- Collective dynamics of ‘small-world’ networks
- An Introduction to Matrix Concentration Inequalities
- Reliable prediction in the Markov stochastic block model
This page was built for publication: Random geometric graph: some recent developments and perspectives
