Table of Contents

1: Introduction
2: Probabilistic ingredients
3: Subgraph and component counts
4: Typical vertex degrees
5: Geometrical ingredients
6: Maximum degree, cliques and colourings
7: Minimum degree: laws of large numbers
8: Minimum degree: convergence in distribution
9: Percolative ingredients
10: Percolation and the largest component
11: The largest component for a binomial process
12: Ordering and partitioning problems
13: Connectivity and the number of components
References
Index

Reviews

The book is suitable to design a graduate course in random geometric graphs. Its scope stretches far beyond geometric probability and includes exciting material from Poisson approximation, percolation and statistical physics. This elegantly written monograph belongs to the collection of important books vital for every probabilist. Zentralblatt MATH