Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network - Laboratoire Interdisciplinaire des Sciences du Numérique Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2020

Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network

Abstract

Our objective is to discover the topology of an energy distribution network modeled by a flow digraph from which we know the set of arcs without identification of their extremities. We also know possible correlations between these arcs from measurements in which errors could occur. To discover the network's topology from the obtained correlation matrix between arcs, we consider the graph whose incidence matrix is the correlation matrix with entries rounded to zero or one. Without errors in the correlations, this graph is the line-graph of the distribution network. We propose an algorithm that given the rounded correlation matrix M, finds the incidence matrix of a line-graph with minimum Hamming distance to M. We then evaluate the performance of this approach by simulation.
Fichier principal
Vignette du fichier
JGAA-2020.pdf (1.46 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04113890 , version 1 (26-07-2023)

Identifiers

Cite

Wilfried Ehounou, Dominique Barth, Arnaud de Moissac, Dimitri Watel, Marc-Antoine Weisser. Minimizing the Hamming distance between a graph and a line-graph to discover the topology of an electrical network. Journal of Graph Algorithms and Applications, 2020, 24 (3), pp.133-153. ⟨10.7155/jgaa.00522⟩. ⟨hal-04113890⟩
24 View
20 Download

Altmetric

Share

Gmail Facebook X LinkedIn More