The core in random hypergraphs and local weak convergence

Publication date: 6 November 2015

Abstract: The degree of a vertex in a hypergraph is defined as the number of edges incident to it. In this paper we study the

k

-core, defined as the maximal induced subhypergraph of minimum degree

k

, of the random

r

-uniform hypergraph

H_{r} (n, p)

for

r g e q 3

. We consider the case

k g e q 2

and

p = d / n^{r - 1}

for which every vertex has fixed average degree

d > 0

. We derive a multi-type branching process that describes the local structure of the

k

-core together with the mantle, i.e. the vertices outside the core.

This page was built for publication: The core in random hypergraphs and local weak convergence