Random and Quasirandom Graphs Lecture 2: Modeling a Random Graph

Abstract

probability of this graph occurring is ( 1 2 )(n2), i.e. the same probability that we gave above in our probability space. Given this model, a natural sequence of questions to ask is “what properties is a random graph likely to have?” For example, consider counting the number of edges in a random graph, or triangle subgraphs, or connectivity, or other such properties: what should we expect these values to be? We study these properties in this lecture:

Cite this paper

@inproceedings{Bartlett2012RandomAQ, title={Random and Quasirandom Graphs Lecture 2: Modeling a Random Graph}, author={Padraic Bartlett}, year={2012} }