Bootstrap percolation and the geometry of complex networks (Q898407)

The object of this paper is a geometric framework for complex networks. ``The aim of this work is to shed some light on the evolution of bootstrap percolation process and how this is determined by the geometry of the underlying network.'' The main result of this paper regards the size of the final set \(A_f\) of the bootstrap percolation process with activation threshold \(r\geq1\) on the random graph \(G(N; \alpha, \nu)\), where \(N\) is the number of vertices of the random graph and \(\alpha, \nu\) are some parameters.