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
×

1 results

  • 2 - Basic Tools

  • from Part I - Preliminaries
  • Alan Frieze, Carnegie Mellon University, Pennsylvania, Michał Karoński, Adam Mickiewicz University, Poznań, Poland
  • Book:
    Random Graphs and Networks: A First Course
    Published online:
    02 March 2023
    Print publication:
    09 March 2023, pp 8-26

  • Summary

    Before reading and studying the results on random graphs included in the text one should become familiar with the basic rules of asymptotic computation, find leading terms in combinatorial expressions, choose suitable bounds for the binomials, as well as get acquainted with probabilistic tools needed to study tail bounds, i.e., the probability that a random variable exceeds (or is smaller than) some real value. This chapter offers the reader a short description of these important technical tools used throughout the text.