Abstract
The objective we focus on here consists in discovering the topology of an energy distribution network modeled by a flow digraph from which we only know the set of arcs without identification of their extremities. We also have as inputs a set of temporal series of flow measures on these arcs and the correlation matrix of the arcs, with possible errors. From these inputs, we consider the graph which incidence matrix is the correlation one. If the correlation matrix contains no errors, this graph is the line graph of the network to be discovered. Thus, given this graph, we then propose here algorithms determining the graph with the same vertex set being a line graph and maximizing the set of similar edges with the initial correlation graph. We then evaluate the performances of this approach by simulation on 50 networks, randomly generated.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Degiorgi, D.G., Simon, K.: A dynamic algorithm for line graph recognition. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 37–48. Springer, Heidelberg (1995). doi:10.1007/3-540-60618-1_64
Lin, J., Keogh, E., Fu, A.: Hot sax: efficiently finding the most unusual time series subsequence. In: Fifth IEEE International Conference on Data Mining, ICDM 2005, pp. 226–233. IEEE, 27–30 November 2005
Harary, F.: Line graphs. In: Graph Theory, pp. 71–83. Addison-Wesley, Massachusetts (1972). Chap. 8
Lehot, P.G.H.: An optimal algorithm to detect a line graph and output its root graph. J. ACM 21, 569–575 (1974). Association for Computing Machinery (ACM)
Whitney, H.: Congruent graphs and the connectivity of graphs. In: Hassler Whitney Collected Papers, pp. 61–79. Birkhäuser Boston (1992)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Ehounou, W.J., Barth, D., De Moissac, A. (2017). Discovery of Energy Network Topology from Uncertain Flow Measurements. In: Rothe, J. (eds) Algorithmic Decision Theory. ADT 2017. Lecture Notes in Computer Science(), vol 10576. Springer, Cham. https://doi.org/10.1007/978-3-319-67504-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-319-67504-6_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-67503-9
Online ISBN: 978-3-319-67504-6
eBook Packages: Computer ScienceComputer Science (R0)