graph_betweenness — CONNGRAPH stats op

• Data kinds: conn_graph → signal

• Call: import fullseye as fs; fs.ledger.graph_betweenness(W: 'Any') -> 'np.ndarray' (to call the implementation directly, import conngraph; conngraph.graph_betweenness(W: 'Any') -> 'np.ndarray'; from the registry, opsconngraph.get("graph_betweenness"))

Usage

> This operator's description has not been translated yet. The original text follows as it is.

媒介中心性(Brandes 2001、二値有向、正規化なし)。ノードごとの長さ n の配列。

ノード v の値 = Σ_{s≠v≠t} σ_st(v) / σ_st(最短路の本数比)。二値構造が対称

(すべての辺が相互)なら無向グラフとして (s, t) と (t, s) を 1 対と数え 2 で割る

—— 無向スター(n 個)の中心が (n−1)(n−2)/2、葉が 0 になる教科書の値。

有向(非対称)なら順序対のまま数える。

Detailed usage guide

• conngraph family guide

References (sample data, literature)

• Sample-data catalog (download URLs / licences) — 2-D uses skimage.data (BSD/public domain) plus synthetic images; 3-D lists download URLs for real data sources (Stanford, PDS, …).

• Operator provenance and references — the sources of the research/methods this op family came from.

• The canonical algorithm (author, year) and its uses are named in the family usage guide above.

Runnable examples (verified samples that actually call this op)

• (none yet)

Ops the type connects to (they accept signal as input)

—

Same category (stats)

graph_degree_table · graph_clustering_coefficient · graph_laplacian_spectrum · graph_spectral_radius · graph_components · graph_modularity · graph_rich_club · graph_motif_count


*Provenance: conngraph.py — CONNGRAPH operator registry. This per-op note is generated by tools/opdocs.py md (do not hand-edit).*

© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.