# On Minimal Sets to Destroy the $k$-Core in Random Networks

Abstract : We study the problem of finding the smallest set of nodes in a network whose removal results in an empty $k$-core; where the $k$-core is the sub-network obtained after the iterative removal of all nodes of degree smaller than $k$. This problem is also known in the literature as finding the minimal contagious set. The main contribution of our work is an analysis of the performance of the recently introduced COREHD algorithm [Scientific Reports, 6, 37954 (2016)] on random networks taken from the configuration model via a set of deterministic differential equations. Our analyses provides upper bounds on the size of the minimal contagious set that improve over previously known bounds. Our second contribution is a new heuristic called the WEAK-NEIGHBOR algorithm that outperforms all currently known local methods in the regimes considered
Document type :
Preprints, Working Papers, ...
Domain :

Cited literature [24 references]

https://hal-cea.archives-ouvertes.fr/cea-01933160
Contributor : Emmanuelle de Laborderie <>
Submitted on : Friday, November 23, 2018 - 3:30:45 PM
Last modification on : Monday, February 10, 2020 - 6:13:40 PM

### File

1806.03134.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : cea-01933160, version 1
• ARXIV : 1806.03134

### Citation

Christian Schmidt, Henry Pfister, Lenka Zdeborová. On Minimal Sets to Destroy the $k$-Core in Random Networks. 2018. ⟨cea-01933160⟩

Record views