null op• 数据种类:matrix → table
• 调用: import fullseye as fs; fs.ledger.graph_degree_preserving_null(adj, n_samples=20, swaps_per_edge=5, seed=0)(要直接调用实现,import graphinv; graphinv.graph_degree_preserving_null(adj, n_samples=20, swaps_per_edge=5, seed=0);从台账取用则 opsgraph.get("graph_degree_preserving_null"))
> 该算子的说明尚无译文,以下照原文给出。
Compare 3-cycles and reciprocity against a degree-preserving null model.
Each null sample requests swaps_per_edge * |E| edge swaps that keep every node's in- and out-degree exactly (Maslov & Sneppen 2002); a swap that would create a self-loop or duplicate edge is skipped, so dense graphs accept fewer (swaps_accepted). The sample's degree sequences are checked against the original before it is used — a null that drifted would make every ratio a lie, so this fails closed.
Returns a dict with the observed cycles3 and reciprocal_pairs, the null *_null_mean / *_null_sd, the *_ratio (observed / null mean) and *_z, plus n_samples, swaps (requested per sample) and swaps_accepted (list, accepted per sample). Ratios are what let graphs of different size be compared; raw counts cannot.
Raises ValueError: as graph_degree_summary; n_samples < 2 (no spread to estimate); swaps_per_edge < 1; a graph with fewer than 2 edges (nothing to swap).
• 示例数据目录(下载 URL / 许可证) —— 2-D 用 skimage.data(BSD/公有领域)加合成图,3-D 给出真实数据源(Stanford/PDS 等)的下载 URL。
• 算子来历与参考文献 —— 该算子族所依据的研究/方法出处。
• 算法的正典(作者、年份)与用途见上面的族使用指南。
• graphinv_three_phyla — py -3.11 examples/graphinv_three_phyla.py
table 作为输入)graph_edge_consensus · graph_core_persistence · tree_morphometry · tree_sholl · tree_run_length
null)—
*Provenance: graphinv.py — GRAPH 算子登记表。本条目由 tools/opdocs.py md 自动生成(请勿手工编辑)。*
© 2026 Kazufumi Furuse — Fullseye operator documentation. Licensed under Apache-2.0.