The stripping process can be slow: part II
Combinatorics
2015-05-13 v1
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.
Cite
@article{arxiv.1505.02804,
title = {The stripping process can be slow: part II},
author = {Pu Gao},
journal= {arXiv preprint arXiv:1505.02804},
year = {2015}
}
Comments
31 pages