arXiv subjects

Albert Diaz-Guilera

Publications and source records attributed to Albert Diaz-Guilera.

At least 19 recordsLinked to original sources

arXiv2024

Asymmetric Opinion Formation of Emotional Eccitable Agents

The bounded confidence model represents a widely adopted framework for modeling opinion dynamics wherein actors have a continuous-valued opinion and interact and approach their positions in the opinion space only if their opinions are within a specified confidence threshold. Here, we propose a novel framework where the confidence bound is determined by a decreasing function of their emotional arousal, an additional independent variable distinct from the opinion value. Additionally, our framework accounts for agents' ability to broadcast messages, with interactions influencing the timing of each other's message emissions. Our findings underscore the significant role of synchronization in shaping consensus formation. Furthermore, we demonstrate that variable confidence intervals alter the impact of step length when navigating the opinion space, leading to deviations from observations in the traditional Deffuant model.

physics.soc-ph↗

arXiv2020

Comparing spatial networks: A 'one size fits all' efficiency-driven approach

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. Firstly, 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.

physics.soc-ph↗

arXiv2019

Flocking and spreading dynamics in populations of self-propelled agents

Populations of self-propelled mobile agents - animal groups, robot swarms or crowds of people - that exchange information with their surrounding, host fascinating cooperative behaviors. While in many situations of interest the agents motion is driven by the transmission of information (e.g. the presence of an approaching predator) from neighboring peers, previous modeling efforts have focused on situations where agents either sit on static networks, or move independently of the information spreading across the population. Here, we introduce a reference model to tackle this current lack of general framework. We consider mobile agents which align their direction of motion (based on the Kuramoto dynamics) and carry an internal state governed by the Susceptible-Infected-Susceptible (SIS) epidemic process, characterizing the spread of information in the population, and affecting the way agents move in space. We show that the feedback between the agents motion and information spreading is responsible for (i) the enhancement of both flocking and information spreading, (ii) the emergence of complex spatial structures, or swarms, which can be controlled by the velocity of the agents. The SIS dynamics is able to drive a flocking phase transition even in the absence of explicit velocity-alignment, recovering a behavior reminiscent of Vicsek-like systems but featuring macro-phase separation rather than micro-phase separation. We show that the formation of dense swarms at low velocities reduces the epidemic threshold of information spreading with respect to the mean field limit. By bridging together soft active matter physics and agent based modeling of complex systems, we shed light upon a general positive feedback mechanism that crucially affects the collective behavior of mobile agents, providing a reference framework to study realistic situations where this mechanism is at play.

physics.soc-ph↗

arXiv2018

Synchronization Invariance Under Network Structural Transformations

Synchronization processes are ubiquitous despite the many connectivity patterns that complex systems can show. Usually, the emergence of synchrony is a macroscopic observable, however, the microscopic details of the system, as e.g. the underlying network of interactions, is many times partially or totally unknown. We already know that different interaction structures can give rise to a common functionality, understood as a common macroscopic observable. Building upon this fact, here, we propose network transformations that keep the collective behavior of a large system of Kuramoto oscillators functionally invariant. We derive a method based on information theory principles, that allows us to adjust the weights of the structural interactions to map random homogeneous -in degree- networks into random heterogeneous networks and vice-versa, keeping synchronization values invariant. The results of the proposed transformations reveal an interesting principle; heterogeneous networks can be mapped to homogeneous ones with local information, but the reverse process needs to exploit higher-order information. The formalism provides new analytical insight to tackle real complex scenarios when dealing with uncertainty in the measurements of the underlying connectivity structure.

physics.soc-ph↗

arXiv2018

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 non reciprocal 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.

nlin.AO↗

arXiv2017

Food-bridging: a new network construction to unveil the principles of cooking

In this manuscript we propose, analyse, and discuss a possible new principle behind traditional cuisine: the Food-bridging hypothesis and its comparison with the food-pairing hypothesis using the same dataset and graphical models employed in the food-pairing study by Ahn et al. [Scientific Reports, 1:196 (2011)]. The Food-bridging hypothesis assumes that if two ingredients do not share a strong molecular or empirical affinity, they may become affine through a chain of pairwise affinities. That is, in a graphical model as employed by Ahn et al., a chain represents a path that joints the two ingredients, the shortest path represents the strongest pairwise chain of affinities between the two ingredients. Food-pairing and Food-bridging are different hypotheses that may describe possible mechanisms behind the recipes of traditional cuisines. Food-pairing intensifies flavour by mixing ingredients in a recipe with similar chemical compounds, and food-bridging smoothes contrast between ingredients. Both food-pairing and food-bridging are observed in traditional cuisines, as shown in this work. We observed four classes of cuisines according to food-pairing and food-bridging: (1) East Asian cuisines, at one extreme, tend to avoid food-pairing as well as food-bridging; and (4) Latin American cuisines, at the other extreme, follow both principles. For the two middle classes: (2) Southeastern Asian cuisines, avoid food-pairing and follow food-bridging; and (3) Western cuisines, follow food-pairing and avoid food-bridging.

