Random graphs

By: Béla BollobásMaterial type: TextTextPublication details: Cambridge University Press: Cambridge, U.K., [c2001]Edition: 2nd edDescription: 498 pISBN: 9780521797221Subject(s): MathematicsLOC classification: QA166.17
Contents:
1 - Probability Theoretic Preliminaries 2 - Models of Random Graphs 3 - The Degree Sequence 4 - Small Subgraphs 5 - The Evolution of Random Graphs—Sparse Components 6 - The Evolution of Random Graphs—the Giant Component 7 - Connectivity and Matchings 8 - Long Paths and Cycles 9 - The Automorphism Group 10 - The Diameter 11 - Cliques, Independent Sets and Colouring 12 - Ramsey Theory 13 - Explicit Constructions 14 - Sequences, Matrices and Permutations 15 - Sorting Algorithms 16 - Random Graphs of Small Order
Summary: In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.--- summary provided by publisher
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Collection Shelving location Call number Status Notes Date due Barcode Item holds
Book Book ICTS
Mathematic Rack No 4 QA166.17 (Browse shelf (Opens below)) Available Billno:IN 00241; Billdate: 2018-04-11 01101
Total holds: 0

1 - Probability Theoretic Preliminaries
2 - Models of Random Graphs
3 - The Degree Sequence
4 - Small Subgraphs
5 - The Evolution of Random Graphs—Sparse Components
6 - The Evolution of Random Graphs—the Giant Component
7 - Connectivity and Matchings
8 - Long Paths and Cycles
9 - The Automorphism Group
10 - The Diameter
11 - Cliques, Independent Sets and Colouring
12 - Ramsey Theory
13 - Explicit Constructions
14 - Sequences, Matrices and Permutations
15 - Sorting Algorithms
16 - Random Graphs of Small Order

In this second edition of the now classic text, the already extensive treatment given in the first edition has been heavily revised by the author. The addition of two new sections, numerous new results and 150 references means that this represents a comprehensive account of random graph theory. The theory (founded by Erdös and Rényi in the late fifties) aims to estimate the number of graphs of a given degree that exhibit certain properties. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of more complicated random structures. This book, written by an acknowledged expert in the field, can be used by mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics. It is self-contained, and with numerous exercises in each chapter, is ideal for advanced courses or self study.--- summary provided by publisher

There are no comments on this title.

to post a comment.