arXiv (All)
open access
Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
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 nove
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- OpenZL: Using Graphs to Compress Smaller and Faster#175359
- Mutual visibility in Moore graphs and $(d,2)$-graphs with defect#665565
- Mutual visibility in Moore graphs and $(d,2)$-graphs with defect#664065
- Structural Entropy-Driven Graph Diffusion Generation for One-Shot Federated Graph Learning#974071
- Out of Sight: Compression-Aware Content Protection against Agentic Crawlers#352991
Record · ID 926025
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive