Searcharxiv⌕ Search

arXiv subjects

Vincenzo Nicosia

Publications and source records attributed to Vincenzo Nicosia.

At least 19 recordsLinked to original sources
arXiv2025

Measuring social mobility in temporal networks

In complex networks, the rich-get-richer effect (nodes with high degree at one point in time gain more degree in their future) is commonly observed. In practice this is often studied on a static network snapshot, for example, a preferential attachment model assumed to explain the more highly connected nodes or a rich-club}effect that analyses the most highly connected nodes. In this paper, we consider temporal measures of how success (measured here as node degree) propagates across time. By analogy with social mobility (a measure people moving within a social hierarchy through their life) we define hierarchical mobility to measure how a node's propensity to gain degree changes over time. We introduce an associated taxonomy of temporal correlation statistics including mobility, philanthropy and community. Mobility measures the extent to which a node's degree gain in one time period predicts its degree gain in the next. Philanthropy and community measure similar properties related to node neighbourhood. We apply these statistics both to artificial models and to 26 real temporal networks. We find that most of our networks show a tendency for individual nodes and their neighbourhoods to remain in similar hierarchical positions over time, while most networks show low correlative effects between individuals and their neighbourhoods. Moreover, we show that the mobility taxonomy can discriminate between networks from different fields. We also generate artificial network models to gain intuition about the behaviour and expected range of the statistics. The artificial models show that the opposite of the "rich-get-richer" effect requires the existence of inequality of degree in a network. Overall, we show that measuring the hierarchical mobility of a temporal network is an invaluable resource for discovering its underlying structural dynamics.

cs.SI↗
arXiv2023

Clusters in randomly-coloured spatial networks

The behaviour and functioning of a variety of complex physical and biological systems depend on the spatial organisation of their constituent units, and on the presence and formation of clusters of functionally similar or related individuals. Here we study the properties of clusters in spatially-embedded networks where nodes are coloured according to a given colouring process. This characterisation will allow us to use spatial networks with uniformly-coloured nodes as a null-model against which the importance, relevance, and significance of clusters of related units in a given real-world system can be assessed. We show that even a uniform and uncorrelated random colouring process can generate coloured clusters of substantial size and interesting shapes, which can be distinguished by using some simple dynamical measures, like the average time needed for a random walk to escape from the cluster. We provide a mean-field approach to study the properties of those clusters in large two-dimensional lattices, and we show that the analytical treatment agrees very well with the numerical results.

physics.soc-ph↗
arXiv2022

Measuring Equality and Hierarchical Mobility on Abstract Complex Networks

The centrality of a node within a network, however it is measured, is a vital proxy for the importance or influence of that node, and the differences in node centrality generate hierarchies and inequalities. If the network is evolving in time, the influence of each node changes in time as well, and the corresponding hierarchies are modified accordingly. However, there is still a lack of systematic study into the ways in which the centrality of a node evolves when a graph changes. In this paper we introduce a taxonomy of metrics of equality and hierarchical mobility in networks that evolve in time. We propose an indicator of equality based on the classical Gini Coefficient from economics, and we quantify the hierarchical mobility of nodes, that is, how and to what extent the centrality of a node and its neighbourhood change over time. These measures are applied to a corpus of thirty time evolving network data sets from different domains. We show that the proposed taxonomy measures can discriminate between networks from different fields. We also investigate correlations between different taxonomy measures, and demonstrate that some of them have consistently strong correlations (or anti-correlations) across the entire corpus. The mobility and equality measures developed here constitute a useful toolbox for investigating the nature of network evolution, and also for discriminating between different artificial models hypothesised to explain that evolution.

cs.SI↗
arXiv2022

Impact of urban structure on infectious disease spreading

