更改

跳到导航 跳到搜索
删除772字节 、 2020年5月18日 (一) 15:36
第145行: 第145行:     
从概率的角度来看,局部聚集系数的期望是同一节点的任意两个相邻节点之间存在连接的可能性。
 
从概率的角度来看,局部聚集系数的期望是同一节点的任意两个相邻节点之间存在连接的可能性。
  −
=== Connectedness ===
  −
The way in which a network is connected plays a large part into how networks are analyzed and interpreted. Networks are classified in four different categories:
  −
* ''Clique''/''Complete Graph'': a completely connected network, where all nodes are connected to every other node. These networks are symmetric in that all nodes have in-links and out-links from all others.
  −
* ''Giant Component'': A single connected component which contains most of the nodes in the network.
  −
* ''Weakly Connected Component'': A collection of nodes in which there exists a path from any node to any other, ignoring directionality of the edges.
  −
* ''Strongly Connected Component'': A collection of nodes in which there exists a ''directed'' path from any node to any other.
      
=== 连通性 ===
 
=== 连通性 ===
198

个编辑

导航菜单