title: Core percolation on complex networks.
abstract: We analytically solve the core percolation problem for complex networks with arbitrary degree distributions. We find that purely scale-free networks have no core for any degree exponents. We show that for undirected networks if core percolation occurs then it is continuous while for directed networks it is discontinuous (and hybrid) if the in- and out-degree distributions differ. We also find that core percolations on undirected and directed networks have completely different critical exponents associated with their critical singularities.
authors.affiliation: Center for Complex Network Research and Department of Physics, Northeastern University, Boston, Massachusetts 02115, USA. ya.liu@neu.edu
authors.forename: Yang-Yu
authors.initials: YY
authors.lastname: Liu
authors.forename: Endre
authors.initials: E
authors.lastname: Csóka
authors.forename: Haijun
authors.initials: H
authors.lastname: Zhou
authors.forename: Márton
authors.initials: M
authors.lastname: Pósfai
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D008962:Models, Theoretical