Three-state opinion model with mobile agents.

We study an agent-based opinion model with two extreme (opposite) opinion states and a neutral intermediate one. We adjust the relative degree of conviction between extremists and neutrals through a dimensionless parameter called the "neutrality parameter" to investigate its impact on the outcome of the system. In our model, agents move randomly on a plane with periodic boundary conditions and interact with each other only when they are within a fixed distance threshold. We examine different movement mechanisms and their interplay with the neutrality parameter. Our results show that in general, mobility promotes the global consensus, especially for extreme opinions. However, it takes significantly less time to reach a consensus on the neutral opinion.

Influence of topology in the mobility enhancement of pulse-coupled oscillator synchronization.

In this work we revisit the nonmonotonic behavior (NMB) of synchronization time with velocity reported for systems of mobile pulse-coupled oscillators (PCOs). We devise a control parameter that allows us to predict in which range of velocities NMB may occur, also uncovering the conditions allowing us to establish the emergence of NMB based on specific features of the connectivity rule. Specifically, our results show that if the connectivity rule is such that the interaction patterns are sparse and, more importantly, include a large fraction of nonreciprocal interactions, then the system will display NMB. We furthermore provide a microscopic explanation relating the presence of such features of the connectivity patterns to the existence of local clusters unable to synchronize, termed frustrated clusters, for which we also give a precise definition in terms of simple graph concepts. We conclude that, if the probability of finding a frustrated cluster in a system of moving PCOs is high enough, NMB occurs in a predictable range of velocities.

Replicator dynamics with diffusion on multiplex networks.

In this study we present an extension of the dynamics of diffusion in multiplex graphs, which makes the equations compatible with the replicator equation with mutations. We derive an exact formula for the diffusion term, which shows that, while diffusion is linear for numbers of agents, it is necessary to account for nonlinear terms when working with fractions of individuals. We also derive the transition probabilities that give rise to such macroscopic behavior, completing the bottom-up description. Finally, it is shown that the usual assumption of constant population sizes induces a hidden selective pressure due to the diffusive dynamics, which favors the increase of fast diffusing strategies.

Active and reactive behaviour in human mobility: the influence of attraction points on pedestrians.

Human mobility is becoming an accessible field of study, thanks to the progress and availability of tracking technologies as a common feature of smart phones. We describe an example of a scalable experiment exploiting these circumstances at a public, outdoor fair in Barcelona (Spain). Participants were tracked while wandering through an open space with activity stands attracting their attention. We develop a general modelling framework based on Langevin dynamics, which allows us to test the influence of two distinct types of ingredients on mobility: reactive or context-dependent factors, modelled by means of a force field generated by attraction points in a given spatial configuration and active or inherent factors, modelled from intrinsic movement patterns of the subjects. The additive and constructive framework model accounts for some observed features. Starting with the simplest model (purely random walkers) as a reference, we progressively introduce different ingredients such as persistence, memory and perceptual landscape, aiming to untangle active and reactive contributions and quantify their respective relevance. The proposed approach may help in anticipating the spatial distribution of citizens in alternative scenarios and in improving the design of public events based on a facts-based approach.

Role of adjacency-matrix degeneracy in maximum-entropy-weighted network models.

Complex network null models based on entropy maximization are becoming a powerful tool to characterize and analyze data from real systems. However, it is not easy to extract good and unbiased information from these models: A proper understanding of the nature of the underlying events represented in them is crucial. In this paper we emphasize this fact stressing how an accurate counting of configurations compatible with given constraints is fundamental to build good null models for the case of networks with integer-valued adjacency matrices constructed from an aggregation of one or multiple layers. We show how different assumptions about the elements from which the networks are built give rise to distinctively different statistics, even when considering the same observables to match those of real data. We illustrate our findings by applying the formalism to three data sets using an open-source software package accompanying the present work and demonstrate how such differences are clearly seen when measuring network observables.

Spectral properties of the Laplacian of multiplex networks.

One of the more challenging tasks in the understanding of dynamical properties of models on top of complex networks is to capture the precise role of multiplex topologies. In a recent paper, Gómez et al. [Phys. Rev. Lett. 110, 028701 (2013)], some of the authors proposed a framework for the study of diffusion processes in such networks. Here, we extend the previous framework to deal with general configurations in several layers of networks and analyze the behavior of the spectrum of the Laplacian of the full multiplex. We derive an interesting decoupling of the problem that allow us to unravel the role played by the interconnections of the multiplex in the dynamical processes on top of them. Capitalizing on this decoupling we perform an asymptotic analysis that allow us to derive analytical expressions for the full spectrum of eigenvalues. This spectrum is used to gain insight into physical phenomena on top of multiplex, specifically, diffusion processes and synchronizability.

Diffusion dynamics on multiplex networks.

We study the time scales associated with diffusion processes that take place on multiplex networks, i.e., on a set of networks linked through interconnected layers. To this end, we propose the construction of a supra-laplacian matrix, which consists of a dimensional lifting of the laplacian matrix of each layer of the multiplex network. We use perturbative analysis to reveal analytically the structure of eigenvectors and eigenvalues of the complete network in terms of the spectral properties of the individual layers. The spectrum of the supra-laplacian allows us to understand the physics of diffusionlike processes on top of multiplex networks.

