Random geometric graph: some recent developments and perspectives
From MaRDI portal
Abstract: The Random Geometric Graph (RGG) is a random graph model for network data with an underlying spatial representation. Geometry endows RGGs with a rich dependence structure and often leads to desirable properties of real-world networks such as the small-world phenomenon and clustering. Originally introduced to model wireless communication networks, RGGs are now very popular with applications ranging from network user profiling to protein-protein interactions in biology. RGGs are also of purely theoretical interest since the underlying geometry gives rise to challenging mathematical questions. Their resolutions involve results from probability, statistics, combinatorics or information theory, placing RGGs at the intersection of a large span of research communities. This paper surveys the recent developments in RGGs from the lens of high dimensional settings and non-parametric inference. We also explain how this model differs from classical community based random graph models and we review recent works that try to take the best of both worlds. As a by-product, we expose the scope of the mathematical tools used in the proofs.
Recommendations
Cites work
- A random geometric graph built on a time-varying Riemannian manifold
- Adaptive estimation of nonparametric geometric graphs
- Adaptive goodness-of-fit tests in a density model
- Algorithmic thresholds for tensor PCA
- An efficiency upper bound for inverse covariance estimation
- An introduction to matrix concentration inequalities
- Approximation Theory and Harmonic Analysis on Spheres and Balls
- Asymptotic representation theory and the spectrum of a random geometric graph on a compact Lie group
- Basic models and questions in statistical network analysis
- Collective dynamics of `small-world' networks
- Community detection and stochastic block models
- Concentration inequality for U-statistics of order two for uniformly ergodic Markov chains
- Concentration of measure without independence: a unified approach via the martingale method
- CONCENTRATION OF RANDOM GRAPHS AND APPLICATION TO COMMUNITY DETECTION
- Connectivity of Large Wireless Networks Under A General Connection Model
- Connectivity of soft random geometric graphs
- Consensus dynamics on random rectangular graphs
- Gaussian fluctuations for edge counts in high-dimensional random geometric graphs
- High-dimensional random geometric graphs and their clique number
- Higher-order spectral clustering for geometric graphs
- scientific article; zbMATH DE number 1552476 (Why is no real title available?)
- Information and dimensionality of anisotropic random geometric graphs
- Large networks and graph limits
- Largest eigenvalues of sparse inhomogeneous Erdős-Rényi graphs
- Limit theorems for \(U\)-processes
- Markov random geometric graph, MRGG: a growth model for temporal dynamic networks
- Matrix estimation by universal singular value thresholding
- Minimal penalties and the slope heuristics: a survey
- Monotone properties of random geometric graphs have sharp thresholds
- Optimal adaptivity of signed-polygon statistics for network testing
- Optimal graphon estimation in cut distance
- Phase transitions for detecting latent geometry in random graphs
- Phase transitions for random geometric preferential attachment graphs
- Random Geometric Graphs
- Random graph models: an overview of modeling approaches
- Random graphs.
- Random matrix approximation of spectra of integral operators
- Random Plane Networks
- Ranking and empirical minimization of \(U\)-statistics
- Reconstruction and estimation in the planted partition model
- Reliable prediction in the Markov stochastic block model
- Robust estimation of U-statistics
- Scale-free networks: a decade and beyond
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- Spectral radii of sparse random matrices
- Testing for high-dimensional geometry in random graphs
- The acquaintance time of (percolated) random geometric graphs
- The geometry of continuous latent space models for network data
- The spectrum of a random geometric graph is concentrated
- Two-sample hypothesis testing for inhomogeneous random graphs
- Unit disk graph recognition is NP-hard
Cited in
(6)- Asymptotic distribution of the friendship paradox of a random geometric graph
- Limiting distribution for the Randić index of a random geometric graph
- Performance bound analysis of linear consensus algorithm on strongly connected graphs using effective resistance and reversiblization
- A distance-dependent random graph model and its analysis
- Asymptotic distribution for the average closure coefficient of the random geometric graph
- From point patterns to networks: to what extent does the Delaunay triangulation reproduce key spatial and density information?
This page was built for publication: Random geometric graph: some recent developments and perspectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6150882)
