Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Random Networks for Communication

Random Networks for Communication

Franceschetti, Massimo
Meester, Ronald

Hardcover

Series: Cambridge Statistical and Probabilistic Mathematics, Book 24

Probability & Statistics

ISBN10: 0521854423
ISBN13: 9780521854429
Publisher: Cambridge University Press
Published: Jan 10 2008
Pages: 212
Weight: 1.21
Height: 0.63 Width: 7.02 Depth: 10.19
Language: English
When is a random network (almost) connected? How much information can it carry? How can you find a particular destination within the network? And how do you approach these questions - and others - when the network is random? The analysis of communication networks requires a fascinating synthesis of random graph theory, stochastic geometry and percolation theory to provide models for both structure and information flow. This book is the first comprehensive introduction for graduate students and scientists to techniques and problems in the field of spatial random networks. The selection of material is driven by applications arising in engineering, and the treatment is both readable and mathematically rigorous. Though mainly concerned with information-flow-related questions motivated by wireless data networks, the models developed are also of interest in a broader context, ranging from engineering to social networks, biology, and physics.

Also in

Probability & Statistics

View All