Cascade dynamics on clustered network

We investigate information cascades on a clustered network model generated from a projection of bipartite graphs by numerical simulations and compare it with that on a non-clustered network having the same degree distribution. Our result indicates that global cascades occur more easily on clustered networks than on non-clustered ones. Furthermore, we extend a recursive method by Gleeson and Cahalane to estimate the order parameter analytically and find that the result gives an excellent approximation to the observed transition point.