A note on estimating the dimension from a random geometric graph
From MaRDI portal
Cites work
- A course of modern analysis. An introduction to the general theory of infinite processes and of analytic functions; with an account of the principal transcendental functions. 4th ed.
- A strong law for the longest edge of the minimal spanning tree
- An Algorithm for Finding Intrinsic Dimensionality of Data
- Collective dynamics of `small-world' networks
- Distribution of the distance between two random points in a body from \(\mathbb{R}^n\)
- Geodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
- Geometrical embeddings of graphs
- High-dimensional probability. An introduction with applications in data science
- Highly connected random geometric graphs
- scientific article; zbMATH DE number 193944 (Why is no real title available?)
- scientific article; zbMATH DE number 3563431 (Why is no real title available?)
- scientific article; zbMATH DE number 4000257 (Why is no real title available?)
- Markov random geometric graph, MRGG: a growth model for temporal dynamic networks
- Measuring the strangeness of strange attractors
- Metric embedding, hyperbolic space, and social networks
- Multidimensional scaling of noisy high dimensional data
- New results for the random nearest neighbor tree
- On the chromatic number of random geometric graphs
- Random coverings in several dimensions
- Random Geometric Graphs
- Random Graphs
- Random Plane Networks
- Sphere and dot product representations of graphs
- Testing for high-dimensional geometry in random graphs
- The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
- The cover time of random geometric graphs
- The probability of covering a sphere with N circular caps
This page was built for publication: A note on estimating the dimension from a random geometric graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7034306)
