user login 

Conference on Applications of Network Theory
Conference on Applications of Network Theory
7-9 April 2011
Home > Contribution details
get PDF of this contribution get XML of this contribution get ICal of this contribution
Controllability of Complex Networks
The ultimate proof of our understanding of natural or
technological systems is reflected in our ability to control
them. While control theory offers mathematical tools to
steer engineered and natural systems towards a desired
state, we lack a framework to control complex self-organized
systems. Here we develop analytical tools to study the
controllability of an arbitrary complex directed network,
identifying the set of driver nodes whose time-dependent
control can guide the system’s entire dynamics. We apply
these tools to several real networks, finding that the
number of driver nodes is determined mainly by the network’s
degree distribution. We show that sparse inhomogeneous
networks, which emerge in many real complex systems, are the
most difficult to control, but dense and homogeneous
networks can be controlled via a few driver nodes.
Counterintuitively, we find that in both model and real
systems the driver nodes tend to avoid the hubs.
Id: 273
Room: FD5
Starting date:
08-Apr-2011   17:30
Duration: 40'
Presenters: Prof. BARABáSI, Albert-László

Nordita  | Last modified 07 March 2015 10:29  |  HELP