Abstract
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.
Keywords
Computer scienceRandom graphProbabilistic logicIdeal (ethics)Graph theoryField (mathematics)Theoretical computer scienceGraphMathematicsArtificial intelligenceCombinatoricsEpistemologyPure mathematicsPhilosophy
Affiliated Institutions
Related Publications
Random graphs with arbitrary degree distributions and their applications
Recent work on the structure of social networks and the internet has focused attention on graphs with distributions of vertex degree that are significantly different from the Po...
Introduction to Fourier optics
The fourth edition of this respected text considerably expands the original and reflects the tremendous advances made in the discipline since 1968. All material has been thoroug...
Markov Chains
Markov chains are central to the understanding of random processes. This is not only because they pervade the applications of random processes, but also because one can calculat...
Are randomly grown graphs really random?
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined b...
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár and Körner's book is widely regarded as a classic in the field of information theory, providing deep insights and expert treatment of the key theoretical issues. It incl...
Publication Info
- Year
- 2001
- Type
- book
- Citations
- 2551
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2551
OpenAlex
Cite This
Béla Bollobás
(2001).
Random Graphs.
Cambridge University Press eBooks
.
https://doi.org/10.1017/cbo9780511814068
Identifiers
- DOI
- 10.1017/cbo9780511814068