Consensus on Moving Neighborhood Model of Peterson Graph

Details Consensus on Moving Neighborhood Model of Peterson Graph Consensus on Moving Neighborhood Model of Peterson Graph

2012-03-08

arxiv.org/abs/1203.1900v1

Computer Science

Distributed, Parallel, and Cluster Computing

Submitted to European Physical Journal B

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Consensus on Moving Neighborhood Model of Peterson Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Consensus on Moving Neighborhood Model of Peterson Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Consensus on Moving Neighborhood Model of Peterson Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-18096