arXiv subjects

Albert-László Barabási

Publications and source records attributed to Albert-László Barabási.

At least 37 records · Page 2Linked to original sources

arXiv2020

Give more data, awareness and control to individual citizens, and they will help COVID-19 containment

The rapid dynamics of COVID-19 calls for quick and effective tracking of virus transmission chains and early detection of outbreaks, especially in the phase 2 of the pandemic, when lockdown and other restriction measures are progressively withdrawn, in order to avoid or minimize contagion resurgence. For this purpose, contact-tracing apps are being proposed for large scale adoption by many countries. A centralized approach, where data sensed by the app are all sent to a nation-wide server, raises concerns about citizens' privacy and needlessly strong digital surveillance, thus alerting us to the need to minimize personal data collection and avoiding location tracking. We advocate the conceptual advantage of a decentralized approach, where both contact and location data are collected exclusively in individual citizens' "personal data stores", to be shared separately and selectively, voluntarily, only when the citizen has tested positive for COVID-19, and with a privacy preserving level of granularity. This approach better protects the personal sphere of citizens and affords multiple benefits: it allows for detailed information gathering for infected people in a privacy-preserving fashion; and, in turn this enables both contact tracing, and, the early detection of outbreak hotspots on more finely-granulated geographic scale. Our recommendation is two-fold. First to extend existing decentralized architectures with a light touch, in order to manage the collection of location data locally on the device, and allow the user to share spatio-temporal aggregates - if and when they want, for specific aims - with health authorities, for instance. Second, we favour a longer-term pursuit of realizing a Personal Data Store vision, giving users the opportunity to contribute to collective good in the measure they want, enhancing self-awareness, and cultivating collective efforts for rebuilding society.

cs.CY↗

arXiv2019

Understanding the Representation Power of Graph Neural Networks in Learning Graph Topology

To deepen our understanding of graph neural networks, we investigate the representation power of Graph Convolutional Networks (GCN) through the looking glass of graph moments, a key property of graph topology encoding path of various lengths. We find that GCNs are rather restrictive in learning graph moments. Without careful design, GCNs can fail miserably even with multiple layers and nonlinear activation functions. We analyze theoretically the expressiveness of GCNs, concluding a modular GCN design, using different propagation rules with residual connections could significantly improve the performance of GCN. We demonstrate that such modular designs are capable of distinguishing graphs from different graph generation models for surprisingly small graphs, a notoriously difficult problem in network science. Our investigation suggests that, depth is much more influential than width, with deeper GCNs being more capable of learning higher order graph moments. Additionally, combining GCN modules with different propagation rules is critical to the representation power of GCNs.

cs.LG↗

arXiv2019

Synthetic ablations in the C. elegans nervous system

Synthetic lethality, the finding that the simultaneous knockout of two or more individually non-essential genes leads to cell or organism death, has offered a systematic framework to explore cellular function, and also offered therapeutic applications. Yet, the concept lacks its parallel in neuroscience - a systematic knowledge base on the role of double or higher order ablations in the functioning of a neural system. Here, we use the framework of network control to systematically predict the ablation of neuron pairs and triplets. We find that surprisingly small sets of 58 pairs and 46 triplets can reduce muscle controllability, and that these sets are localised in the nervous system in distinct groups. Further, they lead to highly specific experimentally testable predictions about mechanisms of loss of control, and which muscle cells are expected to experience this loss.

q-bio.NC↗

arXiv2018

The Chaperone Effect in Scientific Publishing

Experience plays a critical role in crafting high impact scientific work. This is particularly evident in top multidisciplinary journals, where a scientist is unlikely to appear as senior author if they have not previously published within the same journal. Here, we develop a quantitative understanding of author order by quantifying this 'Chaperone Effect', capturing how scientists transition into senior status within a particular publication venue. We illustrate that the chaperone effect has different magnitude for journals in different branches of science, being more pronounced in medical and biological sciences and weaker in natural sciences. Finally, we show that in the case of high-impact venues, the chaperone effect has significant implications, specifically resulting in a higher average impact relative to papers authored by new PIs. Our findings shed light on the role played by experience in publishing within specific scientific journals, on the paths towards acquiring the necessary experience and expertise, and on the skills required to publish in prestigious venues.

