On the normalized Laplacian spectra of random geometric graphs
From MaRDI portal
Publication:6042058
DOI10.1007/s10959-022-01158-0zbMath1514.05144OpenAlexW4213026413MaRDI QIDQ6042058
Laura Cottatellucci, Mounia Hamidouche, Konstantin E. Avrachenkov
Publication date: 16 May 2023
Published in: Journal of Theoretical Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10959-022-01158-0
normalized Laplacianrandom geometric graphlimiting eigenvalue distributionthermodynamic regimeconnectivity regime
Random graphs (graph-theoretic aspects) (05C80) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The spectrum of kernel random matrices
- Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
- Spectral analysis of large dimensional random matrices
- Distributions of eigenvalues of large Euclidean matrices generated from \(l_p\) balls and spheres
- Two-point concentration in random geometric graphs
- The spectrum of a random geometric graph is concentrated
- The variation of the spectrum of a normal matrix
- Random Matrix Methods for Wireless Communications
- Improving Random Walk Estimation Accuracy with Uniform Restarts
- Symmetric motifs in random geometric graphs
- Eigenvalues of Euclidean random matrices
- Random Geometric Graphs
- Graph Spectra for Complex Networks
This page was built for publication: On the normalized Laplacian spectra of random geometric graphs