相关论文: Majority-vote model on directed Erdos-Renyi random…

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…

We evaluate the ensemble averaged noise in a chaotic quantum dot subject to DC bias and a periodic perturbation of frequency $\Omega$. The noise displays cusps at bias $V_n=n\hbar\Omega/e$ that survive the average, even when the period of…

The q-voter model, a variant of the classic voter model, has been analyzed by several authors: while allowing to study opinion dynamics, this model is also believed to be one of the most representative among the many defined in the wide…

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…

We investigate synchronization in the Kuramoto model with noise on a star graph. By revising the case of a complete graph, we propose a closed form of self-consistency equation for the conventional order parameter and generalize it for a…

We consider the following distributed consensus problem: Each node in a complete communication network of size $n$ initially holds an \emph{opinion}, which is chosen arbitrarily from a finite set $\Sigma$. The system must converge toward a…

We consider a natural variant of the Erd\H{o}s-R\'enyi random graph process in which $k$ vertices are special and are never put into the same connected component. The model is natural and interesting on its own, but is actually inspired by…

We consider the average probability X of being informed on a gossip in a given social network. The network is modeled within the random graph theory of Erdos and Renyi. In this theory, a network is characterized by two parameters: the size…

We consider two consensus formation models coupled to Barabasi-Albert networks, namely the Majority Vote model and Biswas-Chatterjee-Sen model. Recent works point to a non-universal behavior of the Majority Vote model, where the critical…

We develop a maximum-likelihood based method for regression in a setting where the dependent variable is a random graph and covariates are available on a graph-level. The model generalizes the well-known $\beta$-model for random graphs by…

We study analytically a variant of the one-dimensional majority-vote model in which the individual retains its opinion in case there is a tie among the neighbors' opinions. The individuals are fixed in the sites of a ring of size $L$ and…

We study a \emph{Plurality-Consensus} process in which each of $n$ anonymous agents of a communication network initially supports an opinion (a color chosen from a finite set $[k]$). Then, in every (synchronous) round, each agent can revise…

We investigate the quantum phase transitions of a disordered nanowire from superconducting to metallic behavior by employing extensive Monte Carlo simulations. To this end, we map the quantum action onto a (1+1)-dimensional classical XY…

A Monte Carlo algorithm is proposed to simulate ferromagnetic q-state Potts model for any real q>0. A single update is a random sequence of disordering and deterministic moves, one for each link of the lattice. A disordering move attributes…

Majority voting is one of the few black-box interventions that can improve a fixed stochastic predictor: repeated access can be cheaper than changing a high-capability model. Classical fixed-competence theory makes this intervention look…

It is of particular interest to reconstruct or estimate bandlimited graph signals, which are smoothly varying signals defined over graphs, from partial noisy measurements. However, choosing an optimal subset of nodes to sample is NP-hard.…

Consider the complete graph \(K_n\) on \(n\) vertices where each edge \(e\) is independently open with probability \(p_n(e)\) or closed otherwise. Here \(\frac{C-\alpha_n}{n} \leq p_n(e) \leq \frac{C+\alpha_n}{n}\) where \(C > 0\) is a…

We numerically study the measurement-driven quantum phase transition of Haar-random quantum circuits in $1+1$ dimensions. By analyzing the tripartite mutual information we are able to make a precise estimate of the critical measurement rate…

We propose a generic model for multiple choice situations in the presence of herding and compare it with recent empirical results from a Web-based music market experiment. The model predicts a phase transition between a weak imitation phase…

We study a $U(1)\times U(1)$ system in (2+1)-dimensions with long-range interactions and mutual statistics. The model has the same form after the application of operations from the modular group, a property which we call modular invariance.…