Related papers: Majority-vote model on directed Erdos-Renyi random…
We present a picture of phase transitions of the system with colored multiplicative noise. Considering the noise amplitude as the power-law dependence of the stochastic variable $x^a$ we show the way to phase transitions disorder-order and…
We study the Deffuant et al. model for continuous--opinion dynamics under the influence of noise. In the original version of this model, individuals meet in random pairwise encounters after which they compromise or not depending of a…
In this paper we study nonlinear $q$-voter model with stochastic driving on a complete graph. We investigate two types of stochasticity that, using the language of social sciences, can be interpreted as different kinds of nonconformity.…
Online platforms for social interactions are an essential part of modern society. With the advance of technology and the rise of algorithms and AI, content is now filtered systematically and facilitates the formation of filter bubbles. This…
Consider the complete graph on \(n\) vertices where each edge is independently open with probability \(p,\) or closed otherwise. Phase transitions for such graphs for \(p = \frac{C}{n}\) have previously been studied using techniques like…
The notions of noise sensitivity and stability were recently extended for the voter model. In this model, the vertices of a graph have opinions that are updated by uniformly selecting edges. We further extend stability results to different…
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…
We develop an efficient numerical method to study the quantum critical behavior of disordered systems with $\mathcal{O}(N)$ order-parameter symmetry in the large$-N$ limit. It is based on the iterative solution of the large$-N$ saddle-point…
The voter model is a classical interacting particle system explaining consensus formation on a social network. Real social networks feature not only a heterogeneous degree distribution but also connections changing over time. We study the…
The rebellious voter model, introduced by Sturm and Swart (2008), is a variation of the standard, one-dimensional voter model, in which types that are locally in the minority have an advantage. It is related, both through duality and…
We study an influence network of voters subjected to correlated disordered external perturbations, and solve the dynamical equations exactly for fully connected networks. The model has a critical phase transition between disordered unimodal…
In this paper, we generalize the original majority-vote (MV) model with noise from two states to arbitrary $q$ states, where $q$ is an integer no less than two. The main emphasis is paid to the comparison on the nature of phase transitions…
We consider the voter model with binary opinions on a random regular graph with $n$ vertices of degree $d \geq 3$, subject to a rewiring dynamics in which pairs of edges are rewired, i.e., broken into four half-edges and subsequently…
Quantum graphs with leads to infinity serve as convenient models for studying various aspects of systems which are usually attributed to chaotic scattering. They are also studied in several experimental systems and practical applications.…
Estimation of a deterministic quantity observed in non-Gaussian additive noise is explored via order statistics approach. More specifically, we study the estimation problem when measurement noises either have positive supports or follow a…
We consider a situation where the distribution of a random variable is being estimated by the empirical distribution of noisy measurements of that variable. This is common practice in, for example, teacher value-added models and other…
Reliably labelling data typically requires annotations from multiple human workers. However, humans are far from being perfect. Hence, it is a common practice to aggregate labels gathered from multiple annotators to make a more confident…
Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitivity, the tendency of neighbours of a node to be connected.…
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 propose a new analytical method to study stochastic, binary-state models on complex networks. Moving beyond the usual mean-field theories, this alternative approach is based on the introduction of an annealed approximation for…