Related papers: Majority-vote model on random graphs
We have simulated the three-dimensional Heisenberg model on simple cubic lattices, using the single-cluster Monte Carlo update algorithm. The expected pronounced reduction of critical slowing down at the phase transition is verified. This…
The associationist account for early word-learning is based on the co-occurrence between objects and words. Here we examine the performance of a simple associative learning algorithm for acquiring the referents of words in a…
Principal component analysis (PCA) aims at estimating the direction of maximal variability of a high-dimensional dataset. A natural question is: does this task become easier, and estimation more accurate, when we exploit additional…
A uniformly random graph on $n$ vertices with a fixed degree sequence, obeying a $\gamma$ subpower law, is studied. It is shown that, for $\gamma>3$, in a subcritical phase with high probability the largest component size does not exceed…
Brain rhythms contribute to every aspect of brain function. Here, we study critical and resonance phenomena that precede the emergence of brain rhythms. Using an analytical approach and simulations of a cortical circuit model of neural…
Cohesion plays a crucial role in achieving collective goals, promoting cooperation and trust, and improving efficiency within social groups. To gain deeper insights into the dynamics of group cohesion, we have extended our previous model of…
This paper develops a neural jamming phase diagram that interprets the emergence of consciousness in large language models as a critical phenomenon in high-dimensional disordered systems.By establishing analogies with jamming transitions in…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Majority bootstrap percolation is a monotone cellular automata that can be thought of as a model of infection spreading in networks. Starting with an initially infected set, new vertices become infected once more than half of their…
The noise sensitivity of a Boolean function describes its likelihood to flip under small perturbations of its input. Introduced in the seminal work of Benjamini, Kalai and Schramm [Inst. Hautes \'{E}tudes Sci. Publ. Math. 90 (1999) 5-43],…
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…
Second-order phase transitions are characterised by critical scaling and universality. The singular behaviour of thermodynamic quantities at the transition, in particular, is determined by critical exponents of the universality class of the…
We describe non-equilibrium phase transitions in arrays of dynamical systems with cubic nonlinearity driven by multiplicative Gaussian white noise. Depending on the sign of the spatial coupling we observe transitions to ferromagnetic or…
We show that a simple model for the propagation of a rumor on a small-world network exhibits critical behavior at a finite randomness of the underlying graph. The transition occurs between a regime where the rumor "dies" in a small…
We provide a simple, unified approach to describing the impact of super-sample covariance, or beat coupling, on power spectrum estimation in a finite-volume survey. For a wide range of survey volumes, the sample variance that arises from…
We present numerical evidence from Monte Carlo simulations that the superfluid-insulator quantum phase transition of interacting bosons subject to strong disorder in one dimension is controlled by the strong-randomness critical point. At…
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…
We present a detailed study of the evolution of the number of connected components in sub-critical multiplicative random graph processes. We consider a model where edges appear independently after an exponential time at rate equal to the…
We study the Fredrickson-Andersen j-spin facilitated model and the noisy majority vote process on connected infinite graphs satisfying suitable expansion properties. For the former, we consider the out-of-equilibrium regime where the…
Given a transition matrix $P$ indexed by a finite set $V$ of vertices, the voter model is a discrete-time Markov chain in $\{0,1\}^V$ where at each time-step a randomly chosen vertex $x$ imitates the opinion of vertex $y$ with probability…