Random Abstract Simplicial Complexes Reduction

Abstract : 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.
Complete list of metadatas

Cited literature [27 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00864303
Contributor : Anaïs Vergne <>
Submitted on : Monday, September 4, 2017 - 3:56:38 PM
Last modification on : Tuesday, February 11, 2020 - 1:18:11 AM

Files

RASCR.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00864303, version 4
  • ARXIV : 1312.1658

Citation

Anaïs Vergne, Laurent Decreusefond, Philippe Martins. Random Abstract Simplicial Complexes Reduction. 2017. ⟨hal-00864303v4⟩

Share

Metrics

Record views

160

Files downloads

219