Distributed Consensus and Mitigating Risk Propagation in Evolutionary Optimized Networks

  • Takanori Komatsu
  • Akira Namatame
Part of the Proceedings in Information and Communications Technology book series (PICT, volume 4)


The consensus model has been extensively applied to solve coordination problems of distributed systems. A consensus algorithm specifies the information exchange rule between a system (node) and all of its neighbors on the network. The design issue of sensor networks capable of reaching a consensus quickly has received considerable attentions. The conditions for achieving a consensus depend on the properties of the graph of the nodes. The network is also subjected to external shocks both with respect to the size of the shock and the spatial impact of the shock. There is empirical evidence that as the connectivity of a network increases, we observe an increase in the performance, but at the same time, an increase in the chance of risk propagation which is extremely large. In this paper, we address the issue of designing desirable networks for any fixed number of nodes and links by employing an evolutionary optimization procedure. The resulting networks are optimal not only for fast consensus but also for minimizing risk propagation.


Network Topology Adjacency Matrix Random Network Consensus Problem Consensus Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Albert-László, B.: Linked: The New Science of Networks. Perseus Books Group, New York (2002)Google Scholar
  2. 2.
    Strogatz, S.H.: Exploring complex networks. Nature 410(6825), 268–276 (2001)CrossRefGoogle Scholar
  3. 3.
    Durrett, R.: Random Graph Dynamics. Cambridge University Press, Cambridge U.K. (2006)Google Scholar
  4. 4.
    Albert, R., Barabási, A.-L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97 (2002)MATHCrossRefGoogle Scholar
  5. 5.
    Krapivsky, P.L., Redner, S.: A statistical physics perspective on web growth. Computer Networks 39, 261–276 (2002)CrossRefGoogle Scholar
  6. 6.
    Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440–442 (1998)CrossRefGoogle Scholar
  7. 7.
    Donetti, L., Neri, F., Muñoz, M.A.: Optimal network topologies: expanders, cages, ramanujan graphs, entangled networks and all that. J. Stat. Mech. 26, 134–144 (2006)Google Scholar
  8. 8.
    Degroot, M.H.: Reaching a consensus. Journal of the American Statistical Association 69, 118–121 (1974)MATHCrossRefGoogle Scholar
  9. 9.
    Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE 95(1), 215–233 (2007)CrossRefGoogle Scholar
  10. 10.
    Boyd, S., Diaconis, F., Xiao, L.: Fastest mixing markov chain on graph. SIAM Review, 121–155 (2004)Google Scholar
  11. 11.
    Kar, S., Aldosari, S., Moura, J.M.F.: Topology for distributed inference on graphs. IEEE Trans. on Signal Processing 56, 2609–2613 (2008)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Kar, S., Aldosari, S., Moura, J.M.F.: Consensus based detection in sensor networks. In: International Workshop on Information Theory in Sensor Networks (June 2007)Google Scholar
  13. 13.
    Xiao, L., Boyd, S.: Fast linear iterations for distributed averaging. Systems and Control Letters 53, 65–78 (2003)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Wang, X.F., Chen, G.: Synchronization in scale-free dynamical networks: robustness and fragility. IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications 49, 54–62 (2002)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Sornette, D.: Critical Phenomena in Natural Sciences: Chaos, Fractals, Selforganization and Disorder: Concepts and Tools. Springer, Heidelberg (2006)MATHGoogle Scholar
  16. 16.
    Allen, F., Gale, D.: Financial contagion. Journal of Political Economy 108(1), 1–33 (2000)CrossRefGoogle Scholar
  17. 17.
    Chakrabarti, D., Wang, Y., Wang, C., Leskovec, J., Faloutsos, C.: Epidemic threshold in real networks. ACM Trans. on Information and System Security 10(4), 131–156 (2006)Google Scholar
  18. 18.
    Sato, H., Isao, O., Shigenobu, K.: A new generation alternation model of genetic algorithms and its assessment. Journal of Japanese Society for Artificial Intellligence 12(5), 734–744 (1997)Google Scholar
  19. 19.
    Komatsu, T., Namatame, A.: Dynamic diffusion process in evolutionary optimized networks. International Journal of Bio-Inspired Computation 3(6), 384–392 (2011)CrossRefGoogle Scholar
  20. 20.
    Komatsu, T., Namatame, A.: An evolutionary optimal network design to mitigate risk contagion. In: 2011 Seventh International Conference on Natunal Computation (ICNC), pp. 1954–1959. IEEE (2011)Google Scholar
  21. 21.
    Komatsu, T., Namatame, A.: Optimal diffusion in evolutionary designed networks. Proceedings of Econophysics Colloquium 2010 (November 2010)Google Scholar

Copyright information

© Springer Tokyo 2012

Authors and Affiliations

  • Takanori Komatsu
    • 1
  • Akira Namatame
    • 1
  1. 1.Department of Computer ScienceNational Defense AcademyYokosukaJapan

Personalised recommendations