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.

翻译：我们研究了在连通阈值以上软随机几何图（SRGG）的分布式压缩问题。在有限数量编码器独立压缩图的不同部分这一设定下，我们建立了SRGG的Slepian-Wolf可达速率区域。为此，我们证明了SRGG及其熵的新极限定理与渐近均匀分割性质，从而能够采用随机装箱技术实现分布式压缩。