Related papers: $Q$-voter model with independence on signed random…
In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly…
We introduce the incremental voter model (IVM), a discrete-opinion multi-agent system where agents undergo step-wise transitions biased by the opinion of a randomly selected persuader. Our incremental voter model comprises a large…
We generalize the DeGroot model for opinion dynamics to better capture realistic social scenarios. We introduce a model where each agent has their own individual cognitive biases. Society is represented as a directed graph whose edges…
We study the pairwise bounded confidence model on scale-free networks where new agents regularly arrive over time. The probability that arriving agents form links to preexisting ones depends on both agent degree and opinion proximity. In…
Consider an undirected graph G, representing a social network, where each node is blue or red, corresponding to positive or negative opinion on a topic. In the voter model, in discrete time rounds, each node picks a neighbour uniformly at…
A variety of problems in random-effects meta-analysis arise from the conventional $Q$ statistic, which uses estimated inverse-variance (IV) weights. In previous work on standardized mean difference and log-odds-ratio, we found superior…
We study the typical behavior of a generalized version of Google's PageRank algorithm on a large family of inhomogeneous random digraphs. This family includes as special cases directed versions of classical models such as the…
Processes of individual attitude formation and their macroscopic consequences have become an intriguing research topic, and agent-based models of opinion formation have been proposed to understand this phenomenon. This study conducted an…
The Sznajd model is one of sociophysics's well-known opinion dynamics models. Based on social validation, it has found application in diverse social systems and remains an intriguing subject of study, particularly in scenarios where…
This paper introduces a simple measure of a concordance pattern among observed outcomes along a network, i.e., the pattern in which adjacent outcomes tend to be more strongly correlated than non-adjacent outcomes. The graph concordance…
Opinion dynamics of random-walking agents on finite two-dimensional lattices is studied. In the model, the opinion is continuous, and both the lattice and the opinion can be either periodic or non-periodic. At each time step, all agents…
We study the consensus formation for an agents based model, generalizing that originally proposed by Krause \cite{Kr}, by allowing the communication channels between any couple of agents to be switched on or off randomly, at each time step,…
A new agent-based, bounded-confidence model for discrete one-dimensional opinion dynamics is presented. The agents interact if their opinions do not differ more than a tolerance parameter. In pairwise interactions, one of the pair, randomly…
A two-dimensional Heisenberg model with random antiferromagnetic nearest-neighbor exchange is studied using quantum Monte Carlo techniques. As the strength of the randomness is increased, the system undergoes a transition from an…
We study how intrinsic hard constraints on the decision dynamics of social agents shape collective decisions on multiple alternatives in a heterogeneous group. Such constraints may arise due to structural and behavioral limitations, such as…
Recent works have shown that the contact process running on the top of highly heterogeneous random networks is described by the heterogeneous mean-field theory. However, some important aspects as the transition point and strong corrections…
The voter model is a simple agent-based model to mimic opinion dynamics in social networks: a randomly chosen agent adopts the opinion of a randomly chosen neighbour. This process is repeated until a consensus emerges. Although the basic…
Two of the main factors shaping an individual's opinion are social coordination and personal preferences, or personal biases. To understand the role of those and that of the topology of the network of interactions, we study an extension of…
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…
We study concentration inequalities in gossip opinion dynamics over random graphs. In the model, a network is generated from a random graph model with independent edges, and agents interact pairwise randomly over the network. During the…