Related papers: Discursive Voter Models on the Supercritical Scale…
In this paper, we consider consensus problems over a network of nodes, where the network is divided into a number of clusters. We are interested in the case where the communication topology within each cluster is dense as compared to the…
In this paper, we discuss a voting model with two candidates, C_1 and C_2. We set two types of voters--herders and independents. The voting of independent voters is based on their fundamental values; on the other hand, the voting of herders…
We consider two independent stationary random walks on large random regular graphs of degree $k\geq 3$ with $N$ vertices. On these graphs, the exponential approximations of the meeting times are known to follow from existing methods and…
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.…
Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…
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…
Preferential attachment networks with power law exponent $\tau>3$ are known to exhibit a phase transition. There is a value $\rho_{\rm c}>0$ such that, for small edge densities $\rho\leq \rho_c$ every component of the graph comprises an…
We propose a new distributed-computing model, inspired by permissionless distributed systems such as Bitcoin and Ethereum, that allows studying permissionless consensus in a mathematically regular setting. Like in the sleepy model of Pass…
We explore the impact of social noise, characterized by nonconformist behavior, on the phase transition within the framework of the majority rule model. The order-disorder transition can reflect the consensus-polarization state in a social…
The constrained voter model describes the dynamics of opinions in a population of individuals located on a connected graph. Each agent is characterized by her opinion, where the set of opinions is represented by a finite sequence of…
We consider an asynchronous voting process on graphs which we call discordant voting, and which can be described as follows. Initially each vertex holds one of two opinions, red or blue say. Neighbouring vertices with different opinions…
We introduce a voting model that is similar to a Keynesian beauty contest and analyze it from a mathematical point of view. There are two types of voters-copycat and independent-and two candidates. Our voting model is a binomial…
A most debated topic of the last years is whether simple statistical physics models can explain collective features of social dynamics. A necessary step in this line of endeavour is to find regularities in data referring to large scale…
Voting is an important social activity for expressing public opinions. By conceptually considering a group of voting agents to be intelligent matter, the impact of real-time information on voting results is quantitatively studied by an…
Elections for public offices in democratic nations are large-scale examples of collective decision-making. As a complex system with a multitude of interactions among agents, we can anticipate that universal macroscopic patterns could emerge…
The problem of consensus in the presence of adversarially behaving agents has been studied extensively in the literature. The proposed algorithms typically guarantee that the consensus value lies within the convex hull of initial normal…
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,…
A key aspect for any greedy pursuit algorithm used in compressed sensing is a good support-set detection method. For distributed compressed sensing, we consider a setup where many sensors measure sparse signals that are correlated via the…
In this paper, we discuss the possible generalizations of the Social Influence with Recurrent Mobility (SIRM) model developed in Phys. Rev. Lett. 112, 158701 (2014). Although the SIRM model worked approximately satisfying when US election…
In this paper, we consider a leader-following consensus problem for networks of continuous-time integrator agents with a time-varying leader under measurement noises. We propose a neighbor-based state-estimation protocol for every agent to…