Home
»
Random Geometric Graphs
A01=Mathew Penrose
Author_Mathew Penrose
Category=PBM
Category=PBT
Category=PBV
Category=UYQN
eq_bestseller
eq_computing
eq_isMigrated=1
eq_nobargain
eq_non-fiction
Product details
- ISBN 9780198506263
- Weight: 649g
- Dimensions: 162 x 241mm
- Publication Date: 01 May 2003
- Publisher: Oxford University Press
- Publication City/Country: GB
- Product Form: Hardback
Delivery/Collection within 10-20 working days
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
10-20 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
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.
Qty:
