相关论文: Majority-vote model on random graphs

We investigate how correlations between the diversity of the connectivity of networks and the dynamics at their nodes affect the macroscopic behavior. In particular, we study the synchronization transition of coupled stochastic phase…

We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…

The natural measure in a map with type-III intermittent chaos is used to define critical exponents for the average of a variable from a dynamical system near bifurcation. Numerical experiments were done with maps and verify the analytical…

In the present paper we examine the effects of noise on Monte Carlo algorithms, a problem raised previously by Kennedy and Kuti (Phys. Rev. Lett. {\bf 54}, 2473 (1985)). We show that the effects of introducing unbiased noise into the…

Using Monte Carlo techniques and a star-triangle transformation, Ising models with random, 'strong' and 'weak', nearest-neighbour ferromagnetic couplings on a square lattice with a (1,1) surface are studied near the phase transition. Both…

We study the joint components in a random `double graph' that is obtained by superposing red and blue binomial random graphs on $n$~vertices. A joint component is a maximal set of vertices, which contains both a red and a blue spanning…

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…

Building on recent work by Medvedev (2014) we establish new connections between a basic consensus model, called the voting model, and the theory of graph limits. We show that in the voting model if consensus is attained in the continuum…

The ferromagnet-to-paramagnet transition of the four-dimensional random-field Ising model with Gaussian distribution of the random fields is studied. Exact ground states of systems with sizes up to 32^4 are obtained using graph theoretical…

We study both numerically and analytically what happens to a random graph of average connectivity "alpha" when its leaves and their neighbors are removed iteratively up to the point when no leaf remains. The remnant is made of isolated…

We compute the large $N$ critical exponents $\eta$, $\eta_\phi$ and $1/\nu$ in $d$-dimensions in the chiral Heisenberg Gross-Neveu model to several orders in powers of $1/N$. For instance, the large $N$ conformal bootstrap method is used to…

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…

Uncertainty quantification is vital for decision-making and risk assessment in machine learning. Mean-variance regression models, which predict both a mean and residual noise for each data point, provide a simple approach to uncertainty…

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…

In this article we introduce a simple tool to derive polynomial upper bounds for the probability of observing unusually large maximal components in some models of random graphs when considered at criticality. Specifically, we apply our…

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…

The onset of synchronization in a system of random frequency oscillators coupled through a random network is investigated. Using a mean-field approximation, we characterize sample-to-sample fluctuations for networks of finite size, and…

We consider a class of random loop models (including the random interchange process) that are parametrised by a time parameter $\beta\geq 0$. Intuitively, larger $\beta$ means more randomness. In particular, at $\beta=0$ we start with loops…

Let $P(n,M)$ be a graph chosen uniformly at random from the family of all labeled planar graphs with $n$ vertices and $M$ edges. In the paper we study the component structure of $P(n,M)$. Combining counting arguments with analytic…

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.…