The stripping process can be slow: part II

TL;DR

This paper extends previous research on the stripping number and maximum depth in random uniform hypergraphs by analyzing their behavior in the subcritical regime and critical window, complementing earlier supercritical results.

Contribution

It provides new insights into the stripping process in hypergraphs within subcritical and critical regimes, expanding understanding beyond the supercritical case.

Findings

Analysis of stripping number in subcritical regime

Maximum depth characterization in critical window

Extension of previous supercritical results

Abstract

This paper is a continuation of the previous results on the stripping number of a random uniform hypergraph, and the maximum depth over all non-k-core vertices. The previous results focus on the supercritical case, whereas this work analyses these parameters in the subcritical regime and inside the critical window.