Random Geometric Graphs by Mathew Penrose
(Oxford Studies in Probability)

No critic rating

Waiting for minimum critic reviews


This monograph sets out a body of mathematical theory for finite graphs with nodes placed randomly in Euclidean space and edges added to connect points that are close to each other. As an alternative to classical random graph models, these geometric graphs are relevant to the modelling of real-world networks having spatial content, arising in numerous applications such as wireless communications, parallel processing, classification, epidemiology, astronomy, and the internet.
Aimed at graduate students and researchers in probability, combinatorics, statistics, and theoretical computer science, it covers topics such as edge and component counts, vertex degrees, cliques, colourings, connectivity, giant component phenomena, vertex ordering and partitioning problems. It also illustrates and extends the application to geometric probability of modern techniques including Stein's method, martingale methods and continuum percolation.

About Mathew Penrose

See more books from this Author
Mathew Penrose is in the Department of Mathematical Sciences, Durham University.
Published May 1, 2003 by OUP Oxford. 344 pages
Genres: Education & Reference, Professional & Technical, Science & Math. Non-fiction

Rate this book!

Add Review