Random Abstract Simplicial Complexes Reduction

Anaïs Vergne, Laurent Decreusefond, Philippe Martins

Random abstract simplicial complex representation provides a mathematical description of wireless networks and their topology. In order to reduce the energy consumption in this type of network, we intend to reduce the number of network nodes without modifying neither the connectivity nor the coverage of the network. In this paper, we present a reduction algorithm that lower the number of points of an abstract simplicial complex in an optimal order while maintaining its topology. Then, we study the complexity of such an algorithm for a network simulated by a binomial point process and represented by a Vietoris-Rips complex.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment