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 (oxford.universitypressscholarship.com). (c) Copyright Oxford University Press, 2021. All Rights Reserved. An individual user may print out a PDF of a single chapter of a monograph in OSO for personal use. date: 15 January 2021

Random graphs with general degree distributions

Random graphs with general degree distributions

This chapter describes more sophisticated random graph models that mimic networks with arbitrary degree distributions

(p.428) Chapter 13 Random graphs with general degree distributions

M. E. J. Newman

Oxford University Press

The previous chapter looked at the classic random graph model, in which pairs of vertices are connected at random with uniform probabilities. Although this model has proved tremendously useful as a source of insight into the structure of networks, it also has a number of serious shortcomings. Chief among these is its degree distribution, which follows the Poisson distribution which is quite different from the degree distributions seen in most real-world networks. This chapter shows how to create more sophisticated random graph models, which incorporate arbitrary degree distributions and yet are still exactly solvable for many of their properties in the limit of large network size. The fundamental mathematical tool used to derive the results of this chapter is the probability generating function. Exercises are provided at the end of the chapter.

Keywords:   random graphs, network models, probability generating function, random graph models, Poisson distribution

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 .