This is a new edition of a now classic text. The addition of two new sections, numerous new results and over 150 references mean that this represents an up-to-date account of random graph theory. Suitable for mathematicians, computer scientists and electrical engineers, as well as people working in biomathematics.
"synopsis" may belong to another edition of this title.
This is a new edition of a now classic text. The already extensive treatment given in the first edition has been heavily revised by the author, an acknowleged expert. The addition of two new sections, numerous new results and over 150 references mean that this represents an up-to-date account of random graph theory. This book 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.About the Author:
Béla Bollobás has taught at Cambridge University's Department of Pure Maths and Mathematical Statistics for over 25 years and has been a fellow of Trinity College for 30 years. Since 1996, he has held the unique Chair of Excellence in the Department of Mathematical Sciences at the University of Memphis. Bollobás has previously written over 250 research papers in extremal and probabilistic combinatorics, functional analysis, probability theory, isoperimetric inequalities and polynomials of graphs.
"About this title" may belong to another edition of this title.
Book Description Academic Press Inc, 1985. Book Condition: Poor. This is an ex-library book and may have the usual library/used-book markings inside.This book has soft covers. In poor condition, suitable as a reading copy. Bookseller Inventory # 6209239
Book Description Academic Press:, 1985. Soft Cover. Book Condition: Fine. First printing. 447 pages. "This is the first sytematic and extensive account of the theory of random graphs, a subject founded in the late fifties by Erdos and Renyi. The now well developed theory aims to identify the properties shared by most graphs in various probability spaces. It not only has numerous combinatorial applications, but also serves as a model for the probabilistic treatment of mathematical systems with more structure." FINE SOFTCOVER. Size: 8vo - over 7¾" - 9¾" tall. Bookseller Inventory # 022712