Work

Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs

Year: 2026

Type: preprint

Abstract: We consider the distributed compression of Soft Random Geometric Graphs (SRGGs) above the connectivity threshold. We establish the Slepian-Wolf rate region for the SRGG in the setting where there are a finite number of encoders compressing sections of the graph independently. To do so, we prove novel limit theorems and asymptotic equipartition properties for the SRGG and its entropy, which allow us to use random binning techniques for distributed compression.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2605.04703

Authors: Baker, Oliver, Dettmann, Carl P.

Institution: University of Bristol

Language: English

Topic: Error Correcting Code Techniques

Subfield: Computer Networks and Communications

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Engineering and Physical Sciences Research Council

Award: EPSRC Centre for Doctoral Training in Computational Statistics and Data Science: COMPASS

OpenAlex ID: W7160552120

Cites: 1

Cited by:

Related to: 10