Abstract

We study a binary dynamical process that is a representation of the voter model with two candidates and opinion makers. The voters are represented by nodes of a network of social contacts with internal states labeled 0 or 1 and nodes that are connected can influence each other. The network is also perturbed by opinion makers, a set of external nodes whose states are frozen in 0 or 1 and that can influence all nodes of the network. The quantity of interest is the probability of finding m nodes in state 1 at time t. Here we study this process on star networks, which are simple representations of hubs found in complex systems, and compare the results with those obtained for networks that are fully connected. In both cases a transition from disordered to ordered equilibrium states is observed as the number of external nodes becomes small. For fully connected networks the probability distribution becomes uniform at the critical point. For star networks, on the other hand, we show that the equilibrium distribution splits in two peaks, reflecting the two possible states of the central node. We obtain approximate analytical solutions for the equilibrium distribution that clarify the role of the central node in the process. We show that the network topology also affects the time scale of oscillations in single realizations of the dynamics, which are much faster for the star network. Finally, extending the analysis to two stars we compare our results with simulations in simple scale-free networks.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.