1,721,068 research outputs found

    Effects of memory on spreading processes in non-Markovian temporal networks

    Full text link
    Many biological, social and man-made systems are better described in terms of temporal networks, i.e. networks whose links are only present at certain points in time, rather than by static ones. In particular, it has been found that non-Markovianity is a necessary ingredient to capture the non-trivial temporal patterns of real-world networks. However, our understanding of how memory can affect the properties of dynamical processes taking place over temporal networks is still very limited, being especially constrained to the case of short-term memory. Here, by introducing a model for temporal networks in which we can precisely control the link density and the strength and length of memory for each link, we unveil the role played by memory on the dynamics of epidemic spreading processes. Surprisingly, we find that the average spreading time in our temporal networks is often non- monotonically dependent on the length of the memory, and that the optimal value of the memory length which maximizes the spreading time depends on the strength of the memory and on the density of links in the network. Through analytical arguments we then explore the effect that changing the number and length of network paths connecting any two nodes has on the value of optimal memory

    Scaling Breakdown in Flow Fluctuations on Complex Networks

    No full text
    We propose a model of random diffusion to investigate flow fluctuations in complex networks. We derive an analytical law showing that the dependence of fluctuations with the mean traffic in a network is ruled by the delicate interplay of three factors, respectively, of dynamical, topological and statistical nature. In particular, we demonstrate that the existence of a power-law scaling characterizing the flow fluctuations at every node in the network cannot be claimed. We show the validity of this scaling breakdown under quite general topological and dynamical situations by means of different traffic algorithms and by analyzing real data

    Characteristic exponents of complex networks

    No full text
    We present a novel way to characterize the structure of complex networks by studying the statistical properties of the trajectories of random walks over them. We consider time series corresponding to different properties of the nodes visited by the walkers. We show that the analysis of the fluctuations of these time series allows to define a set of characteristic exponents which capture the local and global organization of a network. This approach provides a way of solving two classical problems in network science, namely the systematic classification of networks, and the identification of the salient properties of growing networks. The results contribute to the construction of a unifying framework for the investigation of the structure and dynamics of complex systems

    Predicting urban innovation from the US Workforce Mobility Network

    Full text link
    While great emphasis has been placed on the role of social interactions as a driver of innovation growth, very few empirical studies have explicitly investigated the impact of social network structures on the innovation performance of cities. Past research has mostly explored scaling laws of socio-economic outputs of cities as determined by, for example, the single predictor of population. Here, by drawing on a publicly available dataset of the startup ecosystem, we build the first Workforce Mobility Network among metropolitan areas in the US. We found that node centrality computed on this network accounts for most of the variability observed in cities’ innovation performance and significantly outperforms other predictors such as population size or density, suggesting that policies and initiatives aiming at sustaining innovation processes might benefit from fostering professional networks alongside other economic or systemic incentives. As opposed to previous approaches powered by census data, our model can be updated in real-time upon open databases, opening up new opportunities both for researchers in a variety of disciplines to study urban economies in new ways, and for practitioners to design tools for monitoring such economies in real-time.</p

    Benchmarking the performance of controllers for power grid transient stability

    Full text link
    As the energy transition transforms power grids across the globe, it poses several challenges regarding grid design and control. In particular, high levels of intermittent renewable generation complicate the task of continuously balancing power supply and demand, requiring sufficient control actions. Although there exist several proposals to control the grid, most of them have not demonstrated to be cost efficient in terms of optimal control theory. Here, we mathematically formulate an optimal centralized (therefore non-local) control problem for stable operation of power grids and determine the minimal amount of active power necessary to guarantee a stable service within the operational constraints, minimizing a suitable cost function at the same time. This optimal control can be used to benchmark control proposals and we demonstrate this benchmarking process by investigating the performance of three distributed controllers, two of which are fully decentralized, that have been recently studied in the physics and power systems engineering literature. Our results show that cost efficient controllers distribute the controlled response amongst all nodes in the power grid. Additionally, superior performance can be achieved by incorporating sufficient information about the disturbance causing the instability. Overall, our results can help design and benchmark secure and cost-efficient controllers

    Interacting Discovery Processes on Complex Networks

    Full text link
    Innovation is the driving force of human progress. Recent urn models reproduce well the dynamics through which the discovery of a novelty may trigger further ones, in an expanding space of opportunities, but neglect the effects of social interactions. Here we focus on the mechanisms of collective exploration and we propose a model in which many urns, representing different explorers, are coupled through the links of a social network and exploit opportunities coming from their contacts. We study different network structures showing, both analytically and numerically, that the pace of discovery of an explorer depends on its centrality in the social network. Our model sheds light on the role that social structures play in discovery processes

    Higher-order correlations reveal complex memory in temporal hypergraphs.

    Full text link
    Many real-world complex systems are characterized by interactions in groups that change in time. Current temporal network approaches, however, are unable to describe group dynamics, as they are based on pairwise interactions only. Here, we use time-varying hypergraphs to describe such systems, and we introduce a framework based on higher-order correlations to characterize their temporal organization. The analysis of human interaction data reveals the existence of coherent and interdependent mesoscopic structures, thus capturing aggregation, fragmentation and nucleation processes in social systems. We introduce a model of temporal hypergraphs with non-Markovian group interactions, which reveals complex memory as a fundamental mechanism underlying the emerging pattern in the data.L.G. and F.B. acknowledge support from the Air Force Office of Scientific Research under award number FA8655-22-1-7025. L.L. acknowledges funding from the Spanish Research Agency MCIN/AEI/10.13039/501100011033 via projects DYNDEEP (EUR2021-122007), MISLAND (PID2020-114324GB-C22), and the María de Maeztu project CEX2021-001164-M. V.L. acknowledges support from the European Union, NextGenerationEU, GRINS project (GRINS PE00000018 - CUP E63C22002120006).With funding from the Spanish government through the "Severo Ochoa Centre of Excellence" accreditation (CEX2021-001164-M).Peer reviewe
    corecore