相关论文: Majority dynamics and the median process: connecti…

A broad range of dynamical systems involve multi-body interactions, or group interactions, which may not be encoded in traditional graphical structures. In this work, we focus on a canonical example from opinion dynamics, the Majority Rule,…

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…

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…

We consider a group of agents connected by a social network who participate in majority dynamics: each agent starts with an opinion in {-1,+1} and repeatedly updates it to match the opinion of the majority of its neighbors. We assume that…

We consider two-opinion voter models on dense dynamic random graphs. Our goal is to understand and describe the occurrence of consensus versus polarisation over long periods of time. The former means that all vertices have the same opinion,…

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…

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…

Mechanistic and tractable mathematical models play a key role in understanding how social influence shapes public opinions. Recently, a weighted-median mechanism has been proposed as a new micro-foundation of opinion dynamics and validated…

Consider n individuals who, by popular vote, choose among q >= 2 alternatives, one of which is "better" than the others. Assume that each individual votes independently at random, and that the probability of voting for the better…

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…

A general model of opinion dynamics is introduced in which each individual's opinion is measured on a bounded continuous spectrum. Each opinion is influenced heterogeneously by every other opinion in the population. It is demonstrated that…

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…

We study the evolution of opinions on a directed network with community structure. Individuals update their opinions synchronously based on a weighted average of their neighbors' opinions, their own previous opinions, and external media…

We consider a system in which a group of agents represented by the vertices of a graph synchronously update their opinion based on that of their neighbours. If each agent adopts a positive opinion if and only if that opinion is sufficiently…

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…

In this paper, we study a model for opinion dynamics where the influence weights of agents evolve in time via an equation which is coupled with the opinions' evolution. We explore the natural question of the large population limit with two…

This article starts by introducing a new theoretical framework to model spatial systems which is obtained from the framework of interacting particle systems by replacing the traditional graphical structure that defines the network of…

A voter sits on each vertex of an infinite tree of degree $k$, and has to decide between two alternative opinions. At each time step, each voter switches to the opinion of the majority of her neighbors. We analyze this majority process when…

In this paper we consider two-opinion voter models on dynamic random graphs, in which the joint dynamics of opinions and graphs acts as one-way feedback, i.e., edges appear and disappear over time depending on the opinions of the two…

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…