Competitive percolation strategies for network recovery

dc.citation.articleNumber11843
dc.citation.journalTitleScientific Reports
dc.citation.volumeNumber9
dc.contributor.authorSmith, Andrew M.
dc.contributor.authorPósfai, Márton
dc.contributor.authorRohden, Martin
dc.contributor.authorGonzález, Andrés D.
dc.contributor.authorDueñas-Osorio, Leonardo
dc.contributor.authorD’Souza, Raissa M.
dc.date.accessioned2019-11-05T17:30:08Z
dc.date.available2019-11-05T17:30:08Z
dc.date.issued2019
dc.description.abstractRestoring operation of critical infrastructure systems after catastrophic events is an important issue, inspiring work in multiple fields, including network science, civil engineering, and operations research. We consider the problem of finding the optimal order of repairing elements in power grids and similar infrastructure. Most existing methods either only consider system network structure, potentially ignoring important features, or incorporate component level details leading to complex optimization problems with limited scalability. We aim to narrow the gap between the two approaches. Analyzing realistic recovery strategies, we identify over- and undersupply penalties of commodities as primary contributions to reconstruction cost, and we demonstrate traditional network science methods, which maximize the largest connected component, are cost inefficient. We propose a novel competitive percolation recovery model accounting for node demand and supply, and network structure. Our model well approximates realistic recovery strategies, suppressing growth of the largest connected component through a process analogous to explosive percolation. Using synthetic power grids, we investigate the effect of network characteristics on recovery process efficiency. We learn that high structural redundancy enables reduced total cost and faster recovery, however, requires more information at each recovery step. We also confirm that decentralized supply in networks generally benefits recovery efforts.
dc.identifier.citationSmith, Andrew M., Pósfai, Márton, Rohden, Martin, et al.. "Competitive percolation strategies for network recovery." <i>Scientific Reports,</i> 9, (2019) Springer Nature: https://doi.org/10.1038/s41598-019-48036-0.
dc.identifier.digitals41598-019-48036-0
dc.identifier.doihttps://doi.org/10.1038/s41598-019-48036-0
dc.identifier.urihttps://hdl.handle.net/1911/107607
dc.language.isoeng
dc.publisherSpringer Nature
dc.rightsThis 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/.
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/.
dc.titleCompetitive percolation strategies for network recovery
dc.typeJournal article
dc.type.dcmiText
dc.type.publicationpublisher version
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
s41598-019-48036-0.pdf
Size:
2.08 MB
Format:
Adobe Portable Document Format