connectedness(sna)
connectedness()所属R语言包：sna
Compute Graph Connectedness Scores
计算图表连通成绩
译者：生物统计家园网 机器人LoveR
描述----------Description----------
connectedness takes one or more graphs (dat) and returns the Krackhardt connectedness scores for the graphs selected by g.
connectedness需要一个或多个图形（dat），并返回Krackhardt连通分数选择g的图形。
用法----------Usage----------
connectedness(dat, g=NULL)
参数----------Arguments----------
参数：dat
one or more graphs.
一个或多个图形。
参数：g
index values for the graphs to be utilized; by default, all graphs are selected.
可以利用的索引值的图形，默认情况下，所有的图形被选中。
Details
详细信息----------Details----------
Krackhardt's connectedness for a digraph G is equal to the fraction of all dyads, \{i,j\}, such that there exists an undirected path from i to j in G. (This, in turn, is just the density of the weak reachability graph of G.) Obviously, the connectedness score ranges from 0 (for the null graph) to 1 (for weakly connected graphs).
Krackhardt的连通为一个有向图G部分的所有二元关系是平等的，\{i,j\}，存在一个无向路径i到jG 。 （这反过来，仅仅是密度的弱reachability图G）显然，连通的分数范围从0（空图）1，（弱连接图）。
Connectedness is one of four measures (connectedness, efficiency, hierarchy, and lubness) suggested by Krackhardt for summarizing hierarchical structures. Each corresponds to one of four axioms which are necessary and sufficient for the structure in question to be an outtree; thus, the measures will be equal to 1 for a given graph iff that graph is an outtree. Deviations from unity can be interpreted in terms of failure to satisfy one or more of the outtree conditions, information which may be useful in classifying its structural properties.
连通性是一个四项措施（connectedness，efficiency，hierarchy和lubness）所建议的Krackhardt总结分层结构。每个对应于一个四个公理，它是必要的和足够的结构中的问题是一个outtree;因此，措施将等于1，对于一个给定的曲线图，当且仅当该图形是一个outtree。团结偏离可以被解释方面的失败，以满足一个或多个的outtree的条件下，这可能是有用的信息，在其结构性能分类。
值----------Value----------
A vector containing the connectedness scores
一个向量，包含的连通成绩
注意----------Note----------
The four Krackhardt indices are, in general, nondegenerate for a relatively narrow band of size/density combinations (efficiency being the sole exception). This is primarily due to their dependence on the reachability graph, which tends to become complete rapidly as size/density increase. See Krackhardt (1994) for a useful simulation study.
四个Krackhardt指数是，在一般情况下，非简并为相对窄的频带的大小/密度组合（效率是唯一的例外）。这主要是因为他们依赖的可达图，这往往成为完整的大小/密度迅速增加。见Krackhardt（1994年）进行了有益的模拟研究。
（作者）----------Author(s)----------
Carter T. Butts <a href="mailto:buttsc@uci.edu">buttsc@uci.edu</a>
参考文献----------References----------
<h3>See Also</h3>
实例----------Examples----------
#Get connectedness scores for graphs of varying densities[连通分数不同密度图]
connectedness(rgraph(10,5,tprob=c(0.1,0.25,0.5,0.75,0.9)))
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-9-30 10:49:36
