Related papers: Limit Laws for Consensus Protocols on the Complete…
Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. In particular, many biologically inspired systems that try to achieve agreements on…
Consensus is arguably the most studied problem in distributed computing as a whole, and particularly in the distributed message-passing setting. In this latter framework, research on consensus has considered various hypotheses regarding the…
In this brief paper, a new consensus protocol based on the sign of innovations is proposed. Based on this protocol each agent only requires single-bit of information about its relative state to its neighboring agents. This is significant in…
This paper revisits the problem of multi-agent consensus from a graph signal processing perspective. Describing a consensus protocol as a graph spectrum filter, we present an effective new approach to the analysis and design of consensus…
This article is concerned with a general class of stochastic spatial models for the dynamics of opinions. Like in the voter model, individuals are located on the vertex set of a connected graph and update their opinion at a constant rate…
In this paper, we consider the unconstrained distributed optimization problem, in which the exchange of information in the network is captured by a directed graph topology, thus, nodes can only communicate with their neighbors.…
Push-Pull is a well-studied round-robin rumor spreading protocol defined as follows: initially a node knows a rumor and wants to spread it to all nodes in a network quickly. In each round, every informed node sends the rumor to a random…
We present DMaC, a novel distributed, finite-time algorithm that guarantees max-consensus in directed networks with unreliable communication links experiencing packet drops. Unlike existing methods, DMaC ensures all nodes compute the exact…
We consider the quantized consensus problem on undirected time-varying connected graphs with n nodes, and devise a protocol with fast convergence time to the set of consensus points. Specifically, we show that when the edges of each network…
In the information exchange problem, k packets that are initially maintained by k nodes need to be disseminated to the whole network as quickly as possible. We consider this problem in single-hop multi- channel networks of n nodes, and…
Average consensus algorithms can be implemented over wireless sensor networks (WSN), where global statistics can be computed using communications among sensor nodes locally. Simple execution, robustness to global topology changes due to…
In a coalescing random walk, a set of particles make independent random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues the random walk through the graph.…
Classical approaches for asymptotic convergence to the global average in a distributed fashion typically assume timely and reliable exchange of information between neighboring components of a given multi-component system. These assumptions…
This paper considers the consensus problem of a novel opinion dynamics model with group pressure and self-confidence. Different with the most existing paper, the influence of friends of friends in a social network is taken into account,…
The dynamics of spreading of the minority opinion in public debates (a reform proposal, a behavior change, a military retaliation) is studied using a diffusion reaction model. People move by discrete step on a landscape of random geometry…
We revisit the classic problem of spreading a piece of information in a group of $n$ fully connected processors. By suitably adding a small dose of randomness to the protocol of Gasienic and Pelc (1996), we derive for the first time…
We study majority dynamics on the binomial random graph $G(n,p)$ with $p = d/n$ and $d > \lambda n^{1/2}$, for some large $\lambda>0$. In this process, each vertex has a state in $\{-1,+1 \}$ and at each round every vertex adopts the state…
We propose a new protocol solving the fundamental problem of disseminating a piece of information to all members of a group of n players. It builds upon the classical randomized rumor spreading protocol and several extensions. The main…
Consider a graph where each of the $n$ nodes is either in state $\mathcal{R}$ or $\mathcal{B}$. Herein, we analyze the \emph{synchronous $k$-Majority dynamics}, where in each discrete-time round nodes simultaneously sample $k$ neighbors…
We study distributed agreement in synchronous directed dynamic networks, where an omniscient message adversary controls the availability of communication links. We prove that consensus is impossible under a message adversary that guarantees…