R语言 sna包 hierarchy()函数中文帮助文档(中英文对照)

loveR

hierarchy(sna)
hierarchy()所属R语言包：sna

                                         Compute Graph Hierarchy Scores
                                         计算图表层次分数

                                         译者：生物统计家园网 机器人LoveR

描述----------Description----------

hierarchy takes a graph set (dat) and returns reciprocity or Krackhardt hierarchy scores for the graphs selected by g.
hierarchy需要图表集（dat），并返回互惠或Krackhardt的层次分数的图形选择g。


用法----------Usage----------


hierarchy(dat, g=NULL, measure=c("reciprocity", "krackhardt"))



参数----------Arguments----------

参数：dat
a stack of input graphs.
输入图堆栈。


参数：g
index values for the graphs to be utilized; by default, all graphs are selected.
可以利用的索引值的图形，默认情况下，所有的图形被选中。


参数：measure
one of "reciprocity" or "krackhardt".
一个"reciprocity"或"krackhardt"。


Details

详细信息----------Details----------

Hierarchy measures quantify the extent of asymmetry in a structure; the greater the extent of asymmetry, the more hierarchical the structure is said to be.  (This should not be confused with how centralized the structure is, i.e., the extent to which centralities of vertex positions are highly concentrated.)  hierarchy provides two measures (selected by the measure argument) as follows:
层次量化的程度，在一个结构中的不对称的措施;不对称的程度越大，更层次的结构被认为是。 （这不应该混淆与集中的结构，即中心性的顶点位置，在何种程度上是高度集中的。）hierarchy的提供了两种措施（measure参数选择）如下：

<ol> reciprocity: This setting returns one minus the dyadic reciprocity for each input graph (see grecip)
<OL> reciprocity：此设置返回一个减去二元互惠的每个输入图（见grecip）




krackhardt: This setting returns the Krackhardt hierarchy score for each input graph.  The Krackhardt hierarchy is defined as the fraction of non-null dyads in the reachability graph which are asymmetric.  Thus, when no directed paths are reciprocated (e.g., in an in/outtree), Krackhardt hierarchy is equal to 1; when all such paths are reciprocated, by contrast (e.g., in a cycle or clique), the measure falls to 0.
krackhardt，此设置返回的Krackhardt的层次得分为每个输入图。定义Krackhardt层次结构作为reachability图中的非空的二价基是不对称的馏分。因此，当没有向路径作往复运动时（例如，在在/ outtree），Krackhardt层次结构是等于1，当所有这些路径往复运动，相反（例如，在一个周期或派系），该措施下降到0。

Hierarchy 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. </ol>
层次是四项措施（connectedness，efficiency，hierarchy和lubness）所建议的Krackhardt总结分层结构。每个对应于一个四个公理，它是必要的和足够的结构中的问题是一个outtree;因此，措施将等于1，对于一个给定的曲线图，当且仅当该图形是一个outtree。团结偏离可以被解释方面的失败，以满足一个或多个的outtree的条件下，这可能是有用的信息，在其结构性能分类。 </ OL>

Note that hierarchy is inherently density-constrained: as densities climb above 0.5, the proportion of mutual dyads must (by the pigeonhole principle) increase rapidly, thereby reducing possibilities for asymmetry.  Thus, the interpretation of hierarchy scores should take density into account, particularly if density is artifactual (e.g., due to a particular dichotomization procedure).  
请注意层次结构本质上是受限的密度：密度爬在0.5以上，相互二人组合的比例（由鸽笼原理）迅速增加，从而减少可能的不对称。因此，层次分数的解释应考虑采取密度，特别是如果的密度是artifactual（例如，由于特定的二分法程序）。


值----------Value----------

A vector of hierarchy 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----------




参见----------See Also----------

connectedness, efficiency, hierarchy, lubness, grecip, mutuality, dyad.census
connectedness，efficiency，hierarchy，lubness，grecip，mutuality，dyad.census


实例----------Examples----------


#Get hierarchy scores for graphs of varying densities[层次分数不同密度图]
hierarchy(rgraph(10,5,tprob=c(0.1,0.25,0.5,0.75,0.9)),
    measure="reciprocity")
hierarchy(rgraph(10,5,tprob=c(0.1,0.25,0.5,0.75,0.9)),
    measure="krackhardt")

转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。


注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。