Persistent homology and dualityKališnik Verovšek, Sara (Avtor) Smrekar, Jaka (Mentor) Repovš, Dušan (Komentor) Alexander dualitypersistent homologyzigzag persistencelevelset zigzag persistenceparametrized homologyAn important problem with sensor networks is that they do not provide information about the regions that are not covered by their sensors. If the sensors in a network are static, then the Alexander Duality Theorem from classic algebraic topology is sufficient to determine the coverage of a network. However, in many networks the nodes change position with time. In the case of dynamic sensor networks, we consider the covered and uncovered regions as parametrized spaces with respect to time. Parametrized homology is a variant of zigzag persistent homology that measures how the homology of the levelsets of the space changes as we vary the parameter. We present a few theorems that extend different versions of classical Alexander Duality theorem to the setting of parametrized homology theories. This approach sheds light on the practical problem of 'wandering' loss of coverage within dynamic sensor networks.[S. Kališnik]20132017-09-22 02:53:37Doktorsko delo/naloga95849UDK: 515.14(043.3)COBISS_ID: 16756057sl