Skip navigation
Skip navigation

Subgraphs of Dense Random Graphs with Specified Degrees

McKay, Brendan

Description

Let d = (d1, d2,dn) be a vector of non-negative integers with even sum. We prove some basic facts about the structure of a random graph with degree sequence d, including the probability of a given subgraph or induced subgraph. Although there are many results of this kind, they are restricted to the sparse case with only a few exceptions. Our focus is instead on the case where the average degree is approximately a constant fraction of n. Our approach is the multidimensional saddle-point method....[Show more]

CollectionsANU Research Publications
Date published: 2011
Type: Journal article
URI: http://hdl.handle.net/1885/68533
Source: Combinatorics Probability and Computing
DOI: 10.1017/S0963548311000034

Download

File Description SizeFormat Image
01_McKay_Subgraphs_of_Dense_Random_2011.pdf175.92 kBAdobe PDF    Request a copy
02_McKay_Subgraphs_of_Dense_Random_2011.pdf246.16 kBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator