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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
