Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

How does the core sit inside the mantle? (1503.09030v1)

Published 31 Mar 2015 in math.CO, cs.DM, and math.PR

Abstract: The $k$-core, defined as the largest subgraph of minimum degree $k$, of the random graph $G(n,p)$ has been studied extensively. In a landmark paper Pittel, Wormald and Spencer [JCTB 67 (1996) 111--151] determined the threshold $d_k$ for the appearance of an extensive $k$-core. Here we derive a multi-type Galton-Watson branching process that describes precisely how the $k$-core is embedded into the random graph for any $k\geq3$ and any fixed average degree $d=np>d_k$. This generalises prior results on, e.g., the internal structure of the $k$-core.

Citations (7)

Summary

We haven't generated a summary for this paper yet.