physics.soc-ph↗

arXiv2017

Control energy scaling in temporal networks

In practical terms, controlling a network requires manipulating a large number of nodes with a comparatively small number of external inputs, a process that is facilitated by paths that broadcast the influence of the (directly-controlled) driver nodes to the rest of the network. Recent work has shown that surprisingly, temporal networks can enjoy tremendous control advantages over their static counterparts despite the fact that in temporal networks such paths are seldom instantaneously available. To understand the underlying reasons, here we systematically analyze the scaling behavior of a key control cost for temporal networks--the control energy. We show that the energy costs of controlling temporal networks are determined solely by the spectral properties of an "effective" Gramian matrix, analogous to the static network case. Surprisingly, we find that this scaling is largely dictated by the first and the last network snapshot in the temporal sequence, independent of the number of intervening snapshots, the initial and final states, and the number of driver nodes. Our results uncover the intrinsic laws governing why and when temporal networks save considerable control energy over their static counterparts.

nlin.AO↗

arXiv2016

Sensitivity of Complex Networks

The sensitivity (i.e. dynamic response) of complex networked systems has not been well understood, making difficult to predict whether new macroscopic dynamic behavior will emerge even if we know exactly how individual nodes behave and how they are coupled. Here we build a framework to quantify the sensitivity of complex networked system of coupled dynamic units. We characterize necessary and sufficient conditions for the emergence of new macroscopic dynamic behavior in the thermodynamic limit. We prove that these conditions are satisfied only for architectures with power-law degree distributions. Surprisingly, we find that highly connected nodes (i.e. hubs) only dominate the sensitivity of the network up to certain critical frequency.

eess.SY↗

arXiv2016

Controllability of multiplex, multi-timescale networks

The paradigm of layered networks is used to describe many real-world systems -- from biological networks, to social organizations and transportation systems. Recently there has been much progress in understanding the general properties of multilayer networks, our understanding of how to control such systems remains limited. One aspect that makes this endeavor challenging is that each layer can operate at a different timescale, thus we cannot directly apply standard ideas from structural control theory of individual networks. Here we address the problem of controlling multilayer and multi-timescale networks focusing on two-layer multiplex networks with one-to-one interlayer coupling. We investigate the case when the control signal is applied to the nodes of one layer. We develop a theory based on disjoint path covers to determine the minimum number of inputs ($N_\T i$) necessary for full control. We show that if both layers operate on the same timescale then the network structure of both layers equally affect controllability. In the presence of timescale separation, controllability is enhanced if the controller interacts with the faster layer: $N_\T i$ decreases as the timescale difference increases up to a critical timescale difference, above which $N_\T i$ remains constant and is completely determined by the faster layer. In contrast, control becomes increasingly difficult if the controller interacts with the layer operating on the slower timescale and increasing timescale separation leads to increased $N_\T i$, again up to a critical value, above which $N_\T i$ still depends on the structure of both layers. By identifying the underlying mechanisms that connect timescale difference and controllability for a simplified model, we provide insight into disentangling how our ability to control real interacting complex systems is affected by a variety of sources of complexity.

physics.soc-ph↗

arXiv2016

The fundamental advantages of temporal networks

Despite the traditional focus of network science on static networks, most networked systems of scientific interest are characterized by temporal links. By disrupting the paths, link temporality has been shown to frustrate many dynamical processes on networks, from information spreading to accessibility. Considering the ubiquity of temporal networks in nature, we must ask: Are there any advantages of the networks' temporality? Here we develop an analytical framework to explore the control properties of temporal networks, arriving at the counterintuitive conclusion that temporal networks, compared to their static (i.e. aggregated) counterparts, reach controllability faster, demand orders of magnitude less control energy, and the control trajectories, through which the system reaches its final states, are significantly more compact than those characterizing their static counterparts. The combination of analytical, numerical and empirical results demonstrates that temporality ensures a degree of flexibility that would be unattainable in static networks, significantly enhancing our ability to control them.

