Subgraphs of dense random graphs with specified degrees

Details Subgraphs of dense random graphs with specified degrees Subgraphs of dense random graphs with specified degrees

2010-02-16

arxiv.org/abs/1002.3018v2

Mathematics

Combinatorics

Miscellaneous adjustments; added some corollaries and citations

Scientific paper

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. This extends the enumerative work of McKay and Wormald (1990) and is analogous to the theory developed for bipartite graphs by Greenhill and McKay (arXiv:math/0701600, 2009).

Affiliated with

Also associated with

No associations

Rating

Subgraphs of dense random graphs with specified degrees does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Subgraphs of dense random graphs with specified degrees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Subgraphs of dense random graphs with specified degrees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-597948