Explosive percolation in correlation-based networks

We show briefly the features of a percolation transition related to the networks obtained from a correlation matrix. The most interesting behaviour of this transition, investigated by numerical simulations with different thresholding rules, is that it shows a much faster transition from the disaggregated to the clustered phase, that resembles what has been described as an "explosive" percolation. A comparison with the "classic" random network percolation is shown, together with some applications of these concepts to the networks obtained from real data, that behave differently depending on the data intrinsic structure.