Book contents
- Frontmatter
- Dedication
- Contents
- Preface
- Possible Course Outlines
- Part I Preliminaries
- Part II Connected Components in Random Graphs
- 3 Connected Components in General Inhomogeneous Random Graphs
- 4 Connected Components in Configuration Models
- 5 Connected Components in Preferential Attachment Models
- Part III Small-World Properties of Random Graphs
- Part IV Related Models and Problems
- Appendix: Metric Space Structure of Rooted Graphs
- Glossary
- References
- Index
4 - Connected Components in Configuration Models
from Part II - Connected Components in Random Graphs
Published online by Cambridge University Press: 08 February 2024
- Frontmatter
- Dedication
- Contents
- Preface
- Possible Course Outlines
- Part I Preliminaries
- Part II Connected Components in Random Graphs
- 3 Connected Components in General Inhomogeneous Random Graphs
- 4 Connected Components in Configuration Models
- 5 Connected Components in Preferential Attachment Models
- Part III Small-World Properties of Random Graphs
- Part IV Related Models and Problems
- Appendix: Metric Space Structure of Rooted Graphs
- Glossary
- References
- Index
Summary
In this chapter we investigate the local limit of the configuration model, we identify when it has a giant component and find its size and degree structure. We give two proofs, one based on a “the giant is almost local” argument, and another based on a continuous-time exploration of the connected components in the configuration model. Further results include its connectivity transition.
Keywords
- Type
- Chapter
- Information
- Random Graphs and Complex Networks , pp. 138 - 188Publisher: Cambridge University PressPrint publication year: 2024