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

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

J. Díaz, D. Mitsche, and X. Pérez-Giménez

Source: Adv. in Appl. Probab. Volume 41, Number 2 (2009), 344-357.

Abstract

In this work we give precise asymptotic expressions for the probability of the existence of fixed-size components at the threshold of connectivity for random geometric graphs.

First Page: Show

Primary Subjects: 68R10

Secondary Subjects: 60C05

Keywords: Random geometric graph; connectivity threshold; component size

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.

If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.aap/1246886614
Digital Object Identifier: doi:10.1239/aap/1246886614
Mathematical Reviews number (MathSciNet): MR2541180
Zentralblatt MATH identifier: 1192.68478

back to Table of Contents

References

Bollobás, B. (2001). Random Graphs (Camb. Stud. Adv. Math. 73), 2nd edn. Cambridge University Press.

Mathematical Reviews (MathSciNet): MR1864966

Díaz, J., Petit, J. and Serna, M. (2001). A guide to concentration bounds. In Handbook of Randomized Computing, Vol. II, eds. S. Rajasekaran et al., Kluwer, Dordrecht, pp. 457--507.

Mathematical Reviews (MathSciNet): MR1966910

Gupta, P. and Kumar, P. R. (1999). Critical power for asymptotic connectivity in wireless networks. In Stochastic Analysis, Control, Optimization and Applications, Birkhäuser, Boston, MA, pp. 547--566.

Mathematical Reviews (MathSciNet): MR1702981

Zentralblatt MATH: 0916.90101

Hekmat, R. (2006). Ad-hoc Networks: Fundamental Properties and Network Topologies, Springer, Dordrecht.

Penrose, M. (1997). The longest edge of the random minimal spanning tree. Ann. Appl. Prob. 7, 340--361.

Mathematical Reviews (MathSciNet): MR1442317

Zentralblatt MATH: 0884.60042

Digital Object Identifier: doi:10.1214/aoap/1034625335

Project Euclid: euclid.aoap/1034625335

Penrose, M. (2003). Random Geometric Graphs (Oxford Stud. Prob. 5). Oxford University Press.

Mathematical Reviews (MathSciNet): MR1986198

previous :: next