On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
classification
💻 cs.DM
keywords
componentsexistencefixed-sizegeometricgraphsprobabilityrandomasymptotic
read the original abstract
In this work we give precise asymptotic expressions on the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.