nlin.AO↗

arXiv2016

The Network Behind the Cosmic Web

The concept of the cosmic web, viewing the Universe as a set of discrete galaxies held together by gravity, is deeply engrained in cosmology. Yet, little is known about the most effective construction and the characteristics of the underlying network. Here we explore seven network construction algorithms that use various galaxy properties, from their location, to their size and relative velocity, to assign a network to galaxy distributions provided by both simulations and observations. We find that a model relying only on spatial proximity offers the best correlations between the physical characteristics of the connected galaxies. We show that the properties of the networks generated from simulations and observations are identical, unveiling a deep universality of the cosmic web.

astro-ph.CO↗

arXiv2016

Fundamental limitations of network reconstruction

Network reconstruction is the first step towards understanding, diagnosing and controlling the dynamics of complex networked systems. It allows us to infer properties of the interaction matrix, which characterizes how nodes in a system directly interact with each other. Despite a decade of extensive studies, network reconstruction remains an outstanding challenge. The fundamental limitations governing which properties of the interaction matrix (e.g., adjacency pattern, sign pattern and degree sequence) can be inferred from given temporal data of individual nodes remain unknown. Here we rigorously derive necessary conditions to reconstruct any property of the interaction matrix. These conditions characterize how uncertain can we be about the coupling functions that characterize the interactions between nodes, and how informative does the measured temporal data need to be; rendering two classes of fundamental limitations of network reconstruction. Counterintuitively, we find that reconstructing any property of the interaction matrix is generically as difficult as reconstructing the interaction matrix itself, requiring equally informative temporal data. Revealing these fundamental limitations shed light on the design of better network reconstruction algorithms, which offer practical improvements over existing methods.

eess.SY↗

arXiv2015

Untangling Performance from Success

Fame, popularity and celebrity status, frequently used tokens of success, are often loosely related to, or even divorced from professional performance. This dichotomy is partly rooted in the difficulty to distinguish performance, an individual measure that captures the actions of a performer, from success, a collective measure that captures a community's reactions to these actions. Yet, finding the relationship between the two measures is essential for all areas that aim to objectively reward excellence, from science to business. Here we quantify the relationship between performance and success by focusing on tennis, an individual sport where the two quantities can be independently measured. We show that a predictive model, relying only on a tennis player's performance in tournaments, can accurately predict an athlete's popularity, both during a player's active years and after retirement. Hence the model establishes a direct link between performance and momentary popularity. The agreement between the performance-driven and observed popularity suggests that in most areas of human achievement exceptional visibility may be rooted in detectable performance measures.

physics.soc-ph↗

arXiv2015

Controllability analysis of the directed human protein interaction network identifies disease genes and drug targets

The protein-protein interaction (PPI) network is crucial for cellular information processing and decision-making. With suitable inputs, PPI networks drive the cells to diverse functional outcomes such as cell proliferation or cell death. Here we characterize the structural controllability of a large directed human PPI network comprised of 6,339 proteins and 34,813 interactions. This allows us to classify proteins as "indispensable", "neutral" or "dispensable", which correlates to increasing, no effect, or decreasing the number of driver nodes in the network upon removal of that protein. We find that 21% of the proteins in the PPI network are indispensable. Interestingly, these indispensable proteins are the primary targets of disease-causing mutations, human viruses, and drugs, suggesting that altering a network's control property is critical for the transition between healthy and disease states. Furthermore, analyzing copy number alterations data from 1,547 cancer patients reveals that 56 genes that are frequently amplified or deleted in nine different cancers are indispensable. Among the 56 genes, 46 of them have not been previously associated with cancer. This suggests that controllability analysis is very useful in identifying novel disease genes and potential drug targets.

q-bio.MN↗

arXiv2015

Control principles of metabolic networks

