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.

Explosive percolation in correlation-based networks

REMONDINI, DANIEL
2011

Abstract

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.
File in questo prodotto:
Eventuali allegati, non sono esposti

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11585/105729
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact