Related papers: Resolution of a conjecture on majority dynamics: r…
We study the evolution of majority dynamics with more than two states on the binomial random graph $G(n,p)$. In this process, each vertex has a state in $\{1,\ldots, k\}$, with $k\geq 3$, and at each round every vertex adopts state $i$ if…
Majority dynamics on a graph $G$ is a deterministic process such that every vertex updates its $\pm 1$-assignment according to the majority assignment on its neighbor simultaneously at each step. Benjamini, Chan, O'Donnel, Tamuz and Tan…
Majority dynamics on the binomial Erd\H{o}s-R\'enyi graph $\mathsf{G}(n,p)$ with $p=\lambda/\sqrt{n}$ is studied. In this process, each vertex has a state in $\{0,1\}$ and at each round, every vertex adopts the state of the majority of its…
We study the evolution of majority dynamics on Erd\H{o}s-R\'enyi $G(n,p)$ random graphs. In this process, each vertex of a graph is assigned one of two initial states. Subsequently, on every day, each vertex simultaneously updates its state…
Majority dynamics is a process on a simple, undirected graph $G$ with an initial Red/Blue color for every vertex of $G$. Each day, each vertex updates its color following the majority among its neighbors, using its previous color for…
We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…
Given a graph $G$ and some initial labelling $\sigma : V(G) \to \{Red, Blue\}$ of its vertices, the \textit{majority dynamics model} is the deterministic process where at each stage, every vertex simultaneously replaces its label with the…
We consider the median dynamics process in general graphs. In this model, each vertex has an independent initial opinion uniformly distributed in the interval [0,1] and, with rate one, updates its opinion to coincide with the median of its…
Consider a graph $G=(V,E)$ and an initial random coloring where each vertex $v \in V$ is blue with probability $P_b$ and red otherwise, independently from all other vertices. In each round, all vertices simultaneously switch their color to…
Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them,…
The "majority dynamics" process on a social network begins with an initial phase, where the individuals are split into two competing parties, Red and Blue. Every day, everyone updates their affiliation to match the majority among those of…
We consider the following distributed consensus problem: Each node in a complete communication network of size $n$ initially holds an \emph{opinion}, which is chosen arbitrarily from a finite set $\Sigma$. The system must converge toward a…
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…
Emergence of dominating cliques in Erd\"os-R\'enyi random graph model ${\bbbg(n,p)}$ is investigated in this paper. It is shown this phenomenon possesses a phase transition. Namely, we have argued that, given a constant probability $p$, an…
Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them,…
We present a tight analysis for the well-studied randomized 3-majority dynamics of stabilizing consensus, hence answering the main open question of Becchetti et al. [SODA'16]. Consider a distributed system of n nodes, each initially holding…
We prove that the family of largest cuts in the binomial random graph exhibits the following stability property: If $1/n \ll p = 1-\Omega(1)$, then, with high probability, there is a set of $n - o(n)$ vertices that is partitioned in the…
In majority dynamics, agents located at the vertices of an undirected simple graph update their binary opinions synchronously by adopting those of the majority of their neighbors. On infinite unimodular transitive graphs (e.g., Cayley…
Consider $n=\ell+m$ individuals, where $\ell\le m$, with $\ell$ individuals holding an opinion $A$ and $m$ holding an opinion $B$. Suppose that the individuals communicate via an undirected network $G$, and in each time step, each…
We consider 3-Majority, a probabilistic consensus dynamics on a complete graph with $n$ vertices, each vertex starting with one of $k$ initial opinions. At each discrete time step, a vertex $u$ is chosen uniformly at random. The selected…