Searcharxiv⌕ Search

arXiv subjects

Giovanni G. Soares

Publications and source records attributed to Giovanni G. Soares.

2 recordsLinked to original sources

Vulnerability analysis in Complex Networks under a Flood Risk Reduction point of view

The measurement and mapping of transportation network vulnerability to natural hazards constitute subjects of global interest, especially due to climate change, and for a sustainable development agenda. During a flood, some elements of a transportation network can be affected, causing loss of life of people and damage to vehicles, streets/roads, and other logistics services, sometimes with severe economic impacts. The Network Science approach may offer a valuable perspective considering one type of vulnerability related to network type critical infrastructures: the topological vulnerability. The topological vulnerability index associated with an element is defined as the reduction in the network's average efficiency due to the removal of the set of edges related to that element. We present a topological vulnerability index analysis for the highways in the state of Santa Catarina, Brazil, and produce a map considering that index and the areas susceptible to urban floods and landslides. The risk knowledge, combining hazard and vulnerability, is the first pillar of an Early Warning System, and represent an important tool for stakeholders from the transportation sector in a disaster risk reduction agenda.

physics.soc-ph↗

Beyond the shortest path: the path length index as a distribution

The traditional complex network approach considers only the shortest paths from one node to another, not taking into account several other possible paths. This limitation is significant, for example, in urban mobility studies. In this short report, as the first steps, we present an exhaustive approach to address that problem and show we can go beyond the shortest path, but we do not need to go so far: we present an interactive procedure and an early stop possibility. After presenting some fundamental concepts in graph theory, we presented an analytical solution for the problem of counting the number of possible paths between two nodes in complete graphs, and a depth-limited approach to get all possible paths between each pair of nodes in a general graph (an NP-hard problem). We do not collapse the distribution of path lengths between a pair of nodes into a scalar number, we look at the distribution itself - taking all paths up to a pre-defined path length (considering a truncated distribution), and show the impact of that approach on the most straightforward distance-based graph index: the walk/path length.

cs.DM↗