|Preface||Preview Material||Table of Contents||Supplementary Material|| || || |
CBMS Regional Conference Series in Mathematics
2006; 264 pp; softcover
List Price: US$57
Member Price: US$45.60
All Individuals: US$45.60
Order Code: CBMS/107
Through examples of large complex graphs in realistic networks, research in graph theory has been forging ahead into exciting new directions. Graph theory has emerged as a primary tool for detecting numerous hidden structures in various information networks, including Internet graphs, social networks, biological networks, or, more generally, any graph representing relations in massive data sets.
How will we explain from first principles the universal and ubiquitous coherence in the structure of these realistic but complex networks? In order to analyze these large sparse graphs, we use combinatorial, probabilistic, and spectral methods, as well as new and improved tools to analyze these networks. The examples of these networks have led us to focus on new, general, and powerful ways to look at graph theory. The book, based on lectures given at the CBMS Workshop on the Combinatorics of Large Sparse Graphs, presents new perspectives in graph theory and helps to contribute to a sound scientific foundation for our understanding of discrete networks that permeate this information age.
Graduate students and research mathematicians interested in combinatorics (graph theory) and its applications to large networks.
"This is a well-structured and useful book for researchers in random graphs, combinatorics and computer science. Because of its self-contained nature, and the careful way the topics are introduced, it is a good text for graduate level courses in the subject."
-- Colin D. Cooper for Mathematical Reviews
AMS Home |
© Copyright 2013, American Mathematical Society