Subgraphs of Dense Random Graphs with Specified Degrees
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]
|Collections||ANU Research Publications|
|Source:||Combinatorics Probability and Computing|
|01_McKay_Subgraphs_of_Dense_Random_2011.pdf||175.92 kB||Adobe PDF||Request a copy|
|02_McKay_Subgraphs_of_Dense_Random_2011.pdf||246.16 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.