National Science Library of Georgia

Image from Google Jackets

Random graphs / Béla Bollobás.

By: Material type: TextTextSeries: Cambridge studies in advanced mathematics ; 73.Publisher: Cambridge : Cambridge University Press, 2001Edition: Second editionDescription: 1 online resource (xviii, 498 pages) : digital, PDF file(s)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9780511814068 (ebook)
Subject(s): Additional physical formats: Print version: : No titleDDC classification:
  • 511/.5 21
LOC classification:
  • QA166.17 .B66 2001
Online resources: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
No physical items for this record

Title from publisher's bibliographic system (viewed on 05 Oct 2015).

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.

There are no comments on this title.

to post a comment.
Copyright © 2023 Sciencelib.ge All rights reserved.