Skip to content
Register Sign in Wishlist

Random Networks for Communication
From Statistical Physics to Information Systems


Part of Cambridge Series in Statistical and Probabilistic Mathematics

  • Date Published: January 2008
  • availability: Available
  • format: Hardback
  • isbn: 9780521854429

£ 76.99

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • 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.

    • Balanced approach: learn the theory as motivated by real applications
    • Focus on information flow, the issue at the heart of communication systems
    • Active authors at the forefront of research and development
    Read more

    Reviews & endorsements

    'The balance between intuition and rigor is ideal, in my opinion, and reading the book is an enjoyable and highly rewarding endeavor … this book will be useful to physicists, mathematicians, and computer scientists who look at random graph models in which point locations affect the shape and properties of the resulting network: physicists will acquaint themselves with complex networks having rich modeling capabilities (e.g. models for random interaction particle systems such as spin glasses), mathematicians may discover connections of the networks with formal systems (much like the connection of the classical Erdős–Rényi random graph properties with first- and second-order logic), and computer scientists will greatly appreciate the applicability of the theory given in the book to the study of realistic, ad hoc mobile networks in which network node connections change rapidly and unpredictably as a function of the geometry of the current node positions.' Yannis Stamatiou, Mathematical Reviews

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity


    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?


    Product details

    • Date Published: January 2008
    • format: Hardback
    • isbn: 9780521854429
    • length: 212 pages
    • dimensions: 259 x 178 x 16 mm
    • weight: 0.55kg
    • contains: 67 b/w illus. 60 exercises
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Phase transitions in infinite networks
    3. Connectivity of finite networks
    4. More on phase transitions
    5. Information flow in random networks
    6. Navigation in random networks

  • Instructors have used or reviewed this title for the following courses

    • Advanced Topics in Communication Networks
    • Cooperative Wireless Communication Systems
  • Authors

    Massimo Franceschetti, University of California, San Diego
    Massimo Franceschetti is assistant professor of electrical engineering at the University of California, San Diego. His work in communication system theory sits at the interface between networks, information theory, and electromagnetic wave propagation.

    Ronald Meester, Vrije Universiteit, Amsterdam
    Ronald Meester is professor of mathematics at the Vrije Universiteit Amsterdam. He has published broadly in percolation theory, spatial random processes, self-organized criticality, ergodic theory, and forensic statistics and is the author of Continuum Percolation (with Rahul Roy) and A Natural Introduction to Probability Theory.

Related Books

also by this author

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.


Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

Please fill in the required fields in your feedback submission.