 |
|
|
Item Details
| Title:
|
DYNAMICAL PROCESSES ON COMPLEX NETWORKS
|
| By: |
Alessandro Vespignani, Alain Barrat, Marc Barthelemy |
| Format: |
Hardback |
| List price:
|
£75.99 |
| Our price: |
£66.49 |
| Discount: |
|
| You save:
|
£9.50 |
|
|
|
|
|
| ISBN 10: |
0521879507 |
| ISBN 13: |
9780521879507 |
| Availability: |
Usually dispatched within 1-3 weeks.
 Delivery
rates
|
| Stock: |
Currently 0 available |
| Publisher: |
CAMBRIDGE UNIVERSITY PRESS |
| Pub. date: |
23 October, 2008 |
| Pages: |
366 |
| Description: |
An in-depth account on complex connectivity patterns for graduates and researchers in statistical mechanics, mathematical biology and information science. |
| Synopsis: |
The availability of large data sets has allowed researchers to uncover complex properties such as large-scale fluctuations and heterogeneities in many networks, leading to the breakdown of standard theoretical frameworks and models. Until recently these systems were considered as haphazard sets of points and connections. Recent advances have generated a vigorous research effort in understanding the effect of complex connectivity patterns on dynamical phenomena. This book presents a comprehensive account of these effects. A vast number of systems, from the brain to ecosystems, power grids and the Internet, can be represented as large complex networks. This book will interest graduate students and researchers in many disciplines, from physics and statistical mechanics to mathematical biology and information science. Its modular approach allows readers to readily access the sections of most interest to them, and complicated maths is avoided so the text can be easily followed by non-experts in the subject. |
| Illustrations: |
98 b/w illus. |
| Publication: |
UK |
| Imprint: |
Cambridge University Press |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|