Robustness analysis of network controllability

Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. H...

Full description

Saved in:
Bibliographic Details
Published in:Physica A 2012-09, Vol.391 (18), p.4420-4425
Main Authors: Pu, Cun-Lai, Pei, Wen-Jiang, Michaelson, Andrew
Format: Article
Language:English
Subjects:
Algorithms
Cascade control
Cascade failure
Controllability
Drivers
Failure
Network controllability
Networks
Robustness
Statistical mechanics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973
cites cdi_FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973
container_end_page 4425
container_issue 18
container_start_page 4420
container_title Physica A
container_volume 391
creator Pu, Cun-Lai
Pei, Wen-Jiang
Michaelson, Andrew
description Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure. ► We study the robustness of network controllability for directed complex networks. ► Degree-based attacks are efficient on network structural controllability. ► Cascade failures also do great harm to network controllability.
doi_str_mv 10.1016/j.physa.2012.04.019
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671309043</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0378437112003135</els_id><sourcerecordid>1671309043</sourcerecordid><originalsourceid>FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-Ai89emnNNG3SHDzI4hcsCKLnkGanmLXbrJms0n9v1_XsaRh4n-Gdh7FL4AVwkNfrYvs-ki1KDmXBq4KDPmIzaJTISwB9zGZcqCavhIJTdka05pyDEuWMFS-h3VEakCizg-1H8pSFLhswfYf4kbkwpBj63ra-92k8Zyed7Qkv_uacvd3fvS4e8-Xzw9Pidpk7IWTKm6YCbGuJnYSubCWvpXCl1Fy1utbCTp0r3TnU066tU7JBCyBU3bYaa63EnF0d7m5j-NwhJbPx5HDqMWDYkQGpQHDNKzFFxSHqYiCK2Jlt9BsbRwPc7O2Ytfm1Y_Z2DK_MZGeibg4UTl98eYyGnMfB4cpHdMmsgv-X_wGWZm4w</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1671309043</pqid></control><display><type>article</type><title>Robustness analysis of network controllability</title><source>ScienceDirect Freedom Collection</source><creator>Pu, Cun-Lai ; Pei, Wen-Jiang ; Michaelson, Andrew</creator><creatorcontrib>Pu, Cun-Lai ; Pei, Wen-Jiang ; Michaelson, Andrew</creatorcontrib><description>Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure. ► We study the robustness of network controllability for directed complex networks. ► Degree-based attacks are efficient on network structural controllability. ► Cascade failures also do great harm to network controllability.</description><identifier>ISSN: 0378-4371</identifier><identifier>EISSN: 1873-2119</identifier><identifier>DOI: 10.1016/j.physa.2012.04.019</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Cascade control ; Cascade failure ; Controllability ; Drivers ; Failure ; Network controllability ; Networks ; Robustness ; Statistical mechanics</subject><ispartof>Physica A, 2012-09, Vol.391 (18), p.4420-4425</ispartof><rights>2012 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973</citedby><cites>FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Pu, Cun-Lai</creatorcontrib><creatorcontrib>Pei, Wen-Jiang</creatorcontrib><creatorcontrib>Michaelson, Andrew</creatorcontrib><title>Robustness analysis of network controllability</title><title>Physica A</title><description>Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure. ► We study the robustness of network controllability for directed complex networks. ► Degree-based attacks are efficient on network structural controllability. ► Cascade failures also do great harm to network controllability.</description><subject>Algorithms</subject><subject>Cascade control</subject><subject>Cascade failure</subject><subject>Controllability</subject><subject>Drivers</subject><subject>Failure</subject><subject>Network controllability</subject><subject>Networks</subject><subject>Robustness</subject><subject>Statistical mechanics</subject><issn>0378-4371</issn><issn>1873-2119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-Ai89emnNNG3SHDzI4hcsCKLnkGanmLXbrJms0n9v1_XsaRh4n-Gdh7FL4AVwkNfrYvs-ki1KDmXBq4KDPmIzaJTISwB9zGZcqCavhIJTdka05pyDEuWMFS-h3VEakCizg-1H8pSFLhswfYf4kbkwpBj63ra-92k8Zyed7Qkv_uacvd3fvS4e8-Xzw9Pidpk7IWTKm6YCbGuJnYSubCWvpXCl1Fy1utbCTp0r3TnU066tU7JBCyBU3bYaa63EnF0d7m5j-NwhJbPx5HDqMWDYkQGpQHDNKzFFxSHqYiCK2Jlt9BsbRwPc7O2Ytfm1Y_Z2DK_MZGeibg4UTl98eYyGnMfB4cpHdMmsgv-X_wGWZm4w</recordid><startdate>20120915</startdate><enddate>20120915</enddate><creator>Pu, Cun-Lai</creator><creator>Pei, Wen-Jiang</creator><creator>Michaelson, Andrew</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7U5</scope><scope>8FD</scope><scope>H8D</scope><scope>L7M</scope></search><sort><creationdate>20120915</creationdate><title>Robustness analysis of network controllability</title><author>Pu, Cun-Lai ; Pei, Wen-Jiang ; Michaelson, Andrew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Cascade control</topic><topic>Cascade failure</topic><topic>Controllability</topic><topic>Drivers</topic><topic>Failure</topic><topic>Network controllability</topic><topic>Networks</topic><topic>Robustness</topic><topic>Statistical mechanics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Pu, Cun-Lai</creatorcontrib><creatorcontrib>Pei, Wen-Jiang</creatorcontrib><creatorcontrib>Michaelson, Andrew</creatorcontrib><collection>CrossRef</collection><collection>Solid State and Superconductivity Abstracts</collection><collection>Technology Research Database</collection><collection>Aerospace Database</collection><collection>Advanced Technologies Database with Aerospace</collection><jtitle>Physica A</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Pu, Cun-Lai</au><au>Pei, Wen-Jiang</au><au>Michaelson, Andrew</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robustness analysis of network controllability</atitle><jtitle>Physica A</jtitle><date>2012-09-15</date><risdate>2012</risdate><volume>391</volume><issue>18</issue><spage>4420</spage><epage>4425</epage><pages>4420-4425</pages><issn>0378-4371</issn><eissn>1873-2119</eissn><abstract>Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks and cascading failures. Results show that degree-based attacks are more efficient than random attacks on network structural controllability. Cascade failures also do great harm to network controllability even if they are triggered by a local node failure. ► We study the robustness of network controllability for directed complex networks. ► Degree-based attacks are efficient on network structural controllability. ► Cascade failures also do great harm to network controllability.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.physa.2012.04.019</doi><tpages>6</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0378-4371
ispartof Physica A, 2012-09, Vol.391 (18), p.4420-4425
issn 0378-4371
1873-2119
language eng
recordid cdi_proquest_miscellaneous_1671309043
source ScienceDirect Freedom Collection
subjects Algorithms
Cascade control
Cascade failure
Controllability
Drivers
Failure
Network controllability
Networks
Robustness
Statistical mechanics
title Robustness analysis of network controllability
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T20%3A58%3A16IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robustness%20analysis%20of%20network%20controllability&rft.jtitle=Physica%20A&rft.au=Pu,%20Cun-Lai&rft.date=2012-09-15&rft.volume=391&rft.issue=18&rft.spage=4420&rft.epage=4425&rft.pages=4420-4425&rft.issn=0378-4371&rft.eissn=1873-2119&rft_id=info:doi/10.1016/j.physa.2012.04.019&rft_dat=%3Cproquest_cross%3E1671309043%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c336t-8841eb56ef61f2b60563c26907b9593a01649fce97b99ac768ea11375bb9e5973%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=1671309043&rft_id=info:pmid/&rfr_iscdi=true