2014
DOI: 10.1016/j.physa.2014.05.073
|View full text |Cite
|
Sign up to set email alerts
|

Robustness of city road networks at different granularities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
61
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 106 publications
(68 citation statements)
references
References 27 publications
0
61
0
Order By: Relevance
“…Yang, Y.H. et al evaluated the robustness of rail transit in Beijing with complex network theory, and designed a method of weighting index of node importance, which can guide the site selection [16]. Cats, O performed the full-scan of network links, and analyzed the impacts of each disruption in terms of how the disruption influences the travel experience of population (cut-off, delayed, unaffected).…”
Section: Literature Reviewmentioning
confidence: 99%
See 2 more Smart Citations
“…Yang, Y.H. et al evaluated the robustness of rail transit in Beijing with complex network theory, and designed a method of weighting index of node importance, which can guide the site selection [16]. Cats, O performed the full-scan of network links, and analyzed the impacts of each disruption in terms of how the disruption influences the travel experience of population (cut-off, delayed, unaffected).…”
Section: Literature Reviewmentioning
confidence: 99%
“…Some scholars consider the influence of adjacent nodes on the critical node importance and propose a shortest path number N e that also takes node neighbors in consideration. Besides, synthetic measures combining K i , B i , N e is put forward based on the weighted method [16] and AHP method [32]. Oriol Lordan summarized the existing research the effectiveness (measured in terms of reduction of the size of the giant component of has been compared) attacks based on five different measures: degree, betweenness, modal analysis, damage and Bonacich power [15].…”
Section: Critical Node Identificationmentioning
confidence: 99%
See 1 more Smart Citation
“…Degree is defined as the number of connections of a given node [12,14]. A high degree demonstrates that the node connects to more nodes [11]. Boldi, Rosa and Vigna [14] reported that this strategy is a baseline as the degree is the first shot at centrality in a network.…”
Section: Node-removal Strategiesmentioning
confidence: 99%
“…We remove node in increasing betweenness order. The betweenness index is computed by identifying the shortest paths linking pairs of nodes and counting the number of times these paths cross each Freeman node [11,12]. Betweenness is a type of global factor [11,12].…”
Section: Node-removal Strategiesmentioning
confidence: 99%