The coreness and H-index of random geometric graphs
From MaRDI portal
Publication:6634795
DOI10.30757/alea.v21-39MaRDI QIDQ6634795
Eddie Aamari, Clément Berenfeld, Ery Arias-Castro
Publication date: 8 November 2024
Published in: ALEA. Latin American Journal of Probability and Mathematical Statistics (Search for Journal in Brave)
Cites Work
- An index to quantify an individual's scientific research output
- Geometric inference for probability measures
- Asymptotic normality of the \(k\)-core in random graphs
- Handbook of large-scale random networks
- Statistical analysis of network data. Methods and models
- Optimal construction of \(k\)-nearest-neighbor graphs for identifying noisy clusters
- Size and connectivity of the \(k\)-core of a random graph
- Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
- General notions of statistical depth function.
- Sudden emergence of a giant \(k\)-core in a random graph
- A new status index derived from sociometric analysis
- Optimal Cheeger cuts and bisections of random geometric graphs
- Consistency of Cheeger and Ratio Graph Cuts
- The Domination Number of On-line Social Networks and Random Geometric Graphs
- Theory of Classification: a Survey of Some Recent Advances
- A simple solution to the k‐core problem
- Line-of-Sight Networks
- Random Geometric Graphs
- Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
- The Normalized Graph Cut and Cheeger Constant: From Discrete to Continuous
- Clustering Based on Pairwise Distances When the Data is of Mixed Dimensions
- Thek-Core and Branching Processes
This page was built for publication: The coreness and H-index of random geometric graphs
