Random Networks for Communication
From Statistical Physics to Information Systems
£76.99
Part of Cambridge Series in Statistical and Probabilistic Mathematics
- Authors:
- Massimo Franceschetti, University of California, San Diego
- Ronald Meester, Vrije Universiteit, Amsterdam
- Date Published: January 2008
- availability: Available
- format: Hardback
- isbn: 9780521854429
£
76.99
Hardback
Other available formats:
eBook
Looking for an inspection copy?
This title is not currently available on inspection
-
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.
Read more- 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
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
×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
Preface
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
Appendix
References
Index.Instructors have used or reviewed this title for the following courses
- Advanced Topics in Communication Networks
- Cooperative Wireless Communication Systems
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org
Register Sign in» Proceed
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.
Continue ×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.
×