In a voting process on a graph vertices revise their opinions in a distributed way based on the opinions of nearby vertices. The voting completes when the vertices reach consensus, that is, they all have the same opinion. The classic example is synchronous pull voting where at each step, each vertex adopts the opinion of a random neighbour. This very simple process, however, can be slow and the final opinion is not necessarily the one with the initial largest support. It was shown earlier that if there are initially only two opposing opinions, then both these drawbacks can be overcome by a synchronous two-sample voting, in which at each step each vertex considers its own opinion and the opinions of two random neighbours. If there are initi...
In the voter model, each node of a graph has an opinion, and in every round each node chooses indepe...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
In a voting process on a graph vertices revise their opinions in a distributed way based on the opin...
In the voting model each node has an opinion and in every time step each node adopts the opinion of ...
We study voting models on graphs. In the beginning, the vertices of a given graph have some initial ...
We consider an asynchronous voting process on graphs which we call discordant voting, and which can ...
We consider an asynchronous voting process on graphs which we call discordant voting, and which can ...
International audiencePlurality consensus considers a network of n nodes, each having one of k opini...
Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (...
We consider an asynchronous voting process on graphs called discordant voting, which can be describe...
International audiencePlurality consensus considers a network of n nodes, each having one of k opini...
Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
In the voter model, each node of a graph has an opinion, and in every round each node chooses indepe...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
In a voting process on a graph vertices revise their opinions in a distributed way based on the opin...
In the voting model each node has an opinion and in every time step each node adopts the opinion of ...
We study voting models on graphs. In the beginning, the vertices of a given graph have some initial ...
We consider an asynchronous voting process on graphs which we call discordant voting, and which can ...
We consider an asynchronous voting process on graphs which we call discordant voting, and which can ...
International audiencePlurality consensus considers a network of n nodes, each having one of k opini...
Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (...
We consider an asynchronous voting process on graphs called discordant voting, which can be describe...
International audiencePlurality consensus considers a network of n nodes, each having one of k opini...
Plurality consensus considers a network of n nodes, each having one of k opinions. Nodes execute a (...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
In the voter model, each node of a graph has an opinion, and in every round each node chooses indepe...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...
We study consensus processes on the complete graph of n nodes. Initially, each node supports one up ...