Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- Conventions/Notations
- Part I Preliminaries
- Part II Erdős–Rényi–Gilbert Model
- 3 Uniform and Binomial Random Graphs
- 4 Evolution
- 5 Vertex Degrees
- 6 Connectivity
- 7 Small Subgraphs
- 8 Large Subgraphs
- 9 Extreme Characteristics
- Part III Modeling Complex Networks
- References
- Author Index
- Subject Index
9 - Extreme Characteristics
from Part II - Erdős–Rényi–Gilbert Model
Published online by Cambridge University Press: 02 March 2023
Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Acknowledgments
- Conventions/Notations
- Part I Preliminaries
- Part II Erdős–Rényi–Gilbert Model
- 3 Uniform and Binomial Random Graphs
- 4 Evolution
- 5 Vertex Degrees
- 6 Connectivity
- 7 Small Subgraphs
- 8 Large Subgraphs
- 9 Extreme Characteristics
- Part III Modeling Complex Networks
- References
- Author Index
- Subject Index
Summary
In this chapter, we look first at the diameter of random graphs, i.e., the extreme value of the shortest distance between a pair of vertices. Then we look at the size of the largest independent set and the related value of the chromatic number. One interesting feature of these parameters is that they are often highly concentrated.
- Type
- Chapter
- Information
- Random Graphs and Networks: A First Course , pp. 111 - 124Publisher: Cambridge University PressPrint publication year: 2023