Skip to main content Accessibility help
×
Hostname: page-component-cd9895bd7-8ctnn Total loading time: 0 Render date: 2024-12-26T19:13:50.741Z Has data issue: false hasContentIssue false

6 - Connectivity

from Part II - Erdős–Rényi–Gilbert Model

Published online by Cambridge University Press:  02 March 2023

Alan Frieze
Affiliation:
Carnegie Mellon University, Pennsylvania
Michał Karoński
Affiliation:
Adam Mickiewicz University, Poznań, Poland
Get access

Summary

Whether a graph is connected, i.e., there is a path between any two of its vertices, is of particular importance. Therefore, in this chapter, we first establish the threshold for the connectivity of a random graph. We then view this property in terms of the graph process and show that w.h.p. the random graph becomes connected at precisely the time when the last isolated vertex joins the giant component. This “hitting time” result is the precursor to several similar results. After this, we deal with k-connectivity, i.e., the parameter that measures the strength of connectivity of a graph. We show that the threshold for this property is the same as for the existence of vertices of degree k in a random graph.

Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2023

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Connectivity
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book: Random Graphs and Networks: A First Course
  • Online publication: 02 March 2023
  • Chapter DOI: https://doi.org/10.1017/9781009260268.009
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Connectivity
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book: Random Graphs and Networks: A First Course
  • Online publication: 02 March 2023
  • Chapter DOI: https://doi.org/10.1017/9781009260268.009
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Connectivity
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book: Random Graphs and Networks: A First Course
  • Online publication: 02 March 2023
  • Chapter DOI: https://doi.org/10.1017/9781009260268.009
Available formats
×