Newman.Condmat.95.99.net.2mode(tnet)
Newman.Condmat.95.99.net.2mode()所属R语言包：tnet
Newman's condmat 95-99 network (two-mode structure)
纽曼的condmat 95-99网络（两个模式结构）
译者：生物统计家园网 机器人LoveR
描述----------Description----------
This is the co-authorship network of scientists based on preprints posted to Condensed Matter section of arXiv E-Print Archive between 1995 and 1999. <br><br> This network can be classified as a two-mode or affiliation network since there are two types of "nodes" (authors and papers) and connections exist only between different types of nodes. An author is connected to a paper if her or his name appeared on it. <br><br> Few network measures exist for two-mode networks, and therefore, these networks are often projected onto a one-mode (only one type of nodes) network by selecting one of the types of nodes and linking two nodes if they were connected to the same node (of the other kind). <br><br> Traditionally, the ties in projected one-mode networks do not have weights. Recent empirical studies of two-mode networks has created a weighted network by defining the weights as the number of co-occurrences (e.g., the number of papers that two authors had collaborated on). <br><br> This method was refined by Newman (2001). He argued that smaller collaborations created stronger social bonds among scientists than larger ones. Therefore, he extended this procedure and proposed to define weights among the nodes use the following formula:<br> w_ij = sum_p 1/(N_p -1)<br> where w_ij is the weight between node i and node j, p is the papers that they have collaborated on, and N_p is the number of authors on a paper. This implies that if two authors only write a single paper together with no other co-authors, they get a weight of 1. However, if they have a co-author, the weight on the tie between them is 0.5. If two authors have written two papers together without any co-author, the weight of their tie would be 2. A more complicated example is the tie between two authors who have written two papers together: one without any other co-author and one with one co-author. The first paper would give their tie a weight of 1, and the second tie would add 0.5 to the weight of this tie. Therefore, the weight is 1.5.<br> Note: This method has been explained in more detail in the following post: <br> http://toreopsahl.com/2009/05/01/projecting-two-mode-networks-onto-weighted-one-mode-networks/ <br><br> This is the two-mode network.
这是科学家们基于网络的预印本发布到凝聚态部分arXiv E-打印存档在1995年和1999年之间的共同作者。参考参考该网络可以划分为两个模式或从属关系网络，因为有两种类型的“节点”（作者和论文）和连接之间只存在于不同类型的节点。作者是连接，如果他或她的名字出现在一份文件。参考参考少数网络措施存在的双模式网络，因此，这些网络通常被投射到一个模式（只有一种类型的节点）的网络中选择一个的类型的节点，并连接两个节点，如果它们连接到同一个节点（其他类型）。参考<BR>传统的关系，预测模式网络不具有的权重。最近的实证研究两个模式网络创造了一个加权网络的共同出现的数量（例如，两位作者合作的论文数量）定义的权重。 “参考参考此方法精制而成的纽曼（2001）。他认为，科学家之间的比大的更小的合作创造了更强有力的社会纽带。因此，他扩展了这一过程，并提出定义节点间的权重，使用下面的公式：参考w_ij = 1 sum_p /（-1 N_p）<BR>，在那里w_ij是节点i和节点j之间的权重，p是论文，他们已经合作，N_p是作者在一张纸上。这意味着，如果两位作者一起写一张纸上，没有其他的合著者，他们得到一个权重为1。但是，如果他们有一个共同作者，他们之间的联系的重量为0.5。如果两位作者一起写了两篇论文没有任何合著者，他们的领带的重量为2。一个更复杂的例子是谁写两篇论文的两位作者没有任何其他的合著者之一，与合著者之一之间的联系。第一篇论文会给他们的领带权重为1，第二领带将增加0.5这条领带的重量。因此，权重是1.5。<br>注意：该方法已被更详细地解释，在以下的职位如下：<br> http://toreopsahl.com/2009/05/01/projecting-two-mode-networks-到加权模式网络/ <BR> <BR>的，这是两个模式的网络。
用法----------Usage----------
Newman.Condmat.95.99.net.2mode
Newman.Condmat.95.99.net.1mode.wNewman
格式----------Format----------
The two-mode network is a data frame with two columns. The first column is the id of authors and the second column is the id of papers. The one-mode network is a data frame with three columns. The first two columns are ids of the authors, and the third column is the weight of the tie. This is calculated based on Newman's (2001) method for defining tie weights. See the projecting_tm-function.
具有两列的两个模式的网络是一个数据框。第一列是作者的ID，第二列的id文件。一个模式的网络是一个三列的数据框。的前两列是id的作者，和第三列的领带的重量。这是纽曼（2001）为定义的领带权重的方法计算。功能请参阅projecting_tm。
参考文献----------References----------
转载请注明:出自 生物统计家园网(http://www.biostatistic.net)。
注：
注1：为了方便大家学习，本文档为生物统计家园网机器人LoveR翻译而成，仅供个人R语言学习参考使用，生物统计家园保留版权。
注2：由于是机器人自动翻译，难免有不准确之处，使用时仔细对照中、英文内容进行反复理解，可以帮助R语言的学习。
注3：如遇到不准确之处，请在本贴的后面进行回帖，我们会逐渐进行修订。
|
发表于 2012-10-1 10:59:50
