第25行: |
第25行: |
| | | |
| ==Clustering coefficient== | | ==Clustering coefficient== |
− | =='''<font color="#FF8000">聚集系数</font>'''== | + | ==聚集系数== |
| | | |
| One measure for the presence of triadic closure is [[clustering coefficient]], as follows: | | One measure for the presence of triadic closure is [[clustering coefficient]], as follows: |
第31行: |
第31行: |
| One measure for the presence of triadic closure is clustering coefficient, as follows: | | One measure for the presence of triadic closure is clustering coefficient, as follows: |
| | | |
− | 测量'''<font color="#FF8000">三元闭包</font>'''是否出现的方法之一是'''<font color="#FF8000">聚集系数</font>''',如下所示:
| + | 测量三元闭包是否出现的方法之一是聚集系数,如下所示: |
| | | |
| Let <math>G = (V,E)</math> be an undirected simple graph (i.e., a graph having no self-loops or multiple edges) with V the set of vertices and E the set of edges. Also, let <math>N = |V|</math> and <math>M = |E|</math> denote the number of vertices and edges in G, respectively, and let <math>d_i</math> be the [[degree (graph theory)|degree]] of vertex i. | | Let <math>G = (V,E)</math> be an undirected simple graph (i.e., a graph having no self-loops or multiple edges) with V the set of vertices and E the set of edges. Also, let <math>N = |V|</math> and <math>M = |E|</math> denote the number of vertices and edges in G, respectively, and let <math>d_i</math> be the [[degree (graph theory)|degree]] of vertex i. |
第37行: |
第37行: |
| Let <math>G = (V,E)</math> be an undirected simple graph (i.e., a graph having no self-loops or multiple edges) with V the set of vertices and E the set of edges. Also, let <math>N = |V|</math> and <math>M = |E|</math> denote the number of vertices and edges in G, respectively, and let <math>d_i</math> be the degree of vertex i. | | Let <math>G = (V,E)</math> be an undirected simple graph (i.e., a graph having no self-loops or multiple edges) with V the set of vertices and E the set of edges. Also, let <math>N = |V|</math> and <math>M = |E|</math> denote the number of vertices and edges in G, respectively, and let <math>d_i</math> be the degree of vertex i. |
| | | |
− | 令<math>G =(V,E)</math>是'''<font color="#FF8000">无向简单图 Undirected Simple Graph</font>'''(即,没有'''<font color="#FF8000">自环 Self-loops</font>'''或'''<font color="#FF8000">多重边 Multiple Edges</font>'''的'''<font color="#FF8000">图</font>'''),其中<math>V</math>为'''<font color="#FF8000">顶点 Vertice</font>'''集,<math>E</math>为'''<font color="#FF8000">边 Edge</font>'''集。 另外,令<math>N = |V|</math>和<math>M = |E|</math>分别表示'''<font color="#FF8000">图</font>'''<math>G</math>中'''<font color="#FF8000">顶点</font>'''和'''<font color="#FF8000">边</font>'''的数量,并令<math>d_i</math> 表示'''<font color="#FF8000">顶点</font>'''<math>i</math>的'''<font color="#FF8000">度 Degree</font>'''。 | + | 令<math>G =(V,E)</math>是'''<font color="#FF8000">无向简单图 Undirected Simple Graph</font>'''(即,没有'''<font color="#FF8000">自环 Self-loops</font>'''或'''<font color="#FF8000">多重边 Multiple Edges</font>'''的图),其中<math>V</math>为'''<font color="#FF8000">顶点 Vertice</font>'''集,<math>E</math>为'''<font color="#FF8000">边 Edge</font>'''集。 另外,令<math>N = |V|</math>和<math>M = |E|</math>分别表示'''<font color="#FF8000">图</font>'''<math>G</math>中'''<font color="#FF8000">顶点</font>'''和'''<font color="#FF8000">边</font>'''的数量,并令<math>d_i</math> 表示'''<font color="#FF8000">顶点</font>'''<math>i</math>的'''<font color="#FF8000">度 Degree</font>'''。 |
| | | |
| We can define a triangle among the triple of vertices <math>i</math>, <math>j</math>, and <math>k</math> to be a set with the following three edges: {(i,j), (j,k), (i,k)}. | | We can define a triangle among the triple of vertices <math>i</math>, <math>j</math>, and <math>k</math> to be a set with the following three edges: {(i,j), (j,k), (i,k)}. |