Core forging and local limit theorems for the k-core of random graphs
Journal of Combinatorial Theory, Volume abs/1707.03556, 2019.
Abstract We establish a multivariate local limit theorem for the order and size as well as several other parameters of the k -core of the Erdős–Renyi random graph. The proof is based on a novel approach to the k -core problem that replaces the meticulous analysis of the ‘peeling process’ by a generative model of graphs with a core of ...More
Full Text (Upload PDF)
PPT (Upload PPT)