Skip to main content Accessibility help

We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.

Close cookie message
×
  1. Home
  2. Search

Refine search

Refine search

Access:
Content type:
Publication date:
Apply   From and To filters
Subject: Show more
Journals Show more
Publishers: Show more
Societies Show more
Series: Show more
Collections: Show more

Actions for selected content:

Select all | Deselect all
  • View selected items
  • Export citations
  • Download PDF (zip)
  • Save to Kindle
  • Save to Dropbox
  • Save to Google Drive

Save Search

You can save your searches here and later view and run them again in "My saved searches".

Please provide a title, maximum of 40 characters.
Cancel
×

2 results

  • 4 - Connected Components in Configuration Models

  • from Part II - Connected Components in Random Graphs
  • Remco van der Hofstad, Technische Universiteit Eindhoven, The Netherlands
  • Book:
    Random Graphs and Complex Networks
    Published online:
    08 February 2024
    Print publication:
    08 February 2024, pp 138-188

  • 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.

  • 3 - Connected Components in General Inhomogeneous Random Graphs

  • from Part II - Connected Components in Random Graphs
  • Remco van der Hofstad, Technische Universiteit Eindhoven, The Netherlands
  • Book:
    Random Graphs and Complex Networks
    Published online:
    08 February 2024
    Print publication:
    08 February 2024, pp 97-137

  • 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.