2000 character limit reached
On the Probability of the Existence of Fixed-Size Components in Random Geometric Graphs
Published 2 Jun 2008 in cs.DM | (0806.0311v3)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.