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...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Language: | English |
| Published: |
IEEE
2024
|
| _version_ | 1797113290200973312 |
|---|---|
| author | Vippathalla, P Wafula, MW Badiu, M-A Coon, JP |
| author_facet | Vippathalla, P Wafula, MW Badiu, M-A Coon, JP |
| author_sort | Vippathalla, P |
| collection | OXFORD |
| description | 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 quantifies the complexity of a random graph under a distortion criterion. Our main result is a partial characterization of the information-distortion function for a random geometric graph with the Hamming distortion measure. |
| first_indexed | 2024-04-23T08:26:28Z |
| format | Conference item |
| id | oxford-uuid:d8d3a864-1a3e-4c4d-8329-01c671b50d1c |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-04-23T08:26:28Z |
| publishDate | 2024 |
| publisher | IEEE |
| record_format | dspace |
| spelling | oxford-uuid:d8d3a864-1a3e-4c4d-8329-01c671b50d1c2024-04-17T14:47:52ZOn the lossy compression of spatial networksConference itemhttp://purl.org/coar/resource_type/c_5794uuid:d8d3a864-1a3e-4c4d-8329-01c671b50d1cEnglishSymplectic ElementsIEEE2024Vippathalla, PWafula, MWBadiu, M-ACoon, JPIn 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 quantifies the complexity of a random graph under a distortion criterion. Our main result is a partial characterization of the information-distortion function for a random geometric graph with the Hamming distortion measure. |
| spellingShingle | Vippathalla, P Wafula, MW Badiu, M-A Coon, JP On the lossy compression of spatial networks |
| title | On the lossy compression of spatial networks |
| title_full | On the lossy compression of spatial networks |
| title_fullStr | On the lossy compression of spatial networks |
| title_full_unstemmed | On the lossy compression of spatial networks |
| title_short | On the lossy compression of spatial networks |
| title_sort | on the lossy compression of spatial networks |
| work_keys_str_mv | AT vippathallap onthelossycompressionofspatialnetworks AT wafulamw onthelossycompressionofspatialnetworks AT badiuma onthelossycompressionofspatialnetworks AT coonjp onthelossycompressionofspatialnetworks |