ﻻ يوجد ملخص باللغة العربية
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.
To understand the controllability of complex networks is a forefront problem relevant to different fields of science and engineering. Despite recent advances in network controllability theories, an outstanding issue is to understand the effect of net
Routing information through networks is a universal phenomenon in both natural and manmade complex systems. When each node has full knowledge of the global network connectivity, finding short communication paths is merely a matter of distributed comp
Controlling complex networks is of paramount importance in science and engineering. Despite the recent development of structural-controllability theory, we continue to lack a framework to control undirected complex networks, especially given link wei
Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches to capturi
The generalized $H(n)$ Hirsch index of order $n$ has been recently introduced and shown to interpolate between the degree and the $K$-core centrality in networks. We provide a detailed analytical characterization of the properties of sets of nodes ha