The ongoing SARS-CoV-2 pandemic has been holding the world hostage for more than a year now. Mobility is key to viral spreading and its restriction is the main non-pharmaceutical interventions to fight the virus expansion. Previous works have shown a connection between the structural organization of cities and the movement patterns of their residents. This puts urban centers in the focus of epidemic surveillance and interventions. Here we show that the organization of urban flows has a tremendous impact on disease spreading and on the amenability of different mitigation strategies. By studying anonymous and aggregated intra-urban flows in a variety of cities in the United States and other countries, and a combination of empirical analysis and analytical methods, we demonstrate that the response of cities to epidemic spreading can be roughly classified in two major types according to the overall organization of those flows. Hierarchical cities, where flows are concentrated primarily between mobility hotspots, are particularly vulnerable to the rapid spread of epidemics. Nevertheless, mobility restrictions in such types of cities are very effective in mitigating the spread of a virus. Conversely, in sprawled cities which present many centers of activity, the spread of an epidemic is much slower, but the response to mobility restrictions is much weaker and less effective. Investing resources on early monitoring and prompt ad-hoc interventions in more vulnerable cities may prove helpful in containing and reducing the impact of future pandemics.

physics.soc-ph↗
arXiv2021

Metadata-informed community detection with lazy encoding using absorbing random walks

Integrating structural information and metadata, such as gender, social status, or interests, enriches networks and enables a better understanding of the large-scale structure of complex systems. However, existing approaches to metadata integration only consider immediately adjacent nodes, thus failing to identify and exploit long-range correlations between metadata and network structure, typical of many spatial and social systems. Here we show how a flow-based community-detection approach can integrate network information and distant metadata, providing a more nuanced picture of network structure and correlations. We analyse social and spatial networks using the map equation framework and find that our methodology can detect a variety of useful metadata-informed partitions in diverse real-world systems. This framework paves the way for systematically incorporating metadata in network analysis.

physics.soc-ph↗
arXiv2021

Optimising the mitigation of epidemic spreading through targeted adoption of contact tracing apps

The ongoing COVID-19 pandemic is the first epidemic in human history in which digital contact-tracing has been deployed at a global scale. Tracking and quarantining all the contacts of individuals who test positive to a virus can help slowing-down an epidemic, but the impact of contact-tracing is severely limited by the generally low adoption of contact-tracing apps in the population. We derive here an analytical expression for the effectiveness of contact-tracing app installation strategies in a SIR model on a given contact graph. We propose a decentralised heuristic to improve the effectiveness of contact tracing under fixed adoption rates, which targets a set of individuals to install contact-tracing apps, and can be easily implemented. Simulations on a large number of real-world contact networks confirm that this heuristic represents a feasible alternative to the current state of the art.

physics.soc-ph↗
arXiv2020

First-passage times to quantify and compare structural correlations and heterogeneity in complex systems

Virtually all the emergent properties of a complex system are rooted in the non-homogeneous nature of the behaviours of its elements and of the interactions among them. However, the fact that heterogeneity and correlations can appear simultaneously at local, mesoscopic, and global scales, is a concrete challenge for any systematic approach to quantify them in systems of different types. We develop here a scalable and non-parametric framework to characterise the presence of heterogeneity and correlations in a complex system, based on the statistics of random walks over the underlying network of interactions among its units. In particular, we focus on normalised mean first passage times between meaningful pre-assigned classes of nodes, and we showcase a variety of their potential applications. We found that the proposed framework is able to characterise polarisation in voting systems, including the UK Brexit referendum and the roll-call votes in the US Congress. Moreover, the distributions of class mean first passage times can help identifying the key players responsible for the spread of a disease in a social system, and comparing the spatial segregation of US cities, revealing the central role of urban mobility in shaping the incidence of socio-economic inequalities.

physics.soc-ph↗
arXiv2020

Quantifying ethnic segregation in cities through random walks

Socioeconomic segregation is considered one of the main factors behind the emergence of large-scale inequalities in urban areas, and its characterisation is an active area of research in urban studies. There are currently many available measures of spatial segregation, but almost all of them either depend in non-trivial ways on the scale and size of the system under study, or mostly neglect the importance of large-scale spatial correlations, or depend on parameters which make it hard to compare different systems on equal grounds. We propose here two non-parametric measures of spatial variance and local spatial diversity, based on the statistical properties of the trajectories of random walks on graphs. We show that these two quantities provide a consistent and intuitive estimation of segregation of synthetic spatial patterns, and we use them to analyse and compare the ethnic segregation of large metropolitan areas in the US and the UK. The results confirm that the spatial variance and local diversity as measured through simple diffusion on graphs provides meaningful insights about the spatial organisation of ethnicities across a city, and allows us to efficiently compare the ethnic segregation of urban areas across the world irrespective of their size, shape, or peculiar microscopic characteristics.

