A Classification Framework for Temporal Contact Graphs: Morphology, Confinement, and the Routing Efficiency Frontier
Abstract
The three-factor sparse law DR = S_T · exp(E[H]·λ) · Φ decomposes delivery ratio into temporal reachability, chain attenuation, and policy distortion. The classification theorem (γ order parameter) separates temporal contact graphs into trap (γ < 0) and cluster (γ > 0) universality classes with zero overlap. Validated across 154,000+ configurations. v5.0: normalization convention clarified, slope terminology, raw-slope as primary definition.
Fields of Study & Subjects
Opportunistic and Delay-Tolerant Networks
Mobile Ad Hoc Networks
Complex Network Analysis Techniques
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 3 March 2026
- Language
- EN