Induced subgraphs in sparse random graphs with given degree sequence

Details Induced subgraphs in sparse random graphs with given degree sequence Induced subgraphs in sparse random graphs with given degree sequence

2010-11-16

arxiv.org/abs/1011.3810v2

Mathematics

Combinatorics

31 pages, 11 figures

Scientific paper

For any $S\subset [n]$, we compute the probability that the subgraph of
$\mathcal{G}_{n,d}$ induced by $S$ is a given graph $H$ on the vertex set $S$.
The result holds for any $d=o(n^{1/3})$ and is further extended to
$\mathcal{G}_{{\bf d}}$, the probability space of random graphs with a given
degree sequence $\bf d$.

Affiliated with

Also associated with

No associations

Rating

Induced subgraphs in sparse random graphs with given degree sequence 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 Induced subgraphs in sparse random graphs with given degree sequence, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Induced subgraphs in sparse random graphs with given degree sequence will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-110214