arXiv subjects

Yang-Yu Liu

Publications and source records attributed to Yang-Yu Liu.

At least 37 records · Page 2Linked to original sources

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↗

arXiv2017

Network Dimensions in the Getty Provenance Index

In this article we make a case for a systematic application of complex network science to study art market history and more general collection dynamics. We reveal social, temporal, spatial, and conceptual network dimensions, i.e. network node and link types, previously implicit in the Getty Provenance Index (GPI). As a pioneering art history database active since the 1980s, the GPI provides online access to source material relevant for research in the history of collecting and art markets. Based on a subset of the GPI, we characterize an aggregate of more than 267,000 sales transactions connected to roughly 22,000 actors in four countries over 20 years at daily resolution from 1801 to 1820. Striving towards a deeper understanding on multiple levels we disambiguate social dynamics of buying, brokering, and selling, while observing a general broadening of the market, where large collections are split into smaller lots. Temporally, we find annual market cycles that are shifted by country and obviously favor international exchange. Spatially, we differentiate near-monopolies from regions driven by competing sub-centers, while uncovering asymmetries of international market flux. Conceptually, we track dynamics of artist attribution that clearly behave like product categories in a very slow supermarket. Taken together, we introduce a number of meaningful network perspectives dealing with historical art auction data, beyond the analysis of social networks within a single market region. The results presented here have inspired a Linked Open Data conversion of the GPI, which is currently in process and will allow further analysis by a broad set of researchers.

physics.soc-ph↗

arXiv2017

Bridges in Complex Networks

A bridge in a graph is an edge whose removal disconnects the graph and increases the number of connected components. We calculate the fraction of bridges in a wide range of real-world networks and their randomized counterparts. We find that real networks typically have more bridges than their completely randomized counterparts, but very similar fraction of bridges as their degree-preserving randomizations. We define a new edge centrality measure, called bridgeness, to quantify the importance of a bridge in damaging a network. We find that certain real networks have very large average and variance of bridgeness compared to their degree-preserving randomizations and other real networks. Finally, we offer an analytical framework to calculate the bridge fraction , the average and variance of bridgeness for uncorrelated random networks with arbitrary degree distributions.

physics.soc-ph↗

arXiv2016

Spectrum of Controlling and Observing Complex Networks

Observing and controlling complex networks are of paramount interest for understanding complex physical, biological and technological systems. Recent studies have made important advances in identifying sensor or driver nodes, through which we can observe or control a complex system. Yet, the observational uncertainty induced by measurement noise and the energy required for control continue to be significant challenges in practical applications. Here we show that the variability of control energy and observational uncertainty for different directions of the state space depend strongly on the number of driver nodes. In particular, we find that if all nodes are directly driven, control is energetically feasible, as the maximum energy increases sublinearly with the system size. If, however, we aim to control a system through a single node, control in some directions is energetically prohibitive, increasing exponentially with the system size. For the cases in between, the maximum energy decays exponentially when the number of driver nodes increases. We validate our findings in several model and real networks, arriving to a series of fundamental laws to describe the control energy that together deepen our understanding of complex systems.

physics.soc-ph↗

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

Evolution of Cooperation on Temporal Networks

The structure of social networks is a key determinant in fostering cooperation and other altruistic behavior among naturally selfish individuals. However, most real social interactions are temporal, being both finite in duration and spread out over time. This raises the question of whether stable cooperation can form despite an intrinsically fragmented social fabric. Here we develop a framework to study the evolution of cooperation on temporal networks in the setting of the classic Prisoner's Dilemma. By analyzing both real and synthetic datasets, we find that temporal networks generally facilitate the evolution of cooperation compared to their static counterparts. More interestingly, we find that the intrinsic human interactive pattern like bursty behavior impedes the evolution of cooperation. Finally, we introduce a measure to quantify the temporality present in networks and demonstrate that there is an intermediate level of temporality that boosts cooperation most. Our results open a new avenue for investigating the evolution of cooperation in more realistic structured populations.

physics.soc-ph↗

arXiv2016

Articulation Points in Complex Networks

An articulation point in a network is a node whose removal disconnects the network. Those nodes play key roles in ensuring connectivity of many real-world networks, from infrastructure networks to protein interaction networks and terrorist communication networks. Despite their fundamental importance, a general framework of studying articulation points in complex networks is lacking. Here we develop analytical tools to study key issues pertinent to articulation points, e.g. the expected number of them and the network vulnerability against their removal, in an arbitrary complex network. We find that a greedy articulation point removal process provides us a novel perspective on the organizational principles of complex networks. Moreover, this process is associated with two fundamentally different types of percolation transitions with a rich phase diagram. Our results shed light on the design of more resilient infrastructure networks and the effective destruction of terrorist communication networks.

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

