This chapter considers networks with an arbitrary degree distribution, in which the degrees of nodes are uncorrelated, including the degrees of the nearest-neighbour nodes. The two kinds of these networks are considered in detail. The first is the configuration model (a random graph with a given degree sequence) and the second is the static model (a random graph with a given sequence of desired degrees). The basic properties of these locally tree-like networks are discussed. The chapter also considers bipartite uncorrelated networks.
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.