Consensus on Moving Neighborhood Model of Peterson Graph

arXiv1203.1900MaRDI QIDQ6231506FDOQ6231506

Authors: Hannah Arendt, Jorgensen Jost 

Publication date: 8 March 2012

Abstract: In this paper, we study the consensus problem of multiple agents on a kind of famous graph, Peterson graph. It is an undirected graph with 10 vertices and 15 edges. Each agent randomly walks on this graph and communicates with each other if and only if they coincide on a node at the same time. We conduct numerical study on the consensus problem in this framework and show that global consensus can be achieved.

This page was built for publication: Consensus on Moving Neighborhood Model of Peterson Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231506)