An introduction to the most basic of network models, the random graph
This chapter discusses the basic mathematics of the random graph G(n, p), focusing particularly on the degree distribution and component sizes, which are two of the model's most illuminating characteristics. The techniques developed in this chapter prove useful for some of the more complex models examined later in the book. Exercises are provided at the end of the chapter.
Oxford Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.
If you think you should have access to this title, please contact your librarian.