physics.soc-ph↗
arXiv2020

Optimal percolation in correlated multilayer networks with overlap

Multilayer networks have been found to be prone to abrupt cascading failures under random and targeted attacks, but most of the targeting algorithms proposed so far have been mainly tested on uncorrelated systems. Here we show that the size of the critical percolation set of a multilayer network is substantially affected by the presence of inter-layer degree correlations and edge overlap. We provide extensive numerical evidence which confirms that the state-of-the-art optimal percolation strategies consistently fail to identify minimal percolation sets in synthetic and real-world correlated multilayer networks, thus overestimating their robustness. We propose two new targeting algorithms, based on the local estimation of path disruptions away from a given node, and a family of Pareto-efficient strategies that take into account both intra-layer and inter-layer heuristics, and can be easily extended to multiplex networks with an arbitrary number of layers. We show that these strategies consistently outperform existing attacking algorithms, on both synthetic and real-world multiplex networks, and provide some interesting insights about the interplay of correlations and overlap in determining the hyperfragility of real-world multilayer networks. Overall, the results presented in the paper suggest that we are still far from having fully identified the salient ingredients determining the robustness of multiplex networks to targeted attacks.

physics.soc-ph↗
arXiv2020

Disproportionate incidence of COVID-19 in African Americans correlates with dynamic segregation

Socio-economic disparities quite often have a central role in the unfolding of large-scale catastrophic events. One of the most concerning aspects of the ongoing COVID-19 pandemics is that it disproportionately affects people from Black and African American backgrounds creating an unexpected infection gap. Interestingly, the abnormal impact on these ethnic groups seem to be almost uncorrelated with other risk factors, including co-morbidity, poverty, level of education, access to healthcare, residential segregation, and response to cures. A proposed explanation for the observed incidence gap is that people from African American backgrounds are more often employed in low-income service jobs, and are thus more exposed to infection through face-to-face contacts, but the lack of direct data has not allowed to draw strong conclusions in this sense so far. Here we introduce the concept of dynamic segregation, that is the extent to which a given group of people is internally clustered or exposed to other groups, as a result of mobility and commuting habits. By analysing census and mobility data on more than 120 major US cities, we found that the dynamic segregation of African American communities is significantly associated with the weekly excess COVID-19 incidence and mortality in those communities. The results confirm that knowing where people commute to, rather than where they live, is much more relevant for disease modelling.

physics.soc-ph↗
arXiv2020

Algorithmic complexity of multiplex networks

Multilayer networks preserve full information about the different interactions among the constituents of a complex system, and have recently proven quite useful in modelling transportation networks, social circles, and the human brain. A fundamental and still open problem is to assess if and when the multilayer representation of a system provides a qualitatively better model than the classical single-layer aggregated network. Here we tackle this problem from an algorithmic information theory perspective. We propose an intuitive way to encode a multilayer network into a bit string, and we define the complexity of a multilayer network as the ratio of the Kolmogorov complexity of the bit strings associated to the multilayer and to the corresponding aggregated graph. We find that there exists a maximum amount of additional information that a multilayer model can encode with respect to the equivalent single-layer graph. We show how our complexity measure can be used to obtain low-dimensional representations of multidimensional systems, to cluster multilayer networks into a small set of meaningful super-families, and to detect tipping points in the evolution of different time-varying multilayer graphs. Interestingly, the low-dimensional multiplex networks obtained with the proposed method also retain most of the dynamical properties of the original systems, as demonstrated for instance by the preservation of the epidemic threshold in the multiplex SIS model. These results suggest that information-theoretic approaches can be effectively employed for a more systematic analysis of static and time-varying multidimensional complex systems.

physics.soc-ph↗
arXiv2019

Efficient On-line Computation of Visibility Graphs

A visibility algorithm maps time series into complex networks following a simple criterion. The resulting visibility graph has recently proven to be a powerful tool for time series analysis. However its straightforward computation is time-consuming and rigid, motivating the development of more efficient algorithms. Here we present a highly efficient method to compute visibility graphs with the further benefit of flexibility: on-line computation. We propose an encoder/decoder approach, with an on-line adjustable binary search tree codec for time series as well as its corresponding decoder for visibility graphs. The empirical evidence suggests the proposed method for computation of visibility graphs offers an on-line computation solution at no additional computation time cost. The source code is available online.

cs.DS↗
arXiv2019

On the spectral properties of Feigenbaum graphs

A Horizontal Visibility Graph (HVG) is a simple graph extracted from an ordered sequence of real values, and this mapping has been used to provide a combinatorial encryption of time series for the task of performing network based time series analysis. While some properties of the spectrum of these graphs --such as the largest eigenvalue of the adjacency matrix-- have been routinely used as measures to characterise time series complexity, a theoretic understanding of such properties is lacking. In this work we explore some algebraic and spectral properties of these graphs associated to periodic and chaotic time series. We focus on the family of Feigenbaum graphs, which are HVGs constructed in correspondence with the trajectories of one-parameter unimodal maps undergoing a period-doubling route to chaos (Feigenbaum scenario). For the set of values of the map's parameter $μ$ for which the orbits are periodic with period $2^n$, Feigenbaum graphs are fully characterised by two integers (n,k) and admit an algebraic structure. We explore the spectral properties of these graphs for finite n and k, and among other interesting patterns we find a scaling relation for the maximal eigenvalue and we prove some bounds explaining it. We also provide numerical and rigorous results on a few other properties including the determinant or the number of spanning trees. In a second step, we explore the set of Feigenbaum graphs obtained for the range of values of the map's parameter $μ$ for which the system displays chaos. We show that in this case, Feigenbaum graphs form an ensemble for each value of $μ$ and the system is typically weakly self-averaging. Unexpectedly, we find that while the largest eigenvalue can distinguish chaos from an iid process, it is not a good measure to quantify the chaoticity of the process, and that the eigenvalue density does a better job.

physics.data-an↗
arXiv2018

Pareto optimality in multilayer network growth

We model the formation of multi-layer transportation networks as a multi-objective optimization process, where service providers compete for passengers, and the creation of routes is determined by a multi-objective cost function encoding a trade-off between efficiency and competition. The resulting model reproduces well real-world systems as diverse as airplane, train and bus networks, thus suggesting that such systems are indeed compatible with the proposed local optimization mechanisms. In the specific case of airline transportation systems, we show that the networks of routes operated by each company are placed very close to the theoretical Pareto front in the efficiency-competition plane, and that most of the largest carriers of a continent belong to the corresponding Pareto front. Our results shed light on the fundamental role played by multi-objective optimization principles in shaping the structure of large-scale multilayer transportation systems, and provide novel insights to service providers on the strategies for the smart selection of novel routes.

physics.soc-ph↗
arXiv2018

Multiplex decomposition of non-Markovian dynamics and the hidden layer reconstruction problem

Elements composing complex systems usually interact in several different ways and as such the interaction architecture is well modelled by a multiplex network. However often this architecture is hidden, as one usually only has experimental access to an aggregated projection. A fundamental challenge is thus to determine whether the hidden underlying architecture of complex systems is better modelled as a single interaction layer or results from the aggregation and interplay of multiple layers. Here we show that using local information provided by a random walker navigating the aggregated network one can decide in a robust way if the underlying structure is a multiplex or not and, in the former case, to determine the most probable number of hidden layers. As a byproduct, we show that the mathematical formalism also provides a principled solution for the optimal decomposition and projection of complex, non-Markovian dynamics into a Markov switching combination of diffusive modes. We validate the proposed methodology with numerical simulations of both (i) random walks navigating hidden multiplex networks (thereby reconstructing the true hidden architecture) and (ii) Markovian and non-Markovian continuous stochastic processes (thereby reconstructing an effective multiplex decomposition where each layer accounts for a different diffusive mode). We also state and prove two existence theorems guaranteeing that an exact reconstruction of the dynamics in terms of these hidden jump-Markov models is always possible for arbitrary finite-order Markovian and fully non-Markovian processes. Finally, we showcase the applicability of the method to experimental recordings from (i) the mobility dynamics of human players in an online multiplayer game and (ii) the dynamics of RNA polymerases at the single-molecule level.

