On the lossy compression of spatial networks
In this paper, we address the lossy compression of spatial networks, namely random geometric graphs, where two nodes are connected by an edge with a probability that depends on the distance between the nodes. We carry out this study by considering the nth order information-distortion function, which...
| Päätekijät: | , , , |
|---|---|
| Aineistotyyppi: | Conference item |
| Kieli: | English |
| Julkaistu: |
IEEE
2024
|