Robustness of Analysis of Simplified Networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

Robustness of Analysis of Simplified Networks

Résumé

Networks are a common way to model systems, organizational systems that design these systems, and systems of systems that receive/benefit from these designed systems. They may contain hundreds or thousands of nodes and edges, which may decrease capacity to understand, analyze and make decisions. This paper tests the possibility to remove some elements in networks, mainly weak edges, in order to know if and how much precision is lost in terms of analysis. The results show that, first it is possible in some situations to make such a simplification, since the simplified network analysis is closer to the complete network analysis than the basic analysis, often made without network consideration. Second, this precision is still sensitive to the structure of the initial network and the position of weak links. Several tests on real past modeled networks are made to illustrate this research.

Domaines

Autre
Fichier principal
Vignette du fichier
Kilani and Marle-DSM-Robustness of simplified networks.pdf (570.36 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02379742 , version 1 (25-11-2019)

Identifiants

  • HAL Id : hal-02379742 , version 1

Citer

Meriam Kilani, Franck Marle. Robustness of Analysis of Simplified Networks. 21st INTERNATIONAL DEPENDENCY AND STRUCTURE MODELING CONFERENCE, DSM 2019, Sep 2019, Monterrey, CA, United States. ⟨hal-02379742⟩
63 Consultations
73 Téléchargements

Partager

Gmail Facebook X LinkedIn More