A deterministic approach for rapid identification of the critical links in networks

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F44994575%3A_____%2F19%3AN0000022" target="_blank" >RIV/44994575:_____/19:N0000022 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/00216224:14610/19:00110256 RIV/61989592:15310/19:73597160

Výsledek na webu

<a href="https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0219658" target="_blank" >https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0219658</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1371/journal.pone.0219658" target="_blank" >10.1371/journal.pone.0219658</a>

Jazyk výsledku

angličtina

Název v původním jazyce

A deterministic approach for rapid identification of the critical links in networks

Popis výsledku v původním jazyce

We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.

Název v anglickém jazyce

A deterministic approach for rapid identification of the critical links in networks

Popis výsledku anglicky

We introduce a rapid deterministic algorithm for identification of the most critical links which are capable of causing network disruptions. The algorithm is based on searching for the shortest cycles in the network and provides a significant time improvement compared with a common brute-force algorithm which scans the entire network. We used a simple measure, based on standard deviation, as a vulnerability measure. It takes into account the importance of nodes in particular network components. We demonstrate this approach on a real network with 734 nodes and 990 links. We found the worst scenarios for the cases with and without people living in the nodes. The evaluation of all network breakups can provide transportation planners and administrators with plenty of data for further statistical analyses. The presented approach provides an alternative approach to the recent research assessing the impacts of simultaneous interruptions of multiple links.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10700 - Other natural sciences

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2019

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

PLoS ONE

ISSN

1932-6203

e-ISSN

1932-6203

Svazek periodika

14

Číslo periodika v rámci svazku

7

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

18

Strana od-do

—

Kód UT WoS článku

999

EID výsledku v databázi Scopus

—