相关论文: Majority-vote model on random graphs
Consider a graph $G$, representing a social network. Assume that initially each node is colored either black or white, which corresponds to a positive or negative opinion regarding a consumer product or a technological innovation. In the…
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.…
Here, the model of non-equilibrium model with two states ($-1,+1$) and a noise $q$ on simple square lattices proposed for M.J. Oliveira (1992) following the conjecture of up-down symmetry of Grinstein and colleagues (1985) is studied and…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
We use Monte Carlo simulations and finite-size scaling theory to investigate the phase transition and critical behavior of the $S$-state block voter model on square lattices. It is shown that the system exhibits an order-disorder phase…
The majority-voter model is studied by Monte Carlo simulations on hypercubic lattices of dimension $d=2$ to 7 with periodic boundary conditions. The critical exponents associated to the Finite-Size Scaling of the magnetic susceptibility are…
We consider the Majority Vote model coupled with scale-free networks. Recent works point to a non-universal behavior of the Majority Vote model, where the critical exponents depend on the connectivity while the network's effective dimension…
We study the dynamics of a version of the batch minority game, with random external information and with different types of inhomogeneous decision noise (additive and multiplicative), using generating functional techniques \`{a} la De…
Consider a critical random multigraph $\mathcal{G}_n$ with $n$ vertices constructed by the configuration model such that its vertex degrees are independent random variables with the same distribution $\nu$ (criticality means that the second…
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 point out that the recently developed strong-coupling theory enables us to calculate the three main critical exponents nu, eta, omega, from the knowledge of only the two renormalization constants Z_phi of wave function and Z_m of mass.…
In this paper, we develop new statistical theory for probabilistic principal component analysis models in high dimensions. The focus is the estimation of the noise variance, which is an important and unresolved issue when the number of…
We derive the critical behavior of a CA traffic flow model using an order parameter breaking the symmetry of the jam-free phase. Random braking appears to be the symmetry-breaking field conjugate to the order parameter. For $v_{\max}=2$, we…
The phase diagrams and transitions of nonequilibrium systems with multiplicative noise are studied theoretically. We show the existence of both strong and weak-coupling critical behavior, of two distinct active phases, and of a nonzero…
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.…
Recently it has been aroused a great interest about explosive (i.e., discontinuous) transitions. They manifest in distinct systems, such as synchronization in coupled oscillators, percolation regime, absorbing phase transitions and more…
We investigate the q-voter model with stochastic noise arising from independence on complex networks. Using the pair approximation, we provide a comprehensive, mathematical description of its behavior and derive a formula for the critical…
Non-uniform hypergraphs appear in various domains of computer science as in the satisfiability problems and in data analysis. We analyse a general model where the probability for an edge of size $t$ to belong to the hypergraph depends of a…
Communication noise is a common feature in several real-world scenarios where systems of agents need to communicate in order to pursue some collective task. In particular, many biologically inspired systems that try to achieve agreements on…
In this paper, we study the phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a group of non-mobile agents form either a fixed connected…