Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Networks (2nd ed.)
Newman M., Oxford University Press, Inc., New York, NY, 2018. 800 pp. Type: Book (978-0-198805-09-0)
Date Reviewed: Apr 22 2019

In this revised and expanded edition of his 2010 seminal work [1,2], Newman updates the content to reflect developments in the field. The book is very comprehensive and consists of 18 chapters. It is divided into four distinct parts: “The Empirical Study of Networks,” “Fundamentals of Network Theory,” “Network Models,” and “Applications.” Professor Newman has consolidated the fundamentals of network theory and computer algorithms into the unified “Fundamentals of Network Theory” part. The “Processes on Networks” part from the previous edition has been renamed “Applications” and is considerably expanded. The writing style is clear, engaging, and well developed. The content is dense, and each part requires considerable time and attention, as well as some mathematical sophistication.

After a brief first chapter where the author gives an overview of the topics discussed in the remainder of the book, the reader is propelled into the empirical study of networks (in four chapters), starting with technological networks. Newman provides an in-depth discussion of the foundations of the Internet and lighter coverage of other technological networks, such as telephones, power grids, transportation, and distribution networks. The next three chapters address networks of information, social networks, and biological networks. In each chapter, the author covers both the structure and measurement aspects of the networks.

Part 2 includes five chapters on the fundamentals of network theory, including “Mathematics of Networks,” “Measures and Metrics,” and “Computer Algorithms.” Compared to the previous edition, he has developed two new chapters: “Network Statistics and Measurement Error” and “The Structure of Real-World Networks.” The chapter on mathematics covers the foundations and tools used in the study of networks. “Measures and Metrics” helps quantify network structure, and the chapter on algorithms introduces numerical network calculations and discusses complexity. “Network Statistics and Measurement Error” summarizes types of error, error detection, and error correction such as link prediction and node disambiguation. The last chapter of Part 2 presents the structure and application to a range of real-world networks.

Part 3, “Network Models,” is comprised of three chapters. The author has revamped two chapters: “Random Graphs,” using the Poisson random graph, and “Models of Network Formation,” with a focus on the preferential attachment models from the previous edition. This part also includes a new chapter on the configuration model and its extensions.

Part 4, “Applications,” addresses a number of domains where networks are most relevant. Chapter 14 begins with community structure, applying algorithms, and assessing performance in practice. Chapter 15, “Percolation and Network Resilience,” covers what happen when nodes or edges are removed from a network; illustrations include the Internet and social networks. Chapter 16 discusses the very important topic of epidemics networks. Both classic and advanced models are used to illustrate the spreading of diseases through susceptible-infected-removed (SIR) processes. Chapter 17 introduces the theory of dynamical systems on networks, including synchronization and stability phenomena. The last chapter describes network search processes, with examples from web search, crawlers, and web ranking algorithms. Network navigation is also discussed at some length.

The book includes extensive research references and a comprehensive index. Each chapter contains a set of exercises, which could make it a good teaching book for advanced studies in network science. The previous edition’s subtitle (an introduction) has been dropped, so as not to mislead readers. This excellent book is bound to be a new classic in the discipline. It can definitely be used as a solid reference for theory, mathematical foundations, and illustrative applications, and as a concrete starting point for new research in the field. With this new edition, Newman has done it again, providing readers with thought-provoking material in the emerging field of networks.

More reviews about this item: Amazon, Goodreads

Reviewer:  Jean-Pierre Kuilboer Review #: CR146541 (1907-0258)
1) Berzal, F. Review of Networks: an introduction, by Mark Newman. Computing Reviews (Oct. 7, 2010), CR Rev. No. 138459 (1104-0366).
2) Parunak, H. V. D. Review of Networks: an introduction, by Mark Newman. Computing Reviews (Nov. 4, 2010), CR Rev. No. 138554 (1106-0594).
Bookmark and Share
  Reviewer Selected
Editor Recommended
 
 
General (C.0 )
 
Would you recommend this review?
yes
no
Other reviews under "General": Date
Structured computer organization (3rd ed.)
Tanenbaum A., Prentice-Hall, Inc., Upper Saddle River, NJ, 1989. Type: Book (9780138546625)
Oct 1 1991
Principles of computer systems
Karam G., Bryant J., Prentice-Hall, Inc., Upper Saddle River, NJ, 1992. Type: Book (9780131594685)
Sep 1 1992
Computer organization
Scragg G., McGraw-Hill, Inc., New York, NY, 1992. Type: Book (9780070558434)
May 1 1994
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