Most of the work on opinion dynamics models focuses on the case of two or three opinion types. We consider the case of an arbitrary number of opinions in the mean field case of the naming game model in which it is assumed the population is infinite and all individuals are neighbors. A particular challenge of the naming game model is that the number of variables, which corresponds to the number of possible sets of opinions, grows exponentially with the number of possible opinions. We present a method for generating mean field dynamical equations for the general case of k opinions. We calculate the steady states in two important special cases in arbitrarily high dimension: the case in which there exist zealots of only one type, and the case in which there are an equal number of zealots for each opinion. We show that in these special cases a phase transition occurs at critical values p(c) of the parameter p describing the fraction of zealots. In the former case, the critical value determines the threshold value beyond which it is not possible for the opinion with no zealots to be held by more nodes than the opinion with zealots, and this point remains fixed regardless of dimension. In the latter case, the critical point p(c) is the threshold value beyond which a stalemate between all k opinions is guaranteed, and we show that it decays precisely as a lognormal curve in k.

Abstract. There is still much to discover about the mechanisms and nature of discontinuous percolation transitions. Much of the past work considers graph evolution algorithms known as Achlioptas processes in which a single edge is added to the graph from a set of k randomly chosen candidate edges at each timestep until a giant component emerges. Several Achlioptas processes seem to yield a discontinuous percolation transition, but it was proven by Riordan and Warnke that the transition must be continuous in the thermodynamic limit. However, they also proved that if the number k(n) of candidate edges increases with the number of nodes, then the percolation transition may be discontinuous. Here we attempt to find the simplest such process which yields a discontinuous transition in the thermodynamic limit. We introduce a process which considers only the degree of candidate edges and not component size. We calculate the critical point tc = (1 − θ( . If k(n) grows very slowly, for example k(n) = log n, the critical window is barely sublinear and hence the phase transition is discontinuous but appears continuous in finite systems. We also present arguments that Achlioptas processes with bounded size rules will always have continuous percolation transitions even with infinite choice.

The "power of choice" has been shown to radically alter the behavior of a number of randomized algorithms. Here we explore the effects of choice on models of tree and network growth. In our models each new node has k randomly chosen contacts, where k > 1 is a constant. It then attaches to whichever one of these contacts is most desirable in some sense, such as its distance from the root or its degree. Even when the new node has just two choices, i.e., when k = 2, the resulting network can be very different from a random graph or tree. For instance, if the new node attaches to the contact which is closest to the root of the tree, the distribution of depths changes from Poisson to a traveling wave solution. If the new node attaches to the contact with the smallest degree, the degree distribution is closer to uniform than in a random graph, so that with high probability there are no nodes in the network with degree greater than O(log log N). Finally, if the new node attaches to the contact with the largest degree, we find that the degree distribution is a power law with exponent −1 up to degrees roughly equal to k, with an exponential cutoff beyond that; thus, in this case, we need k 1 to see a power law over a wide range of degrees.

No abstract

No abstract