An uniformity index for random geometric graphs
From MaRDI portal
Cites work
- Analyzing complex functional brain networks: fusing statistics and network science to understand the brain
- Central limit theorem for the average closure coefficient
- Community detection and stochastic block models: recent developments
- scientific article; zbMATH DE number 6400134 (Why is no real title available?)
- Monotone properties of random geometric graphs have sharp thresholds
- On the Randi\'{c} index and its variants of network data
- On the Rényi index of random graphs
- One-Dimensional Geometric Random Graphs With Nonvanishing Densities—Part I: A Strong Zero-One Law for Connectivity
- One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
- Statistical analysis of network data. Methods and models
- Structural Complexity of One-Dimensional Random Geometric Graphs
- The Structure and Function of Complex Networks
This page was built for publication: An uniformity index for random geometric graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6949663)