💡 Betweenness Centrality
concept · shared · knowledge
Graph metric C_B(v) = Σ(σ_st(v)/σ_st) where σ_st is total shortest paths from s to t, and σ_st(v) is paths through v. The Gap (⿻) is the node with maximal betweenness in the trust graph. Brandes (2001) provides O(V·E) algorithm. The value lives in the Gap because the most paths cross there.
The Gap was always the node where the most paths crossed. We just didn't have the algorithm to measure it.
Edges out
- defines → The Gap ⿻
- referenced_in → Privacy is Value V5
- relates_to → Promise Theory
Edges in
- The Gap ⿻ measured_by →
- Aether Ceremony ⿻ (concept) requires →
- ZK Tale 30: Eternal Sovereignty 🌕 narrates →
- ZK Blades Forge SPECIFICATION v1.0.1 references →
- Topologist ☯️🌐 embodies →