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
3 - Connected Components in General Inhomogeneous Random Graphs
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 introduce the general setting of inhomogeneous random graphs that are generalizations of the Erdos–Rényi and generalized random graphs. In inhomogeneous random graphs, the status of edges is independent with unequal edge-occupation probabilities. While these edge probabilities are moderated by vertex weights in generalized random graphs, in the general setting they are described in terms of a kernel. The main results in this chapter concern the degree structure, the multi-type branching process local limits, and the phase transition in these inhomogeneous random graphs. We also discuss various examples, and indicate that they can have rather different structure.
Keywords
- Type
- Chapter
- Information
- Random Graphs and Complex Networks , pp. 97 - 137Publisher: Cambridge University PressPrint publication year: 2024