physics.soc-ph↗

arXiv2017

Stationary patterns in star networks of bistable units: Theory and application to chemical reactions

We present theoretical and experimental studies on pattern formation with bistable dynamical units coupled in a star network configuration. By applying a localized perturbation to the central or the peripheral elements, we demonstrate the subsequent spreading, pinning, or retraction of the activations; such analysis enables the characterization of the formation of stationary patterns of localized activity. The results are interpreted with a theoretical analysis of a simplified bistable reaction-diffusion model. Weak coupling results in trivial pinned states where the activation cannot propagate. At strong coupling, uniform state is expected with active or inactive elements at small or large degree networks respectively. Nontrivial stationary spatial pattern, corresponding to an activation pinning, is predicted to occur at intermediate number of peripheral elements and at intermediate coupling strengths, where the central activation of the network is pinned, but the peripheral activation propagates toward the center. The results are confirmed in experiments with star networks of bistable electrochemical reactions. The experiments confirm the existence of the stationary spatial patterns and the dependence of coupling strength on the number of peripheral elements for transitions between pinned and retreating or spreading fronts in forced network configurations (where the central or periphery elements are forced to maintain their states).

nlin.AO↗

arXiv2016

Chimera states in a network-organized public goods game with destructive agents

We found that a network-organized metapopulation of cooperators, defectors and destructive agents playing the public goods game with mutations, can collectively reach global synchronization or chimera states. Global synchronization is accompanied by a collective periodic burst of cooperation, whereas chimera states reflect the tendency of the networked metapopulation to be fragmented in clusters of synchronous and incoherent bursts of cooperation. Numerical simulations have shown that the system's dynamics alternates between these two steady states through a first order transition. Depending on the parameters determining the dynamical and topological properties, chimera states with different numbers of coherent and incoherent clusters are observed. Our results present the first systematic study of chimera states and their characterization in the context of evolutionary game theory. This provides a valuable insight into the details of their occurrence, extending the relevance of such states to natural and social systems.

nlin.AO↗

arXiv2016

Synchronization in dynamical networks of locally coupled self-propelled oscillators

Systems of mobile physical entities exchanging information with their neighborhood can be found in many different situations. The understanding of their emergent cooperative behaviour has become an important issue across disciplines, requiring a general conceptual framework in order to harvest the potential of these systems. We study the synchronization of coupled oscillators in time-evolving networks defined by the positions of self-propelled agents interacting in real space. In order to understand the impact of mobility in the synchronization process on general grounds, we introduce a simple model of self-propelled hard disks performing persistent random walks in 2$d$ space and carrying an internal Kuramoto phase oscillator. For non-interacting particles, self-propulsion accelerates synchronization. The competition between agent mobility and excluded volume interactions gives rise to a richer scenario, leading to an optimal self-propulsion speed. We identify two extreme dynamic regimes where synchronization can be understood from theoretical considerations. A systematic analysis of our model quantifies the departure from the latter ideal situations and characterizes the different mechanisms leading the evolution of the system. We show that the synchronization of locally coupled mobile oscillators generically proceeds through coarsening verifying dynamic scaling and sharing strong similarities with the phase ordering dynamics of the 2$d$ XY model following a quench. Our results shed light into the generic mechanisms leading the synchronization of mobile agents, providing a efficient way to understand more complex or specific situations involving time-dependent networks where synchronization, mobility and excluded volume are at play.

cond-mat.soft↗

arXiv2015

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 modeling 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 the 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.

physics.soc-ph↗

arXiv2015

Supersampling and network reconstruction of urban mobility

Understanding human mobility is of vital importance for urban planning, epidemiology, and many other fields that aim to draw policies from the activities of humans in space. Despite recent availability of large scale data sets related to human mobility such as GPS traces, mobile phone data, etc., it is still true that such data sets represent a subsample of the population of interest, and then might give an incomplete picture of the entire population in question. Notwithstanding the abundant usage of such inherently limited data sets, the impact of sampling biases on mobility patterns is unclear -- we do not have methods available to reliably infer mobility information from a limited data set. Here, we investigate the effects of sampling using a data set of millions of taxi movements in New York City. On the one hand, we show that mobility patterns are highly stable once an appropriate simple rescaling is applied to the data, implying negligible loss of information due to subsampling over long time scales. On the other hand, contrasting an appropriate null model on the weighted network of vehicle flows reveals distinctive features which need to be accounted for. Accordingly, we formulate a "supersampling" methodology which allows us to reliably extrapolate mobility data from a reduced sample and propose a number of network-based metrics to reliably assess its quality (and that of other human mobility models). Our approach provides a well founded way to exploit temporal patterns to save effort in recording mobility data, and opens the possibility to scale up data from limited records when information on the full system is needed.

