Measurable versions of Whitney's 2-isomorphism theorem are established for locally finite graphings by defining weak isomorphisms that preserve edge measures, cycles, and hyperfinite subgraphs, with rigidity for weakly 3-connected infinitely-ended cases and implementation via countable measurable Wh
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Derives the Slepian-Wolf rate region for distributed source coding of connected soft random geometric graphs by proving new entropy limit theorems and asymptotic equipartition properties.
citing papers explorer
-
Whitney's 2-isomorphism theorem for graphings
Measurable versions of Whitney's 2-isomorphism theorem are established for locally finite graphings by defining weak isomorphisms that preserve edge measures, cycles, and hyperfinite subgraphs, with rigidity for weakly 3-connected infinitely-ended cases and implementation via countable measurable Wh
-
Entropy and Distributed Source Coding of Connected Soft Random Geometric Graphs
Derives the Slepian-Wolf rate region for distributed source coding of connected soft random geometric graphs by proving new entropy limit theorems and asymptotic equipartition properties.