This paper studies asymptotic consensus in systems in which agents do not
necessarily have self-confidence, i.e., may disregard their own value during
execution of the update rule. We show that the prevalent hypothesis of
self-confidence in many convergence results can be replaced by the existence of
aperiodic cores. These are stable aperiodic subgraphs, which allow to virtually
store information about an agent's value distributedly in the network. Our
results are applicable to systems with message delays and memory loss.Comment: 13 page
