Projects per year
Design and analysis of networks have many applications in the engineering sciences. This dissertation seeks to contribute to the methods used in the analysis of networks with a view towards assisting decision making processes. Networks are initially considered as objects in the category of graphs and later as objects in the category of hypergraphs. The connection with the category of simplicial pairs become apparent when the topology is analyzed using homological algebra. A topological ranking is developed that measures the ability of the network to stay path-connected. Combined with the analysis of cover ideals of hypergraphs, the topological ranking demonstrates the non-trivial decisions that needs to be considered in system design. All the methods developed here have an underlying common structure, namely that they all appear at solution sets for systems of polynomials. These solution sets are called algebraic varieties.
|Publisher||Technical University of Denmark, Department of Electrical Engineering|
|Number of pages||123|
|Publication status||Published - 2016|
15/05/2013 → 08/02/2017