The core in random hypergraphs and local weak convergence

TL;DR

This paper analyzes the structure of the k-core in random r-uniform hypergraphs using local weak convergence and branching processes, revealing detailed local properties of the core and its surrounding vertices.

Contribution

It introduces a multi-type branching process model to describe the local structure of the k-core and the mantle in random hypergraphs, extending previous graph results.

Findings

Characterizes the local structure of the k-core in hypergraphs

Develops a multi-type branching process for analysis

Provides insights into the core's emergence and properties

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\geq 3$. We consider the case $k\geq 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.