Impacts of Network Topology on the Performance of a Distributed Algorithm Solving Linear Equations

Recently a distributed algorithm has been proposed for multi-agent networks to solve a system of linear algebraic equations, by assuming each agent only knows part of the system and is able to communicate with nearest neighbors to update their local solutions. This paper investigates how the network topology impacts exponential convergence of the proposed algorithm. It is found that networks with higher mean degree, smaller diameter, and homogeneous degree distribution tend to achieve faster convergence. Both analytical and numerical results are provided.

math.OC↗

arXiv2016

Control Principles of Complex Networks

A reflection of our ultimate understanding of a complex system is our ability to control its behavior. Typically, control has multiple prerequisites: It requires an accurate map of the network that governs the interactions between the system's components, a quantitative description of the dynamical laws that govern the temporal behavior of each component, and an ability to influence the state and temporal behavior of a selected subset of the components. With deep roots in nonlinear dynamics and control theory, notions of control and controllability have taken a new life recently in the study of complex networks, inspiring several fundamental questions: What are the control principles of complex systems? How do networks organize themselves to balance control with functionality? To address these here we review recent advances on the controllability and the control of complex networks, exploring the intricate interplay between a system's structure, captured by its network topology, and the dynamical laws that govern the interactions between the components. We match the pertinent mathematical results with empirical findings and applications. We show that uncovering the control principles of complex systems can help us explore and ultimately understand the fundamental laws that govern their behavior.

eess.SY↗

arXiv2016

On the Origins and Control of Community Types in the Human Microbiome

Microbiome-based stratification of healthy individuals into compositional categories, referred to as "community types", holds promise for drastically improving personalized medicine. Despite this potential, the existence of community types and the degree of their distinctness have been highly debated. Here we adopted a dynamic systems approach and found that heterogeneity in the interspecific interactions or the presence of strongly interacting species is sufficient to explain community types, independent of the topology of the underlying ecological network. By controlling the presence or absence of these strongly interacting species we can steer the microbial ecosystem to any desired community type. This open-loop control strategy still holds even when the community types are not distinct but appear as dense regions within a continuous gradient. This finding can be used to develop viable therapeutic strategies for shifting the microbial composition to a healthy configuration

q-bio.QM↗

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

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

Stability of Degree Heterogeneous Ecological Networks

A classic measure of ecological stability describes the tendency of a community to return to equilibrium after small perturbation. While many advances show how the network structure of these communities severely constrains such tendencies, few if any of these advances address one of the most fundamental properties of network structure: heterogeneity among nodes with different numbers of links. Here we systematically explore this property of "degree heterogeneity" and find that its effects on stability systematically vary with different types of interspecific interactions. Degree heterogeneity is always destabilizing in ecological networks with both competitive and mutualistic interactions while its effects on networks of predator-prey interactions such as food webs depend on prey contiguity, i.e., the extent to which the species consume an unbroken sequence of prey in community niche space. Increasing degree heterogeneity stabilizes food webs except those with the most contiguity. These findings help explain previously unexplained observations that food webs are highly but not completely contiguous and, more broadly, deepens our understanding of the stability of complex ecological networks with important implications for other types of dynamical systems.

q-bio.PE↗

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

Network motifs emerge from interconnections that favor stability

Network motifs are overrepresented interconnection patterns found in real-world networks. What functional advantages may they offer for building complex systems? We show that most network motifs emerge from interconnections patterns that best exploit the intrinsic stability characteristics of individual nodes. This feature is observed at different scales in a network, from nodes to modules, suggesting an efficient mechanism to stably build complex systems.

eess.SY↗

arXiv2014

Individual dynamics induces symmetry in network controllability

Controlling complex networked systems to a desired state is a key research goal in contemporary science. Despite recent advances in studying the impact of network topology on controllability, a comprehensive understanding of the synergistic effect of network topology and individual dynamics on controllability is still lacking. Here we offer a theoretical study with particular interest in the diversity of dynamic units characterized by different types of individual dynamics. Interestingly, we find a global symmetry accounting for the invariance of controllability with respect to exchanging the densities of any two different types of dynamic units, irrespective of the network topology. The highest controllability arises at the global symmetry point, at which different types of dynamic units are of the same density. The lowest controllability occurs when all self-loops are either completely absent or present with identical weights. These findings further improve our understanding of network controllability and have implications for devising the optimal control of complex networked systems in a wide range of fields.

math.OC↗