2011/06/30 by Davide Cellai, Aonghus Lawlor, Kenneth A. Dawson +1 · 4 citations
Mathematics · Physics and Astronomy · #Algorithm #Binary number #Combinatorics #Complex Network Analysis Techniques #Computer science #Electrical resistivity and conductivity #Formalism (music) #Geometry #Graph theory and applications #Mathematics #Percolation (cognitive psychology) #Percolation threshold #Phase (matter) #Phase diagram #Physics #Quantum mechanics #Scaling #Statistical physics #Theoretical and Computational Physics #Tricritical point #cond-mat.dis-nn #cond-mat.stat-mech
paper · pdf · doi:10.1103/physrevlett.107.175703
published as Physical Review Letters 107, 175703 (2011)
arxiv created 2011/09/07 · openalex publication_date 2011/10/20 · arxiv updated 2012/09/19 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05
k-core percolation is an extension of the concept of classical percolation and is particularly relevant to understanding the resilience of complex networks under random damage. A new analytical formalism has been recently proposed to deal with heterogeneous k-cores, where each vertex is assigned a local threshold k(i). In this Letter we identify a binary mixture of heterogeneous k-cores which exhibits a tricritical point. We investigate the new scaling scenario and calculate the relevant critical exponents, by analytical and computational methods, for Erdős-Rényi networks and 2D square lattices.