相关论文: On the exit probability of the one dimensional q-v…

We present in this paper an approximation that is able to give an analytical expression for the exit probability of the $q$-voter model in one dimension. This expression gives a better fit for the more recent data about simulations in large…

We formulate and investigate the nonlinear $q$-voter model (which as special cases includes the linear voter and the Sznajd model) on a one dimensional lattice. We derive analytical formula for the exit probability and show that it agrees…

We revisit the deduction of the exit probability of the one dimensional Sznajd model through the Kirkwood approximation [F. Slanina et al., Europhys. Lett. 82, 18006 (2008)]. This approximation is peculiar in that in spite of the agreement…

We introduce a non-linear variant of the voter model, the q-voter model, in which q neighbors (with possible repetition) are consulted for a voter to change opinion. If the q neighbors agree, the voter takes their opinion; if they do not…

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…

Probing deeper into the existing issues regarding the exit probability (EP) in one dimensional dynamical models, we consider several models where the states are represented by Ising spins and the information flows inwards. At zero…

The paper considers the problem of out-of-sample risk estimation under the high dimensional settings where standard techniques such as $K$-fold cross validation suffer from large biases. Motivated by the low bias of the leave-one-out cross…

We study a generalization of the voter model on complex networks, focusing on the scaling of mean exit time. Previous work has defined the voter model in terms of an initially chosen node and a randomly chosen neighbor, which makes it…

We study the long-time behavior of the probability density Q_t of the first exit time from a bounded interval [-L,L] for a stochastic non-Markovian process h(t) describing fluctuations at a given point of a two-dimensional, infinite in both…

We investigate the Majority-Vote Model with two states ($-1,+1$) and a noise $q$ on Apollonian networks. The main result found here is the presence of the phase transition as a function of the noise parameter $q$. We also studies de effect…

The $q$-voter model with independence is investigated on multiplex networks with fully overlapping layers in the form of various complex networks corresponding to different levels of social influence. Detailed studies are performed for the…

Previous work in hierarchical reinforcement learning has faced a dilemma: either ignore the values of different possible exit states from a subroutine, thereby risking suboptimal behavior, or represent those values explicitly thereby…

This paper is concerned with the phase estimation algorithm in quantum computing algorithms, especially the scenarios where (1) the input vector is not an eigenvector; (2) the unitary operator is not exactly implemented; (3) random…

The goal of this work is to find the asymptotics of the hitting probability of a distant point for the voter model on the integer lattice started from a single 1 at the origin. In dimensions 2 or 3, we obtain the precise asymptotic behavior…

We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of…

In the $q$-voter model, the voter at $x$ changes its opinion at rate $f_x^q$, where $f_x$ is the fraction of neighbors with the opposite opinion. Mean-field calculations suggest that there should be coexistence between opinions if $q<1$ and…

We study variants of one-dimensional q-color voter models in discrete time. In addition to the usual voter model transitions in which a color is chosen from the left or right neighbor of a site there are two types of noisy transitions. One…

The q-voter model is a spin-flip system in which the rate of flipping to type i is given by the qth power of the proportion of nearest neighbours in type i for $i=0,1$. If $q=1$ it reduces to the classical voter model. We show that in the…

The current paper studies the problem of agnostic $Q$-learning with function approximation in deterministic systems where the optimal $Q$-function is approximable by a function in the class $\mathcal{F}$ with approximation error $\delta \ge…

We introduce the threshold $q$-voter opinion dynamics where an agent, facing a binary choice, can change its mind when at least $q_0$ amongst $q$ neighbors share the opposite opinion. Otherwise, the agent can still change its mind with a…