Jump to ContentJump to Main Navigation
NetworksAn Introduction$
Users without a subscription are not able to see the full content.

Mark Newman

Print publication date: 2010

Print ISBN-13: 9780199206650

Published to Oxford Scholarship Online: September 2010

DOI: 10.1093/acprof:oso/9780199206650.001.0001

Show Summary Details
Page of

PRINTED FROM OXFORD SCHOLARSHIP ONLINE (www.oxfordscholarship.com). (c) Copyright Oxford University Press, 2019. All Rights Reserved. Under the terms of the licence agreement, an individual user may print out a PDF of a single chapter of a monograph in OSO for personal use (for details see www.oxfordscholarship.com/page/privacy-policy).date: 21 July 2019

Random graphs

Random graphs

An introduction to the most basic of network models, the random graph

Chapter:
(p.397) Chapter 12 Random graphs
Source:
Networks
Author(s):

M. E. J. Newman

Publisher:
Oxford University Press
DOI:10.1093/acprof:oso/9780199206650.003.0012

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.

Keywords:   network models, random graphs, degree, clustering coefficient, path lengths, component sizes

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.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us .