k-Core Decomposition & Network Percolation

k-core decomposition: iteratively remove all nodes with degree < k. The k-core is the maximal subgraph where every node has ≥ k neighbors. Nodes colored by coreness (max k they belong to). Slider "show k≥" hides outer shells.