graph_degree_preserving_null — GRAPH 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 rewires the graph by `swaps_per_edge * |E|` edge swaps that keep

every node's in- and out-degree exactly (Maslov & Sneppen 2002). 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 and swaps`. Ratios are what let graphs of different size be

compared; raw counts cannot.

Raises `ValueError: as :func: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.