betweenness_centrality
Generic Description
Score nodes by how often they lie on shortest paths between other nodes.
Simple example:
CALL nexyron.betweenness_centrality()
Centrality procedures rank nodes by structural importance. They are useful for influence, dependency, bottleneck, and exposure analysis, but each metric encodes a different meaning of importance.
Consumer-Level Explanation
Use betweenness_centrality when score nodes by how often they lie on shortest paths between other nodes is the graph-analysis or operational question you actually need to answer. Keep the call explicit because its YIELD columns, row grain, and required runtime state determine how the rest of the Cypher pipeline can safely compose it.
Conceptual Explanation
betweenness_centrality should be read as one named procedure contract in the broader Nexyron Cypher surface. The procedure call is not only a syntax hook: it defines what runtime state, projection, registry entry, or graph algorithm is being asked to operate, and it determines which output columns downstream YIELD, WITH, and RETURN stages can safely use.
More Detailed Explanation
This differs from PageRank or degree metrics because it emphasizes brokerage and mediation rather than popularity or endorsement
In practical queries, start by deciding the row grain you want after the call: one row per node, one row per path, one row per registry object, one row per artifact, or one row per summary. Then keep that grain explicit with YIELD and named projections. That is the difference between a useful planner-facing example and a vague call that downstream tooling cannot safely compose. For contract-driven procedures, the executable examples on these pages intentionally inspect procedure metadata unless the required named artifacts are created in the same example.
How It Differs From Nearby Algorithms
This differs from PageRank or degree metrics because it emphasizes brokerage and mediation rather than popularity or endorsement.
Advanced Example
This example yields named columns from betweenness_centrality and returns a bounded result shape that downstream planner tooling can compose without guessing column names or row grain.
CALL nexyron.betweenness_centrality() YIELD node_id, centrality
RETURN node_id, centrality
LIMIT 10
Real Use Cases
- finding chokepoints and brokers
- detecting cross-community bridges
- service dependency bottleneck analysis
- compare algorithm output with domain labels or time windows before operationalizing it
- feed graph-analytic scores into ranked reports, feature contracts, or investigation queues only after checking the modeling assumptions
Real Limitations And Tradeoffs
- computationally heavier than simpler centrality metrics
- shortest-path assumptions may not reflect real-world flow
- algorithm output reflects the projected graph, not an abstract real-world network outside the data model
- nearby algorithms can answer different questions even when their output columns look similar