Related papers: The Evolving Voter Model on Thick Graphs
This paper considers a social network modeled as an Erdos Renyi random graph. Each individual in the network updates her opinion using the weighted average of the opinions of her neighbors. We explore how an external manipulative agent can…
We study the collective motion of a large set of self-propelled particles subject to voter-like interactions. Each particle moves on a two-dimensional space at a constant speed in a direction that is randomly assigned initially. Then, at…
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…
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…
Nearest neighbor is a popular nonparametric method for classification and regression with many appealing properties. In the big data era, the sheer volume and spatial/temporal disparity of big data may prohibit centrally processing and…
This paper studies a recently proposed continuous-time distributed self-appraisal model with time-varying interactions among a network of $n$ individuals which are characterized by a sequence of time-varying relative interaction matrices.…
The growing availability of network data and of scientific interest in distributed systems has led to the rapid development of statistical models of network structure. Typically, however, these are models for the entire network, while the…
In this article we introduce a dynamic Erd\H{o}s-R\'enyi graph model, in which, independently for each vertex pair, edges appear and disappear according to a Markov on-off process. In studying the dynamic graph we present two main results.…
We study the dynamics of opinion formation in a heterogeneous voter model on a complete graph, in which each agent is endowed with an integer fitness parameter $k \ge 0$, in addition to its $+$ or $-$ opinion state. The evolution of the…
Let $\mathcal{G}(N,\frac 1Nt_N)$ be the Erd\H{o}s-R\'enyi graph with connection probability $\frac 1Nt_N\sim t/N$ as $N\to\infty$ for a fixed $t\in(0,\infty)$. We derive a large-deviations principle for the empirical measure of the sizes of…
We study the homogeneous symmetrical threshold model with independence (noise) by pair approximation and Monte Carlo simulations on Watts-Strogatz graphs. The model is a modified version of the famous Granovetter's threshold model: with…
In recent years, opinion dynamics has received an increasing attention, and various models have been introduced and evaluated mainly by simulation. In this study, we introduce and study a dynamical model inspired by the so-called `bounded…
We investigate coarsening and persistence in the voter model by introducing the quantity $P_n(t)$, defined as the fraction of voters who changed their opinion n times up to time t. We show that $P_n(t)$ exhibits scaling behavior that…
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,…
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…
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…
A model where agents show discrete behavior regarding their actions, but have continuous opinions that are updated by interacting with other agents is presented. This new updating rule is applied to both the voter and Sznajd models for…
The Shapley-Shubik power index is a measure of each voters power in the passage or failure of a vote. We extend this measure to graphs and consider a discrete-time process in which voters may change their vote based on the outcome of the…
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,…
We present a mathematical description of the voter model dynamics on heterogeneous networks. When the average degree of the graph is $\mu \leq 2$ the system reaches complete order exponentially fast. For $\mu >2$, a finite system falls,…