Scale-Free Automata Networks Are Not Robust in a Collective Computational Task

摘要: We investigate the performances and collective task-solving capabilities of complex networks automata using density problem as a typical case show by computer simulations that evolved Watts–Strogatz small-world have superior performance with respect to scale-free graphs Albert–Barabasi type Besides, are much more robust in face transient uniformly random perturbations This result differs from information diffusion on networks, where faults highly tolerated.