degree(sna)
degree()所属R语言包：sna
Compute the Degree Centrality Scores of Network Positions
计算得分的网络位置度中心
译者：生物统计家园网 机器人LoveR
描述----------Description----------
Degree takes one or more graphs (dat) and returns the degree centralities of positions (selected by nodes) within the graphs indicated by g. Depending on the specified mode, indegree, outdegree, or total (Freeman) degree will be returned; this function is compatible with centralization, and will return the theoretical maximum absolute deviation (from maximum) conditional on size (which is used by centralization to normalize the observed centralization score).
Degree需要一个或多个图形（dat）和返回的程度中心性的位置（选择nodes）内的图形表示g。将返回根据指定的模式，入度，出度，或总（弗里曼饰）学位，这个功能是兼容centralization，将返回理论上的最大绝对偏差（最大）有条件的大小（这是用来centralization标准化集中观察到的得分）。
用法----------Usage----------
degree(dat, g=1, nodes=NULL, gmode="digraph", diag=FALSE,
tmaxdev=FALSE, cmode="freeman", rescale=FALSE, ignore.eval=FALSE)
参数----------Arguments----------
参数：dat
one or more input graphs.
一个或多个输入图表。
参数：g
integer indicating the index of the graph for which centralities are to be calculated (or a vector thereof). By default, g=1.
整数，指示其中中心性计为（或它们的向量）的曲线图的索引。默认情况下，g= 1。
参数：nodes
vector indicating which nodes are to be included in the calculation. By default, all nodes are included.
矢量的指示哪些节点要被包括在计算中。默认情况下，所有的节点都包括在内。
参数：gmode
string indicating the type of graph being evaluated. "digraph" indicates that edges should be interpreted as directed; "graph" indicates that edges are undirected. gmode is set to "digraph" by default.
的图表类型的字符串，表示正在评估中。 "digraph"表示的边缘应被解释为指示;"graph"表明边缘是无向的。 gmode默认情况下被设置成"digraph"。
参数：diag
boolean indicating whether or not the diagonal should be treated as valid data. Set this true if and only if the data can contain loops. diag is FALSE by default.
布尔值，表示是否对角线应被视为有效的数据。设置这是真的，当且仅当数据可以包含循环。 diag是FALSE默认情况下。
参数：tmaxdev
boolean indicating whether or not the theoretical maximum absolute deviation from the maximum nodal centrality should be returned. By default, tmaxdev==FALSE.
布尔值，表示是否从最大的节点的中心性的理论最大绝对偏差应返回。默认情况下，tmaxdev==FALSE。
参数：cmode
string indicating the type of degree centrality being computed. "indegree", "outdegree", and "freeman" refer to the indegree, outdegree, and total (Freeman) degree measures, respectively. The default for cmode is "freeman".
字符串，表示计算度中心的类型。 "indegree"，"outdegree"和"freeman"入度，出度，和总（弗里曼饰）学位措施的，分别。 cmode的默认"freeman"。
参数：rescale
if true, centrality scores are rescaled such that they sum to 1.
如果为true，中心的分数重新调整，他们总结到1。
参数：ignore.eval
logical; should edge values be ignored when computing degree scores?
逻辑，边缘值计算时被忽略度分数吗？
Details
详细信息----------Details----------
Degree centrality is the social networker's term for various permutations of the graph theoretic notion of vertex degree: for unvalued graphs, indegree of a vertex, v, corresponds to the cardinality of the vertex set N^+(v) = {i in V(G) : (i,v) in E(G)}; outdegree corresponds to the cardinality of the vertex set N^-(v) = {i in V(G) : (v,i) in E(G)}; and total (or “Freeman”) degree corresponds to |N^+(v)|+|N^-(v)|. (Note that, for simple graphs, indegree=outdegree=total degree/2.) Obviously, degree centrality can be interpreted in terms of the sizes of actors' neighborhoods within the larger structure. See the references below for more details.
度的核心是社会NetWorker的任期各种排列的顶焦度的图论概念：为不受重视的图形，一个顶点入度，v，对应的顶点集合的基数N^+(v) = {i in V(G) : (i,v) in E(G)};出度对应的顶点集的基数N^-(v) = {i in V(G) : (v,i) in E(G)};总（或“民丰”）的程度对应到|N^+(v)|+|N^-(v)|。 （请注意，对于简单图形，入度=出度=总额度/ 2）。显然，度中心可以理解演员的街区的更大范围内的结构的大小。有关详细信息，请参阅下面的参考资料。
When ignore.eval==FALSE, degree weights edges by their values where supplied. ignore.eval==TRUE ensures an unweighted degree score (independent of input). Setting gmode=="graph" forces behavior equivalent to cmode=="indegree" (i.e., each edge is counted only once); to obtain a total degree score for an undirected graph in which both in- and out-neighborhoods are counted separately, simply use gmode=="digraph".
当ignore.eval==FALSE，degree的权重他们的价值观边缘的地方提供。 ignore.eval==TRUE确保一个未加权的程度得分（独立的输入）。设置gmode=="graph"生产力的行为相当于cmode=="indegree"（即每条边只计算一次）;一个无向图中，在和社区单独计算，只需获得一个总额度得分使用gmode=="digraph"。
值----------Value----------
A vector, matrix, or list containing the degree scores (depending on the number and size of the input graphs).
包含度分数（取决于上的输入图形的数量和大小）的向量，矩阵，或列表。
（作者）----------Author(s)----------
Carter T. Butts <a href="mailto:buttsc@uci.edu">buttsc@uci.edu</a>
参考文献----------References----------
<h3>See Also</h3>
实例----------Examples----------
#Create a random directed graph[创建一个随机有向图]
dat<-rgraph(10)
#Find the indegrees, outdegrees, and total degrees[查找的的indegrees，outdegrees，总度]
degree(dat,cmode="indegree")
degree(dat,cmode="outdegree")
degree(dat)
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-9-30 10:50:10
