Buch, Englisch, 344 Seiten, Print PDF, Format (B × H): 161 mm x 240 mm, Gewicht: 687 g
Buch, Englisch, 344 Seiten, Print PDF, Format (B × H): 161 mm x 240 mm, Gewicht: 687 g
ISBN: 978-0-19-850626-3
Verlag: OUP Oxford
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.
Autoren/Hrsg.
Fachgebiete
Weitere Infos & Material
- 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
