Random Geometric Graphs

Mathew Penrose

Anno: 2003
Rilegatura: Hardback
Pagine: 344 p.
Testo in English
Dimensioni: 241 x 162 mm
Peso: 649 gr.
  • EAN: 9780198506263
pagabile con 18App pagabile con Carta del Docente

Articolo acquistabile con 18App e Carta del Docente

€ 92,78

€ 98,70

Risparmi € 5,92 (6%)

Venduto e spedito da IBS

93 punti Premium

Disponibile in 10 gg

Quantità:
Descrizione
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.