Deciphering the control principles of metabolism and its interaction with other cellular functions is central to biomedicine and biotechnology. Yet, understanding the efficient control of metabolic fluxes remains elusive for large-scale metabolic networks. Existing methods either require specifying a cellular objective or are limited to small networks due to computational complexity. Here we develop an efficient computational framework for flux control by introducing a complete set of flux coupling relations. We analyze 23 metabolic networks from all kingdoms of life, and identify the driver reactions facilitating their control on a large scale. We find that most unicellular organisms require less extensive control than multicellular organisms. The identified driver reactions are under strong transcriptional regulation in Escherichia coli. In human cancer cells driver reactions play pivotal roles in tumor development, representing potential therapeutic targets. The proposed framework helps us unravel the regulatory principles of complex diseases and design novel engineering strategies at the interface of gene regulation, signaling, and metabolism.

q-bio.MN↗

arXiv2015

Emergence of bimodality in controlling complex networks

Our ability to control complex systems is a fundamental challenge of contemporary science. Recently introduced tools to identify the driver nodes, nodes through which we can achieve full control, predict the existence of multiple control configurations, prompting us to classify each node in a network based on their role in control. Accordingly a node is critical, intermittent or redundant if it acts as a driver node in all, some or none of the control configurations. Here we develop an analytical framework to identify the category of each node, leading to the discovery of two distinct control modes in complex systems: centralized vs distributed control. We predict the control mode for an arbitrary network and show that one can alter it through small structural perturbations. The uncovered bimodality has implications from network security to organizational research and offers new insights into the dynamics and control of complex systems.

physics.soc-ph↗

arXiv2014

Collective credit allocation in science

Collaboration among researchers is an essential component of the modern scientific enterprise, playing a particularly important role in multidisciplinary research. However, we continue to wrestle with allocating credit to the coauthors of publications with multiple authors, since the relative contribution of each author is difficult to determine. At the same time, the scientific community runs an informal field-dependent credit allocation process that assigns credit in a collective fashion to each work. Here we develop a credit allocation algorithm that captures the coauthors' contribution to a publication as perceived by the scientific community, reproducing the informal collective credit allocation of science. We validate the method by identifying the authors of Nobel-winning papers that are credited for the discovery, independent of their positions in the author list. The method can also compare the relative impact of researchers working in the same field, even if they did not publish together. The ability to accurately measure the relative credit of researchers could affect many aspects of credit allocation in science, potentially impacting hiring, funding, and promotion decisions.

physics.soc-ph↗

arXiv2014

Quantifying Long-Term Scientific Impact

The lack of predictability of citation-based measures frequently used to gauge impact, from impact factors to short-term citations, raises a fundamental question: Is there long-term predictability in citation patterns? Here, we derive a mechanistic model for the citation dynamics of individual papers, allowing us to collapse the citation histories of papers from different journals and disciplines into a single curve, indicating that all papers tend to follow the same universal temporal pattern. The observed patterns not only help us uncover basic mechanisms that govern scientific impact but also offer reliable measures of influence that may have potential policy implications.

cs.DL↗

arXiv2014

Quantifying Information Flow During Emergencies

Recent advances on human dynamics have focused on the normal patterns of human activities, with the quantitative understanding of human behavior under extreme events remaining a crucial missing chapter. This has a wide array of potential applications, ranging from emergency response and detection to traffic control and management. Previous studies have shown that human communications are both temporally and spatially localized following the onset of emergencies, indicating that social propagation is a primary means to propagate situational awareness. We study real anomalous events using country-wide mobile phone data, finding that information flow during emergencies is dominated by repeated communications. We further demonstrate that the observed communication patterns cannot be explained by inherent reciprocity in social networks, and are universal across different demographics.

physics.soc-ph↗

arXiv2014

Modeling and Predicting Popularity Dynamics via Reinforced Poisson Processes

An ability to predict the popularity dynamics of individual items within a complex evolving system has important implications in an array of areas. Here we propose a generative probabilistic framework using a reinforced Poisson process to model explicitly the process through which individual items gain their popularity. This model distinguishes itself from existing models via its capability of modeling the arrival process of popularity and its remarkable power at predicting the popularity of individual items. It possesses the flexibility of applying Bayesian treatment to further improve the predictive power using a conjugate prior. Extensive experiments on a longitudinal citation dataset demonstrate that this model consistently outperforms existing popularity prediction methods.

cs.SI↗