physics.soc-ph↗
arXiv2017

The advantages of interdisciplinarity in modern science

As the increasing complexity of large-scale research requires the combined efforts of scientists with expertise in different fields, the advantages and costs of interdisciplinary scholarship have taken center stage in current debates on scientific production. Here we conduct a comparative assessment of the scientific success of specialized and interdisciplinary researchers in modern science. Drawing on comprehensive data sets on scientific production, we propose a two-pronged approach to interdisciplinarity. For each scientist, we distinguish between background interdisciplinarity, rooted in knowledge accumulated over time, and social interdisciplinarity, stemming from exposure to collaborators' knowledge. We find that, while abandoning specialization in favor of moderate degrees of background interdisciplinarity deteriorates performance, very interdisciplinary scientists outperform specialized ones, at all career stages. Moreover, successful scientists tend to intensify the heterogeneity of collaborators and to match the diversity of their network with the diversity of their background. Collaboration sustains performance by facilitating knowledge diffusion, acquisition and creation. Successful scientists tend to absorb a larger fraction of their collaborators' knowledge, and at a faster pace, than less successful ones. Collaboration also provides successful scientists with opportunities for the cross-fertilization of ideas and the synergistic creation of new knowledge. These results can inspire scientists to shape successful careers, research institutions to develop effective recruitment policies, and funding agencies to award grants of enhanced impact.

physics.soc-ph↗
arXiv2017

Layered social influence promotes multiculturality in the Axelrod model

Why is our society multicultural? Based on the two mechanisms of homophily and social influence, the classical model for the dissemination of cultures proposed by Axelrod predicts the existence of a fragmented regime where different cultures can coexist in a social network. However, in such model the multicultural regime is achievable only when a high number of cultural traits is present, and is not robust against cultural drift, i.e. the spontaneous mutations of agents' traits. In real systems, social influence is inherently organised in layers, meaning that individuals tend to diversify their connections according to the topic on which they interact. In this work we show that the observed persistence of multiculturality in real-world social systems is a natural consequence of the layered organisation of social influence. We find that the critical number of cultural traits that separates the monocultural and the multicultural regimes depends on the redundancy of pairwise connections across layers. Surprisingly, for low values of structural redundancy the system is always in a multicultural state, independently on the number of traits, and is robust to the presence of cultural drift. Moreover, we show that layered social influence allows the coexistence of different levels of consensus on different topics. The insight obtained from simulations on synthetic graphs are confirmed by the analysis of two real-world social networks, where the multicultural regime persists even for a very small number of cultural traits, suggesting that the layered organisation of social interactions might indeed be at the heart of multicultural societies.

physics.soc-ph↗
arXiv2017

Collective phenomena emerging from the interactions between dynamical processes in multiplex networks

We introduce a framework to intertwine dynamical processes of different nature, each with its own distinct network topology, using a multilayer network approach. As an example of collective phenomena emerging from the interactions of multiple dynamical processes, we study a model where neural dynamics and nutrient transport are bidirectionally coupled in such a way that the allocation of the transport process at one layer depends on the degree of synchronization at the other layer, and vice versa. We show numerically, and we prove analytically, that the multilayer coupling induces a spontaneous explosive synchronization and a heterogeneous distribution of allocations, otherwise not present in the two systems considered separately. Our framework can find application to other cases where two or more dynamical processes such as synchronization, opinion formation, information diffusion, or disease spreading, are interacting with each other.

nlin.AO↗