On the probability of the existence of fixed-size components in random geometric graphs

DOI10.1239/aap/1246886614zbMath1192.68478OpenAlexW2023742784WikidataQ57991459 ScholiaQ57991459MaRDI QIDQ5320654

Xavier Pérez-Giménez, Dieter Mitsche, Josep Diaz

Publication date: 22 July 2009

Published in: Unnamed Author (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1239/aap/1246886614

zbMATH Keywords

random geometric graphconnectivity thresholdcomponent size

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)

Related Items (1)

Theoretical Aspects of Graph Models for MANETs

Cites Work

• The longest edge of the random minimal spanning tree
• Random Geometric Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the probability of the existence of fixed-size components in random geometric graphs