Tuning synchronization of integrate-and-fire oscillators through mobility.

We analyze the emergence of synchronization in a population of moving integrate-and-fire oscillators. Oscillators, while moving on a plane, interact with their nearest neighbor upon firing time. We discover a nonmonotonic dependence of the synchronization time on the velocity of the agents. Moreover, we find that mechanisms that drive synchronization are different for different dynamical regimes. We report the extreme situation where an interplay between the time scales involved in the dynamical processes completely inhibits the achievement of a coherent state. We also provide estimators for the transitions between the different regimes.

Statistical mechanics of multiedge networks.

Statistical properties of binary complex networks are well understood and recently many attempts have been made to extend this knowledge to weighted ones. There are, however, subtle yet important considerations to be made regarding the nature of the weights used in this generalization. Weights can be either continuous or discrete magnitudes, and in the latter case, they can additionally have undistinguishable or distinguishable nature. This fact has not been addressed in the literature insofar and has deep implications on the network statistics. In this work we face this problem introducing multiedge networks as graphs where multiple (distinguishable) connections between nodes are considered. We develop a statistical mechanics framework where it is possible to get information about the most relevant observables given a large spectrum of linear and nonlinear constraints including those depending both on the number of multiedges per link and their binary projection. The latter case is particularly interesting as we show that binary projections can be understood from multiedge processes. The implications of these results are important as many real-agent-based problems mapped onto graphs require this treatment for a proper characterization of their collective behavior.

Efficiency of informational transfer in regular and complex networks.

We analyze the process of informational exchange through complex networks by measuring network efficiencies. Aiming to study nonclustered systems, we propose a modification of this measure on the local level. We apply this method to an extension of the class of small worlds that includes declustered networks and show that they are locally quite efficient, although their clustering coefficient is practically zero. Unweighted systems with small-world and scale-free topologies are shown to be both globally and locally efficient. Our method is also applied to characterize weighted networks. In particular we examine the properties of underground transportation systems of Madrid and Barcelona and reinterpret the results obtained for the Boston subway network.

Self-similar community structure in a network of human interactions.

We propose a procedure for analyzing and characterizing complex networks. We apply this to the social network as constructed from email communications within a medium sized university with about 1700 employees. Email networks provide an accurate and nonintrusive description of the flow of information within human organizations. Our results reveal the self-organization of the network into a state where the distribution of community sizes is self-similar. This suggests that a universal mechanism, responsible for emergence of scaling in other self-organized complex systems, as, for instance, river networks, could also be the underlying driving force in the formation and evolution of social networks.

Optimal network topologies for local search with congestion.

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.

Modeling diffusion of innovations in a social network.

A simple model of diffusion of innovations in a social network with upgrading costs is introduced. Agents are characterized by a single real variable, their technological level. According to local information, agents decide whether to upgrade their level or not, balancing their possible benefit with the upgrading cost. A critical point where technological avalanches display a power-law behavior is also found. This critical point is characterized by a macroscopic observable that turns out to optimize technological growth in the stationary state. Analytical results supporting our findings are found for the globally coupled case.

Communication in networks with hierarchical branching.

We present a simple model of communication in networks with hierarchical branching. We analyze the behavior of the model from the viewpoint of critical systems under different situations. For certain values of the parameters, a continuous phase transition between a sparse and a congested regime is observed and accurately described by an order parameter and the power spectra. At the critical point the behavior of the model is totally independent of the number of hierarchical levels. Also scaling properties are observed when the size of the system varies. The presence of noise in the communication is shown to break the transition. The analytical results are a useful guide to forecasting the main features of real networks.

Self-organized evolution in a socioeconomic environment.

We propose a general scenario to analyze technological changes in socio-economic environments. We illustrate the ideas with a model that incorporating the main trends is simple enough to extract analytical results and, at the same time, sufficiently complex to display a rich dynamic behavior. Our study shows that there exists a macroscopic observable that is maximized in a regime where the system is critical, in the sense that the distribution of events follow power laws. Computer simulations show that, in addition, the system always self-organizes to achieve the optimal performance in the stationary state.

Synchronization, diversity, and topology of networks of integrate and fire oscillators

We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention on the interplay between topological disorder and synchronization features of networks. First, we analyze synchronization time T in random networks, and find a scaling law which relates T to network connectivity. Then, we compare synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than a disordered network. This fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to having a nonrandom topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.

Pattern selection in a lattice of pulse-coupled oscillators.

We study spatio-temporal pattern formation in a ring of N oscillators with inhibitory unidirectional pulselike interactions. The attractors of the dynamics are limit cycles where each oscillator fires once and only once. Since some of these limit cycles lead to the same pattern, we introduce the concept of pattern degeneracy to take it into account. Moreover, we give a qualitative estimation of the volume of the basin of attraction of each pattern by means of some probabilistic arguments and pattern degeneracy, and show how they are modified as we change the value of the coupling strength. In the limit of small coupling, our estimative formula gives a perfect agreement with numerical simulations.