Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Networks of networks : the last frontier of complexity
D’Agostino G., Scala A., Springer Publishing Company, Incorporated, Cham, Switzerland, 2014. 355 pp. Type: Book (978-3-319035-17-8)
Date Reviewed: Sep 4 2014

Networks of networks is an exciting new field, and this book about it is one of a kind. Indeed, a decade and a half ago scientists started to realize the importance of networks. Models of artificial networks and confirmation of universal topologies defining families of systems were found and introduced. But it is only recently that the next step has been taken, partially in response to the complexity of molecular biology with its many layers and the “omics” revolution from genomics to metabolomics to proteomics. These fields show that no network is completely independent of other networks, such as the grid and transportation networks of a country. Yet the book is very pragmatic and spends only the necessary space to explain, in a self-contained fashion, the theory needed to understand each of the contributions.

The book, divided into three parts (“Theoretical Approaches,” “Applications,” and “Phenomenological Models”), contains a wide range of topics from leaders in the area, and includes material ranging from financial networks to electrical and abstract networks. The leading experts in the area explain how the study of the resulting topologies and dynamics, and the behavioral transitions of networks that in turn may have different topologies and dynamics, can shed light on so many real-world problems and relevant applications.

Reviewer:  Hector Zenil Review #: CR142691 (1411-0922)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Complexity Measures And Classes (F.1.3 )
 
 
Connectionism And Neural Nets (I.2.6 ... )
 
 
Engineering (J.2 ... )
 
 
Financial (J.1 ... )
 
 
Network Problems (G.2.2 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Complexity Measures And Classes": Date
Nonuniform proof systems
Kämper J. Theoretical Computer Science 85(2): 305-331, 1991. Type: Article
Feb 1 1993
Reversal complexity
Chen J., Yap C. SIAM Journal on Computing 20(4): 622-638, 1991. Type: Article
Oct 1 1992
Lower bounds for algebraic computation trees with integer inputs
Yao A. (ed) SIAM Journal on Computing 20(4): 655-668, 1991. Type: Article
Jul 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy