Luddism on Diffusion Networks.

We further develop and analyze the LISA (Luddite, Ignorant, Susceptible, Adopter) diffusion model via mean field theory and network simulation. We eliminate ignorant nodes from the stationary state, such that only 'Adopters' and 'Luddites' are left after some time. We analyze different sets of initial conditions, and their effects on the stationary state of the network. Namely, we investigate the possibility for luddism resulting from triadic connections, which are considered the basis of social networks. We also study the stationary states resulting from 2 and 3 densely connected sub-graphs with one 'seeding' subgraph and various proportions of bridging between subgraphs.