Related papers: Voter models on weighted networks
In the information overloaded web, personalized recommender systems are essential tools to help users find most relevant information. The most heavily-used recommendation frameworks assume user interactions that are characterized by a…
We consider a model of binary opinion dynamics where one opinion is inherently 'superior' than the other and social agents exhibit a 'bias' towards the superior alternative. Specifically, it is assumed that an agent updates its choice to…
The spread of disease on complex networks has attracted widely attention in the physics community. Recent works have demonstrated that heterogeneous degree and weight distributions have a significant influence on the epidemic dynamics. In…
The spread of perturbative signals in complex networks is governed by the combined effect of the network topology and its intrinsic nonlinear dynamics. Recently, the resulting spreading patterns have been analyzed and predicted, shown to…
We derive the sampling properties of random networks based on weights whose pairwise products parameterize independent Bernoulli trials. This enables an understanding of many degree-based network models, in which the structure of realized…
In this paper, a new framework to study weighed networks is introduced. The idea behind this methodology is to consider that each node of the network is an agent that desires to satisfy his/her preferences in an economic sense. Moreover,…
We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement…
Voting systems typically treat all voters equally. We argue that perhaps they should not: Voters who have supported good choices in the past should be given higher weight than voters who have supported bad ones. To develop a formal…
We introduce a growing network model in which a new node attaches to a randomly-selected node, as well as to all ancestors of the target node. This mechanism produces a sparse, ultra-small network where the average node degree grows…
Based on a recently proposed non-equilibrium mechanism for spatial pattern formation [cond-mat/0312366] we study how morphogenesis can be controlled by locally coupled discrete dynamical networks, similar to gene regulation networks of…
We study a mean field model of a complex network, focusing on edge and triangle densities. Our first result is the derivation of a variational characterization of the entropy density, compatible with the infinite node limit. We then…
We study a coevolution voter model on a network that evolves according to the state of the nodes. In a single update, a link between opposite-state nodes is rewired with probability $p$, while with probability $1-p$ one of the nodes takes…
Many social, technological, biological, and economical systems are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the connection weights among their nodes. However, most…
We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node…
Committee-selection problems arise in many contexts and applications, and there has been increasing interest within the social choice research community on identifying which properties are satisfied by different multi-winner voting rules.…
In the evolving voter model, when an individual interacts with a neighbor having an opinion different from theirs, they will with probability $1-\alpha$ imitate the neighbor but with probability $ \alpha$ will sever the connection and…
We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…
Structure and dynamics of complex networks usually deal with degree distributions, clustering, shortest path lengths and other graph properties. Although these concepts have been analysed for graphs on abstract spaces, many networks happen…
We consider a modification of the adaptive contact process which, interpreted in the context of opinion dynamics, breaks the symmetry of the coevolutionary voter model by assigning to each node type a different strategy to promote…
We study the dynamics of opinion formation in a heterogeneous voter model on a complete graph, in which each agent is endowed with an integer fitness parameter $k \ge 0$, in addition to its $+$ or $-$ opinion state. The evolution of the…