There are numerous examples of studied real-world systems that can be described as dynamical systems characterized by individual phases and coupled in a networklike structure. Within the framework of oscillatory models, much attention has been devoted to the Kuramoto model, which considers a collection of oscillators interacting through a sinus function of the phase differences. In this paper, we draw on an extension of the Kuramoto model, called the Kuramoto-Sakaguchi model, which adds a phase lag parameter to each node. We construct a general formalism that allows us to compute the set of lag parameters that may lead to any phase configuration within a linear approximation. In particular, we devote special attention to the cases of full synchronization and symmetric configurations. We show that the set of natural frequencies, phase lag parameters, and phases at the steady state is coupled by an equation and a continuous spectra of solutions is feasible. In order to quantify the system's strain to achieve that particular configuration, we define a cost function and compute the optimal set of parameters that minimizes it. Despite considering a linear approximation of the model, we show that the obtained tuned parameters for the case of full synchronization enhance frequency synchronization in the nonlinear model as well.

Complex networks are essentially heterogeneous not only in the basic properties of the constituent nodes, such as their degree, but also in the effects that these have on the global dynamical properties of the network. Networks of coupled identical phase oscillators are good examples for analyzing these effects, since an overall synchronized state can be considered a reference state. A small variation of intrinsic node parameters may cause the system to move away from synchronization, and a new phase-locked stationary state can be achieved. We propose a measure of phase dispersion that quantifies the functional response of the system to a given local perturbation. As a particular implementation, we propose a variation of the standard Kuramoto model in which the nodes of a complex network interact with their neighboring nodes, by including a node-dependent frustration parameter. The final stationary phase-locked state now depends on the particular frustration parameter at each node and also on the network topology. We exploit this scenario by introducing individual frustration parameters and measuring what their effect on the whole network is, measured in terms of the phase dispersion, which depends only on the topology of the network and on the choice of the particular node that is perturbed. This enables us to define a characteristic of the node, its functionability, that can be computed analytically in terms of the network topology. Finally, we provide a thorough comparison with other centrality measures.

The explosion of network science has permitted an understanding of how the structure of social networks affects the dynamics of social contagion. In community-based interventions with spill-over effects, identifying influential spreaders may be harnessed to increase the spreading efficiency of social contagion, in terms of time needed to spread all the largest connected component of the network. Several strategies have been proved to be efficient using only data and simulation-based models in specific network topologies without a consensus of an overall result. Hence, the purpose of this paper is to benchmark the spreading efficiency of seeding strategies related to network structural properties and sizes. We simulate spreading processes on empirical and simulated social networks within a wide range of densities, clustering coefficients, and sizes. We also propose three new decentralized seeding strategies that are structurally different from well-known strategies: community hubs, ambassadors, and random hubs. We observe that the efficiency ranking of strategies varies with the network structure. In general, for sparse networks with community structure, decentralized influencers are suitable for increasing the spreading efficiency. By contrast, when the networks are denser, centralized influencers outperform. These results provide a framework for selecting efficient strategies according to different contexts in which social networks emerge. 

Populations of mobile agents—animal groups, robot swarms, or crowds of people—self-organize into a large diversity of states as a result of information exchanges with their surroundings. While in many situations of interest the motion of the agents is driven by the transmission of information from neighboring peers, previous modeling efforts have overlooked the feedback between motion and information spreading. Here we show that such a feedback results in contagion enhanced by flocking. We introduce a reference model in which agents carry an internal state whose dynamics is governed by the susceptible-infected-susceptible (SIS) epidemic process, characterizing the spread of information in the population and affecting the way they move in space. This feedback triggers flocking, which is able to foster social contagion by reducing the epidemic threshold with respect to the limit in which agents interact globally. The velocity of the agents controls both the epidemic threshold and the emergence of complex spatial structures, or swarms. By bridging together soft active matter physics and modeling of social dynamics, we shed light upon a positive feedback mechanism driving the self-organization of mobile agents in complex systems.

Spatial networks are a powerful framework for studying a large variety of systems belonging to a broad diversity of contexts: from transportation to biology, from epidemiology to communications, and migrations, to cite a few. Spatial networks can be described in terms of their total cost (i.e., the total amount of resources needed for building or traveling their connections). Here, we address the issue of how to gauge and compare the quality of spatial network designs (i.e., efficiency vs. total cost) by proposing a two-step methodology. First, we assess the network's design by introducing a quality function based on the concept of network's efficiency. Second, we propose an algorithm to estimate computationally the upper bound of our quality function for a given network. Complementarily, we provide a universal expression to obtain an approximated upper bound to any spatial network, regardless of its size. Smaller differences between the upper bound and the empirical value correspond to better designs. Finally, we test the applicability of this analytic tool set on spatial network data-sets of different nature.

Diversity, understood as the variety of different elements or configurations that an extensive system has, is a crucial property that allows maintaining the system’s functionality in a changing environment, where failures, random events or malicious attacks are often unavoidable. Despite the relevance of preserving diversity in the context of ecology, biology, transport, finances, etc., the elements or configurations that more contribute to the diversity are often unknown, and thus, they can not be protected against failures or environmental crises. This is due to the fact that there is no generic framework that allows identifying which elements or configurations have crucial roles in preserving the diversity of the system. Existing methods treat the level of heterogeneity of a system as a measure of its diversity, being unsuitable when systems are composed of a large number of elements with different attributes and types of interactions. Besides, with limited resources, one needs to find the best preservation policy, i.e., one needs to solve an optimization problem. Here we aim to bridge this gap by developing a metric between labeled graphs to compute the diversity of the system, which allows identifying the most relevant components, based on their contribution to a global diversity value. The proposed framework is suitable for large multiplex structures, which are constituted by a set of elements represented as nodes, which have different types of interactions, represented as layers. The proposed method allows us to find, in a genetic network (HIV-1), the elements with the highest diversity values, while in a European airline network, we systematically identify the companies that maximize (and those that less compromise) the variety of options for routes connecting different airports.

Participatory research keeps expanding to connect science and society through engaging projects using a multi-stakeholder strategy, including citizens. However, each participatory project follows different evaluation formats and strategies. This results in limiting evidences on best practices, hindering the scaling up of Participatory Research. Through the H2020-funded InSPIRES project, an innovative and online-based evaluation strategy was developed which is valid for Participatory Research initiatives labelled as Science Shops or Citizen Science. This strategy challenges those teams that want to undergo a self-reflection process during and after their project is active. An online-tool gathers and automatically analyses data in a harmonized way among projects. The tool delivers back a set of pieces of information through different visualizations which analyze each project’s process in five dimensions, selected-constructed after a careful revision of public engagement and impact evaluation criteria proposed by different projects and researchers. The dimensions evaluated by this online instrument are: (i) Knowledge Democracy, (ii) Citizen-led Research, (iii) Participatory Dynamics, (iv) Integrity, and (v) Transformative Change. Online-based self-evaluation questionnaires were designed and personalized according to the profile of the respondents and are sent out by email in four different stages to capture the momentum of the project, as well as its short-term and mid-term impacts. The quantitative and qualitative evaluation instrument is featured within the InSPIRES Open Platform (OP) which becomes an open repository that allows comparison among participatory projects.