更改

跳到导航 跳到搜索
添加2字节 、 2020年12月10日 (四) 15:32
第40行: 第40行:  
当根据内聚力方法对中心性进行分类时,很明显大多数中心性都将被划分于同一类别。起始于给定顶点的步数总和仅取决于步数的定义以及计数方式。这种分类方式的不足表现为它仅能较弱的描绘中心性特征,即按照一步步度('''<font color="#ff8000">度中心性 degree centrality</font>''')到无穷步步长('''<font color="#ff8000">特征向量中心性 eigenvalue centrality</font>''')的方式将中心性置于一种光谱状的分类中。<ref name=Bonacich1987/><ref name="Benzi2013">{{cite journal | last1=Benzi | first1=Michele | last2=Klymko| first2=Christine | year=2013 |title= A matrix analysis of different centrality measures |arxiv=1312.6722 | doi=10.1137/130950550 | volume=36 | issue=2 | journal=SIAM Journal on Matrix Analysis and Applications | pages=686–706}}</ref> 对于采用类似方式定义的各种中心性的观察也表明了这些指数之间的高阶相关性。
 
当根据内聚力方法对中心性进行分类时,很明显大多数中心性都将被划分于同一类别。起始于给定顶点的步数总和仅取决于步数的定义以及计数方式。这种分类方式的不足表现为它仅能较弱的描绘中心性特征,即按照一步步度('''<font color="#ff8000">度中心性 degree centrality</font>''')到无穷步步长('''<font color="#ff8000">特征向量中心性 eigenvalue centrality</font>''')的方式将中心性置于一种光谱状的分类中。<ref name=Bonacich1987/><ref name="Benzi2013">{{cite journal | last1=Benzi | first1=Michele | last2=Klymko| first2=Christine | year=2013 |title= A matrix analysis of different centrality measures |arxiv=1312.6722 | doi=10.1137/130950550 | volume=36 | issue=2 | journal=SIAM Journal on Matrix Analysis and Applications | pages=686–706}}</ref> 对于采用类似方式定义的各种中心性的观察也表明了这些指数之间的高阶相关性。
   −
==网络流特征Characterization by network flows==
+
===网络流特征Characterization by network flows===
    
A network can be considered a description of the paths along which something flows. This allows a characterization based on the type of flow and the type of path encoded by the centrality. A flow can be based on transfers, where each indivisible item goes from one node to another, like a package delivery going from the delivery site to the client's house. A second case is serial duplication, in which an item is replicated so that both the source and the target have it. An example is the propagation of information through gossip, with the information being propagated in a private way and with both the source and the target nodes being informed at the end of the process. The last case is parallel duplication, with the item being duplicated to several links at the same time, like a radio broadcast which provides the same information to many listeners at once.<ref name=Borgatti2005/>
 
A network can be considered a description of the paths along which something flows. This allows a characterization based on the type of flow and the type of path encoded by the centrality. A flow can be based on transfers, where each indivisible item goes from one node to another, like a package delivery going from the delivery site to the client's house. A second case is serial duplication, in which an item is replicated so that both the source and the target have it. An example is the propagation of information through gossip, with the information being propagated in a private way and with both the source and the target nodes being informed at the end of the process. The last case is parallel duplication, with the item being duplicated to several links at the same time, like a radio broadcast which provides the same information to many listeners at once.<ref name=Borgatti2005/>
80

个编辑

导航菜单