| 当前可读状态与来源 | 打开此版本 → Studies relational structure among nodes using graph representations and measures of degree, centrality, communities and paths. 资料卡来源已关联;不等于专家适用性核验。 来源记录日期:2026-10-06 来源包 SHA-256:26634a4dabae17defbd1b24eb220be86a829dded1d20b5c86720d34d32e856fc |
|---|
| 适用问题 | - relational structure
- diffusion
- position in networks
|
|---|
| 输入 | - 节点、边、方向和权重及网络边界
- 指标或模型选择及缺失关系的处理规则
|
|---|
| 输出 | - 所选网络指标、节点或边层面的统计与图示
- 边界和构网敏感性;中心性不是因果影响力
|
|---|
| 数据条件 | - explicit node/edge definitions
- boundary/sampling rules
- direction/weight/time definitions
|
|---|
| 假设 | - network boundary/edge construction represent studied process
- downstream dependence handled appropriately
|
|---|
| 识别假设 | 此版本未提供 |
|---|
| 不能支持 | - causal mechanism from topology alone
- influence solely from high centrality
|
|---|
| 诊断 | - edge-definition sensitivity
- components
- null/model comparisons when appropriate
- temporal robustness
|
|---|
| 常见失败 | - centrality treated as causal importance
- mixed directed/undirected semantics
- missing-edge/boundary bias
|
|---|
| 替代方法 | - relational event models
- ERGM
- standard regression when relation not estimand
|
|---|
| 软件 | - R igraph/statnet
- Python networkx
|
|---|
| 参考来源与核对范围 | - The Structure and Function of Complex Networks · 来源 ↗
|
|---|