Answers are grounded in this paper and cite their sources.
Analyzes number-theoretic graphs’ structure and routing efficiency, emphasizing their small-world nature and connectivity features.
We study a family of deterministic graphs on the vertex set V = {1, 2, …, n} defined by elementary number-theoretic rules: the prime-sum graph Pn (edge {i,j} iff i+j is prime) and the power-of-two difference graph Dn (edge {i,j} iff |i−j| = 2k). Version 2 additions over v1: NAF distance bounds (Theorem 5.3, Proposition 5.4): Graph distance in Dn is bounded between NAF weight and popcount of the displacement, with rigorous proofs Triangle count theorem (Theorem 4.2): Closed-form T(n) = M·n − 2(2M − 1), proving all triangles are isoceles triples Automorphism group (Proposition 4.3): Aut(Dn) ≅ ℤ₂ — only reflection, unlike circulant graphs with ≥n automorphisms Percolation heuristic model: Number-theoretic explanation of k* ≈ c·log₂n via prime density in short intervals Directed variant analysis: Forward-only Dn achieves ⌈log₂n⌉-hop reachability using popcount paths Expanded related work: 6 new citations including Loguinov et al. (2003), Briggs & McDonald (2025), Filz (1982), Chen et al. (2021), Comellas et al. (2000), Martineau (2022) Greedy = NAF conjecture: Honest labeling of the 97.4% empirical optimality as a conjecture with overshoot-and-correct mechanism Key findings: Sharp connectivity phase transition at k* = 19 ≈ 1.54·log₂n with only 0.096% density Dn is a strong small-world graph (σ = 19.96): clustering 28× random, path lengths only 1.44× random Greedy routing: 100% delivery, 97.4% BFS-optimal, mean stretch 1.008 Pn is bipartite and triangle-free (parity proof) Union graph Pn ∪ Dn is anti-small-world — naive rule composition destroys clustering 13 pages. All claims backed by reproducible JSON evidence. Code: github.com/MirrorDNA-Reflection-Protocol/MirrorGraph
No takes yet. Share an insight, caveat, or question.
Desai et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: