Analyse de la vulnérabilité d’un réseau via la mesure de l’entropie de Von Neumann.
Communication avec acte
Date
2019-09Abstract
In this work, we present a new strategy for measuring the vulnerability of network connections, modeled by a graph, via the
variations of the Von Neumann entropy of the density matrix associated to this graph, this one being seen as a quantum system. We show that the change of the weight of an edge impacts the resulting Von Neumann entropy, which includes not only the intensity of the perturbation induced but also a quantity related to the degrees of the nodes adjacent to the perturbed edge. An algorithm based on this strategy has been developed. The obtained results confirm the relevance of this new measure. Our algorithm highlights the discontinuities that could appear in the structure by proposing a hierarchical decomposition into subgraphs relative to the degrees of vulnerability of the edges. The obtained map guarantees a better network security.
Files in this item
- Name:
- IRENAV_GRETSI_2019_BAY-AHMED.pdf
- Size:
- 872.6Kb
- Format:
- Description:
- Article Gretsi 2019
Collections
Related items
Showing items related by title, author, creator and subject.
-
Communication avec acteIn this work a new denoising scheme based on the empirical mode decomposition associated with a frequency analysis is introduced. Compared to classical approaches where the extracted modes are thresholded in time domain, ...
-
Communication avec acteLa notion de mesure de similarité est très importante dans de nombreux domaines tels que l’apprentissage statistique, la fouille de données ou les sciences cognitives. Dans cet article, nous nous intéressons à la similarité ...
-
Communication avec acteIn this work, we consider the problem of graph signals classification. We investigate the relevance of two attributes, namely the total variation (TV) and the graph energy (GE) for graph signals classification. The TV is ...
-
Article dans une revue avec comité de lectureIn spite of the simple linear relationship between the adjacency A and the Laplacian L matrices, L=D-A where D is the degrees matrix, these matrices seem to reveal informations about the graph in different ways, where it ...
-
Communication avec acteDans cet article, nous présentons une stratégie de détection d’épilepsie à partir de signaux EEG (issus d’un seul capteur) basée sur l’algorithme de visibilité, qui consiste à transformer une série temporelle en un graphe ...