Critical exponents of master-node network model.

The dynamics of competing opinions in social network plays an important role in society, with many applications in diverse social contexts such as consensus, election, morality, and so on. Here, we study a model of interacting agents connected in networks in order to analyze their decision stochastic process. We consider a first-neighbor interaction between agents in a one-dimensional network with the shape of ring topology. Moreover, some agents are also connected to a hub, or master node, who has preferential choice or bias. Such connections are quenched. As the main results, we observed a continuous nonequilibrium phase transition to an absorbing state as a function of control parameters. By using the finite-size scaling method we analyzed the static and dynamic critical exponents to show that this model probably cannot match any universality class already known.

Basin sizes depend on stable eigenvalues in the Kuramoto model.

We show that for the Kuramoto model (with identical phase oscillators equally coupled), its global statistics and size of the basins of attraction can be estimated through the eigenvalues of all stable (frequency) synchronized states. This result is somehow unexpected since, by doing that, one could just use a local analysis to obtain the global dynamic properties. But recent works based on Koopman and Perron-Frobenius operators demonstrate that the global features of a nonlinear dynamical system, with some specific conditions, are somehow encoded in the local eigenvalues of its equilibrium states. Recognized numerical simulations in the literature reinforce our analytical results.

Sparsity-driven synchronization in oscillator networks.

The emergence of synchronized behavior is a direct consequence of networking dynamical systems. Naturally, strict instances of this phenomenon, such as the states of complete synchronization, are favored or even ensured in networks with a high density of connections. Conversely, in sparse networks, the system state-space is often shared by a variety of coexistent solutions. Consequently, the convergence to complete synchronized states is far from being certain. In this scenario, we report the surprising phenomenon in which completely synchronized states are made the sole attractor of sparse networks by removing network links, the sparsity-driven synchronization. This phenomenon is observed numerically for nonlocally coupled Kuramoto networks and verified analytically for locally coupled ones. In addition, we unravel the bifurcation scenario underlying the network transition to completely synchronized behavior. Furthermore, we present a simple procedure, based on the bifurcations in the thermodynamic limit, that determines the minimum number of links to be removed in order to ensure complete synchronization. Finally, we propose an application of the reported phenomenon as a control scheme to drive complete synchronization in high connectivity networks.