Cargando…
Target control based on edge dynamics in complex networks
In the past decade, the study of the dynamics of complex networks has been a focus of research. In particular, the controllability of complex networks based on the nodal dynamics has received strong attention. As a result, significant theories have been formulated in network control. Target control...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Nature Publishing Group UK
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7305316/ https://www.ncbi.nlm.nih.gov/pubmed/32561879 http://dx.doi.org/10.1038/s41598-020-66524-6 |
_version_ | 1783548434085576704 |
---|---|
author | Lu, Furong Yang, Kaikai Qian, Yuhua |
author_facet | Lu, Furong Yang, Kaikai Qian, Yuhua |
author_sort | Lu, Furong |
collection | PubMed |
description | In the past decade, the study of the dynamics of complex networks has been a focus of research. In particular, the controllability of complex networks based on the nodal dynamics has received strong attention. As a result, significant theories have been formulated in network control. Target control theory is one of the most important results among these theories. This theory addresses how to select as few input nodes as possible to control the chosen target nodes in a nodal linear dynamic system. However, the research on how to control the target edges in switchboard dynamics, which is a dynamical process defined on the edges, has been lacking. This shortcoming has motivated us to give an effective control scheme for the target edges. Here, we propose the k-travel algorithm to approximately calculate the minimum number of driven edges and driver nodes for a directed tree-like network. For general cases, we put forward a greedy algorithm TEC to approximately calculate the minimum number of driven edges and driver nodes. Analytic calculations show that networks with large assortativity coefficient as well as small average shortest path are efficient in random target edge control, and networks with small clustering coefficient are efficient in local target edge control. |
format | Online Article Text |
id | pubmed-7305316 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2020 |
publisher | Nature Publishing Group UK |
record_format | MEDLINE/PubMed |
spelling | pubmed-73053162020-06-23 Target control based on edge dynamics in complex networks Lu, Furong Yang, Kaikai Qian, Yuhua Sci Rep Article In the past decade, the study of the dynamics of complex networks has been a focus of research. In particular, the controllability of complex networks based on the nodal dynamics has received strong attention. As a result, significant theories have been formulated in network control. Target control theory is one of the most important results among these theories. This theory addresses how to select as few input nodes as possible to control the chosen target nodes in a nodal linear dynamic system. However, the research on how to control the target edges in switchboard dynamics, which is a dynamical process defined on the edges, has been lacking. This shortcoming has motivated us to give an effective control scheme for the target edges. Here, we propose the k-travel algorithm to approximately calculate the minimum number of driven edges and driver nodes for a directed tree-like network. For general cases, we put forward a greedy algorithm TEC to approximately calculate the minimum number of driven edges and driver nodes. Analytic calculations show that networks with large assortativity coefficient as well as small average shortest path are efficient in random target edge control, and networks with small clustering coefficient are efficient in local target edge control. Nature Publishing Group UK 2020-06-19 /pmc/articles/PMC7305316/ /pubmed/32561879 http://dx.doi.org/10.1038/s41598-020-66524-6 Text en © The Author(s) 2020 Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/. |
spellingShingle | Article Lu, Furong Yang, Kaikai Qian, Yuhua Target control based on edge dynamics in complex networks |
title | Target control based on edge dynamics in complex networks |
title_full | Target control based on edge dynamics in complex networks |
title_fullStr | Target control based on edge dynamics in complex networks |
title_full_unstemmed | Target control based on edge dynamics in complex networks |
title_short | Target control based on edge dynamics in complex networks |
title_sort | target control based on edge dynamics in complex networks |
topic | Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7305316/ https://www.ncbi.nlm.nih.gov/pubmed/32561879 http://dx.doi.org/10.1038/s41598-020-66524-6 |
work_keys_str_mv | AT lufurong targetcontrolbasedonedgedynamicsincomplexnetworks AT yangkaikai targetcontrolbasedonedgedynamicsincomplexnetworks AT qianyuhua targetcontrolbasedonedgedynamicsincomplexnetworks |