Infrastructure Network Vulnerability
Kamissoko Daouda,Zarate Pascale,Peres Francois +2 more
- 27 Jun 2011
- pp 305-312
TL;DR: A general model of vulnerability analysis including societal parameters is presented and a methodology of analyzing infrastructure network vulnerability in the field of prevention or reduction of the natural disaster consequences is proposed.
read more
Abstract: The work presented in this paper aims to propose a methodology of analyzing infrastructure network vulnerability in the field of prevention or reduction of the natural disaster consequences. After a state of the art on vulnerability models in the academic literature, the various vulnerability factors are classified and discussed. Eventually, a general model of vulnerability analysis including societal parameters is presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Betweenness Centrality in Large Complex Networks
TL;DR: In this article, the authors analyzed the betweenness centrality of nodes in large complex networks and showed that for trees or networks with a small loop density, a larger density of loops leads to the same result.
477
A Survey on Efficient Group Key Management Schemes in Wireless Networks
Raju Barskar,Meenu Chawla +1 more
TL;DR: This paper analyzes key management algorithms in wireless networks and compared various factors of performance like storage overhead, commutation overhead and communication overhead during the join and leave process in groups in wireless group key management approaches, with a set of assessment parameters.
16
Resilience assessment of multi-decision complex energy interconnection system
TL;DR: In this paper , the authors proposed a resilience evaluation method based on system dynamics theory to study the resilience and dynamic behaviors of multi-decision complex energy interconnected system under malicious attack.
15
Decision Support for Infrastructure network vulnerability assessment in natural disaster crisis situations
Daouda Kamissoko
- 01 May 2014
TL;DR: The VESTA project aims to propose a methodology of analyzing infrastructure network risk and vulnerability in the field of prevention or reduction of the natural disaster consequences, which will lead to a decision support system multi-view, multi-stakeholder, and communication’s model.
12
Decision Support System for Infrastructure Network Vulnerability to Natural Disaster
Daouda Kamissoko,François Pérès,Pascale Zaraté +2 more
- 01 Jan 2013
TL;DR: The VESTA project aims to propose a methodology of analysing infrastructure network risk and vulnerability in the field of prevention or reduction of the natural disaster consequences, which will lead to a decision support system multi-view, multi-stakeholder, and communication’s approach.
1
References
The Structure and Function of Complex Networks
TL;DR: Developments in this field are reviewed, including such concepts as the small-world effect, degree distributions, clustering, network correlations, random graph models, models of network growth and preferential attachment, and dynamical processes taking place on networks.
Exploring complex networks
TL;DR: This work aims to understand how an enormous network of interacting dynamical systems — be they neurons, power stations or lasers — will behave collectively, given their individual dynamics and coupling architecture.
Error and attack tolerance of complex networks
TL;DR: It is found that scale-free networks, which include the World-Wide Web, the Internet, social networks and cells, display an unexpected degree of robustness, the ability of their nodes to communicate being unaffected even by unrealistically high failure rates.
8.4K
Error and attack tolerance of complex networks
TL;DR: In this paper, the authors demonstrate that error tolerance is not shared by all redundant systems, but it is displayed only by a class of inhomogeneously wired networks, called scale-free networks.
6.9K
A faster algorithm for betweenness centrality
TL;DR: New algorithms for betweenness are introduced in this paper and require O(n + m) space and run in O(nm) and O( nm + n2 log n) time on unweighted and weighted networks, respectively, where m is the number of links.