physics.soc-ph↗

arXiv2015

An Algebraic Topological Method for Multimodal Brain Networks Comparisons

Understanding brain connectivity has become one of the most important issues in neuroscience. But connectivity data can reflect either the functional relationships of the brain activities or the anatomical properties between brain areas. Although one should expect a clear relationship between both representations it is not straightforward. Here we present a formalism that allows for the comparison of structural (DTI) and functional (fMRI) networks by embedding both in a common metric space. In this metric space one can then find for which regions the two networks are significantly different. Our methodology can be used not only to compare multimodal networks but also to extract statistically significant aggregated networks of a set of subjects. Actually, we use this procedure to aggregate a set of functional (fMRI) networks from different subjects in an aggregated network that is compared with the anatomical (DTI) connectivity. The comparison of the aggregated network reveals some features that are not observed when the comparison is done with the classical averaged network.

q-bio.NC↗

arXiv2013

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, Gomez et al. [Phys. Rev. Lett. 101, 028701 (2013)] 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.

physics.soc-ph↗

arXiv2012

Exploring complex networks by means of adaptive walkers

Finding efficient algorithms to explore large networks with the aim of recovering information about their structure is an open problem. Here, we investigate this challenge by proposing a model in which random walkers with previously assigned home nodes navigate through the network during a fixed amount of time. We consider that the exploration is successful if the walker gets the information gathered back home, otherwise, no data is retrieved. Consequently, at each time step, the walkers, with some probability, have the choice to either go backward approaching their home or go farther away. We show that there is an optimal solution to this problem in terms of the average information retrieved and the degree of the home nodes and design an adaptive strategy based on the behavior of the random walker. Finally, we compare different strategies that emerge from the model in the context of network reconstruction. Our results could be useful for the discovery of unknown connections in large scale networks.

nlin.AO↗

arXiv2012

Diffusion dynamics on multiplex networks

We study the time scales associated to 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 diffusion-like processes on top of multiplex networks.

physics.soc-ph↗

arXiv2012

Synchronization of moving integrate and fire oscillators

We present a model of integrate and fire oscillators that move on a plane. The phase of the oscillators evolves linearly in time and when it reaches a threshold value they fire choosing their neighbors according to a certain interaction range. Depending on the velocity of the ballistic motion and the average number of neighbors each oscillator fires to, we identify different regimes shown in a phase diagram. We characterize these regimes by means of novel parameters as the accumulated number of contacted neighbors.

nlin.AO↗

arXiv2012

Consensus in networks of mobile communicating agents

Populations of mobile and communicating agents describe a vast array of technological and natural systems, ranging from sensor networks to animal groups. Here, we investigate how a group-level agreement may emerge in the continuously evolving network defined by the local interactions of the moving individuals. We adopt a general scheme of motion in two dimensions and we let the individuals interact through the minimal naming game, a prototypical scheme to investigate social consensus. We distinguish different regimes of convergence determined by the emission range of the agents and by their mobility, and we identify the corresponding scaling behaviors of the consensus time. In the same way, we rationalize also the behavior of the maximum memory used during the convergence process, which determines the minimum cognitive/storage capacity needed by the individuals. Overall, we believe that the simple and general model presented in this paper can represent a helpful reference for a better understanding of the behavior of populations of mobile agents.

physics.soc-ph↗

arXiv2012

Modeling international crisis synchronization in the World Trade Web

Trade is a fundamental pillar of economy and a form of social organization. Its empirical characterization at the worldwide scale is represented by the World Trade Web (WTW), the network built upon the trade relationships between the different countries. Several scientific studies have focused on the structural characterization of this network, as well as its dynamical properties, since we have registry of the structure of the network at different times in history. In this paper we study an abstract scenario for the development of global crises on top of the structure of connections of the WTW. Assuming a cyclic dynamics of national economies and the interaction of different countries according to the import-export balances, we are able to investigate, using a simple model of pulse-coupled oscillators, the synchronization phenomenon of crises at the worldwide scale. We focus on the level of synchronization measured by an order parameter at two different scales, one for the global system and another one for the mesoscales defined through the topology. We use the WTW network structure to simulate a network of Integrate-and-Fire oscillators for six different snapshots between years 1950 and 2000. The results reinforce the idea that globalization accelerates the global synchronization process, and the analysis at a mesoscopic level shows that this synchronization is different before and after globalization periods: after globalization, the effect of communities is almost inexistent.

q-fin.GN↗