Unpublished, Draft, To Appear @UnPublished Unveröffentlicht, Entwurf

 Show entries of: this year (2020) | last year (2019) | two years ago (2018) | Notes URL
 Action: login to update Options: Goto entry point

 Author, Editor
 Author(s): Gao, Pu (Jane) Wormald, Nicholas Su, Yi dblp dblp dblp Not MPG Author(s): Wormald, Nicholas Su, Yi
 BibTeX citekey*: Gao2010DegSub

 Title, Booktitle
 Title*: Induced subgraphs in sparse random graphs with given degree sequence

 Vol, No, pp., Year
 Month: September Year: 2010 Language: English Pages: 31

 Note: LaTeX Abstract: Let $\mathcal{G}_{n,d}$ denote the uniformly random $d$-regular graph on $n$ vertices. For any $S\subset [n]$, we obtain estimates of the probability that the subgraph of $\mathcal{G}_{n,d}$ induced by $S$ is a given graph $H$. The estimate gives an asymptotic formula for any $d=o(n^{1/3})$, provided that $H$ does not contain almost all the edges of the random graph. The result is further extended to the probability space of random graphs with a given degree sequence. Categories / Keywords: induced subgraph, random graph, degree sequence HyperLinks / References / URLs: http://arxiv.org/abs/1011.3810 Personal Comments: File Upload: Download Access Level: Intranet

 Correlation
 MPG Unit: Max-Planck-Institut für Informatik MPG Subunit: Algorithms and Complexity Group Audience: experts only Appearance: MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:
@UNPUBLISHED{Gao2010DegSub,
AUTHOR = {Gao, Pu (Jane) and Wormald, Nicholas and Su, Yi},
TITLE = {Induced subgraphs in sparse random graphs with given degree sequence},
YEAR = {2010},
PAGES = {31},
MONTH = {September},
}