peer-reviewedk-core percolation is an extension of the concept of classical percolation and is particularly relevant to understand 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 ki. In this paper 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 Erdos-Rényi networks and 2d square lattices
Abstract In this paper, we study the critical behavior of percolation on a configurat...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
We study a random graph model which is a superposition of bond percolation on Z(d) with parameter p,...
k-core percolation is an extension of the concept of classical percolation and is particularly relev...
peer-reviewedk-core percolation is a percolation model which gives a notion of network functionality...
Community structure underpins many complex networked systems and plays a vital role when components ...
Percolation theory concerns the emergence of connected clusters that percolate through a networked s...
A graph G=(V,E) is a mathematical model for a network with vertex set V and edge set E. A Random Gra...
It has been recognized that multiplexes and interlayer degree correlations can play a crucial role i...
15 pages, 9 figures (color eps) [v2: published text with a new Title and addition of an appendix, a ...
Recent theoretical studies on network robustness have focused primarily on attacks by random selecti...
Percolation is the study of connected structures in disordered networks. As edges are randomly and i...
The k-core of a graph G is the maximal subgraph of G having minimum degree at least k. In 1996, Pitt...
Percolation models have long served as a paradigm for unraveling the structure and resilience of com...
peer-reviewedAn analytical approach to calculating bond percolation thresholds, sizes of k-cores, an...
Abstract In this paper, we study the critical behavior of percolation on a configurat...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
We study a random graph model which is a superposition of bond percolation on Z(d) with parameter p,...
k-core percolation is an extension of the concept of classical percolation and is particularly relev...
peer-reviewedk-core percolation is a percolation model which gives a notion of network functionality...
Community structure underpins many complex networked systems and plays a vital role when components ...
Percolation theory concerns the emergence of connected clusters that percolate through a networked s...
A graph G=(V,E) is a mathematical model for a network with vertex set V and edge set E. A Random Gra...
It has been recognized that multiplexes and interlayer degree correlations can play a crucial role i...
15 pages, 9 figures (color eps) [v2: published text with a new Title and addition of an appendix, a ...
Recent theoretical studies on network robustness have focused primarily on attacks by random selecti...
Percolation is the study of connected structures in disordered networks. As edges are randomly and i...
The k-core of a graph G is the maximal subgraph of G having minimum degree at least k. In 1996, Pitt...
Percolation models have long served as a paradigm for unraveling the structure and resilience of com...
peer-reviewedAn analytical approach to calculating bond percolation thresholds, sizes of k-cores, an...
Abstract In this paper, we study the critical behavior of percolation on a configurat...
In this paper, we study the critical behavior of percolation on a configuration model with degree di...
We study a random graph model which is a superposition of bond percolation on Z(d) with parameter p,...