相关论文: Ignore or Comply? On Breaking Symmetry in Consensu…

We introduce and study a novel majority-based opinion diffusion model. Consider a graph $G$, which represents a social network. Assume that initially a subset of nodes, called seed nodes or early adopters, are colored either black or white,…

This paper considers the consensus problem for a network of nodes with random interactions and sampled-data control actions. We first show that consensus in expectation, in mean square, and almost surely are equivalent for a general random…

We study the minority-opinion dynamics over a fully-connected network of $n$ nodes with binary opinions. Upon activation, a node receives a sample of opinions from a limited number of neighbors chosen uniformly at random. Each activated…

We consider a class of opinion dynamics on networks where at each time-step, each node in the network disregards the opinions of a certain number of its most extreme neighbors and updates its own opinion as a weighted average of the…

We study the consensus problem in a synchronous distributed system of $n$ nodes under an adaptive adversary that has a slightly outdated view of the system and can block all incoming and outgoing communication of a constant fraction of the…

In populations with community structure, the formation of consensus requires both alignment within and diffusion of beliefs across groups, processes that evolve on distinct time scales. How do modularity, asymmetry, and polarization shape…

We study a distributed consensus problem on a complete communication network of $n$ vertices, each holding one of two opinions. The vertices communicate in rounds, possibly in the presence of adversarial noise, and exchange information…

We consider the plurality consensus problem among $n$ agents. Initially, each agent has one of $k$ different opinions. Agents choose random interaction partners and revise their state according to a fixed transition function, depending on…

In this paper, the problem of bridge consensus is presented and solved. Bridge consensus consists of a network of nodes, some of whom are participating and others are non-participating. The objective is for all the agents to reach average…

Problems of consensus in multi-agent systems are often viewed as a series of independent, simultaneous local decisions made between a limited set of options, all aimed at reaching a global agreement. Key challenges in these protocols…

In the deterministic binary majority process we are given a simple graph where each node has one out of two initial opinions. In every round, every node adopts the majority opinion among its neighbors. By using a potential argument first…

In this work, we analyze the performance of a simple majority-rule protocol solving a fundamental coordination problem in distributed systems - \emph{binary majority consensus}, in the presence of probabilistic message loss. Using…

We study a majority based preference diffusion model in which the members of a social network update their preferences based on those of their connections. Consider an undirected graph where each node has a strict linear order over a set of…

Consider a distributed graph where each vertex holds one of two distinct opinions. In this paper, we are interested in synchronous voting processes where each vertex updates its opinion according to a predefined common local updating rule.…

In several settings (e.g., sensor networks and social networks), nodes of a graph are equipped with initial opinions, and the goal is to estimate the average of these opinions using local operations. A natural algorithm to achieve this is…

We present the first upper bound on the convergence time to consensus of the well-known $h$-majority dynamics with $k$ opinions, in the synchronous setting, for $h$ and $k$ that are both non-constant values. We suppose that, at the…

The \emph{Undecided-State Dynamics} is a well-known protocol for distributed consensus. We analyze it in the parallel \pull\ communication model on the complete graph for the \emph{binary} case (every node can either support one of…

Consider a graph G with n nodes and m edges, which represents a social network, and assume that initially each node is blue or white. In each round, all nodes simultaneously update their color to the most frequent color in their…

We investigate majority rule dynamics in a population with two classes of people, each with two opinion states $\pm 1$, and with tunable interactions between people in different classes. In an update, a randomly selected group adopts the…

We consider the convergence time for solving the binary consensus problem using the interval consensus algorithm proposed by B\' en\' ezit, Thiran and Vetterli (2009). In the binary consensus problem, each node initially holds one of two…