Jump to ContentJump to Main Navigation
Random Geometric Graphs$
Users without a subscription are not able to see the full content.

Mathew Penrose

Print publication date: 2003

Print ISBN-13: 9780198506263

Published to Oxford Scholarship Online: September 2007

DOI: 10.1093/acprof:oso/9780198506263.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 20 January 2021



Random Geometric Graphs

Mathew Penrose (Contributor Webpage)

Oxford University Press

This chapter contains some known results on connectivity which are used later on. The notion of unicoherence of a simply-connected set is explained and extended to lattices. Peierls (counting) arguments are described for estimating the number of connected sets in the lattice, and elements of (lattice) percolation theory are described. A multiparameter ergodic theorem is given, and the basic theory of continuum percolation is described. Some of the theory of Poisson point processes are recalled, including the superposition, thinning, and scaling theorems.

Keywords:   connected set, unicoherence, Peierls argument, percolation, ergodic theorem, Poisson process

Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .