274
个编辑
更改
跳到导航
跳到搜索
第269行：
第269行： + 第274行：
第275行： − 最早使用随机图模型的是海伦 · 霍尔 · 詹宁斯和雅各布 · 莫雷诺，他们在1938年提出了一个“偶然社会记录模型”(一个有向的 erd s-rényi 模型) ，用来比较他们的网络数据中的回传链接的比例和随机模型。另一个被称为“随机网络”的应用是1951年 Solomonoff 和 Rapoport 使用的有向图模型，这些有向图具有固定的出度，并且随机选择附加到其他顶点。+ 第282行：
第283行： − 随机图的 erd-Rényi 模型是由 Paul erd 和 Alfréd Rényi 于1959年发表的论文《随机图论》中首次提出的，Gilbert 在他的论文《随机图论》中独立定义了这一模型。+ − −
→History
==History==
==History==
历史<br>
The earliest use of a random graph model was by [[Helen Hall Jennings]] and [[Jacob Moreno]] in 1938 where a "chance sociogram" (a directed Erdős-Rényi model) was considered in studying comparing the fraction of reciprocated links in their network data with the random model.<ref>{{cite journal |last1=Moreno |first1=Jacob L |last2=Jennings |first2=Helen Hall |title=Statistics of Social Configurations |journal=Sociometry |date=Jan 1938 |volume=1 |issue=3/4 |pages=342–374 |doi=10.2307/2785588|jstor=2785588 }}</ref> Another use, under the name "random net", was by Solomonoff and Rapoport in 1951, using a model of directed graphs with fixed out-degree and randomly chosen attachments to other vertices.<ref>{{cite journal |last1=Solomonoff |first1=Ray |last2=Rapopst |first2=Anatol |title=Connectivity of random nets |journal=Bulletin of Mathematical Biophysics |date=June 1951 |volume=13 |issue=2 |pages=107–117 |doi=10.1007/BF02478357}}</ref>
The earliest use of a random graph model was by [[Helen Hall Jennings]] and [[Jacob Moreno]] in 1938 where a "chance sociogram" (a directed Erdős-Rényi model) was considered in studying comparing the fraction of reciprocated links in their network data with the random model.<ref>{{cite journal |last1=Moreno |first1=Jacob L |last2=Jennings |first2=Helen Hall |title=Statistics of Social Configurations |journal=Sociometry |date=Jan 1938 |volume=1 |issue=3/4 |pages=342–374 |doi=10.2307/2785588|jstor=2785588 }}</ref> Another use, under the name "random net", was by Solomonoff and Rapoport in 1951, using a model of directed graphs with fixed out-degree and randomly chosen attachments to other vertices.<ref>{{cite journal |last1=Solomonoff |first1=Ray |last2=Rapopst |first2=Anatol |title=Connectivity of random nets |journal=Bulletin of Mathematical Biophysics |date=June 1951 |volume=13 |issue=2 |pages=107–117 |doi=10.1007/BF02478357}}</ref>
The earliest use of a random graph model was by Helen Hall Jennings and Jacob Moreno in 1938 where a "chance sociogram" (a directed Erdős-Rényi model) was considered in studying comparing the fraction of reciprocated links in their network data with the random model. Another use, under the name "random net", was by Solomonoff and Rapoport in 1951, using a model of directed graphs with fixed out-degree and randomly chosen attachments to other vertices.
The earliest use of a random graph model was by Helen Hall Jennings and Jacob Moreno in 1938 where a "chance sociogram" (a directed Erdős-Rényi model) was considered in studying comparing the fraction of reciprocated links in their network data with the random model. Another use, under the name "random net", was by Solomonoff and Rapoport in 1951, using a model of directed graphs with fixed out-degree and randomly chosen attachments to other vertices.
最早使用随机图模型的是海伦·霍尔·詹宁斯和雅各布·莫雷诺，他们在1938年提出了一个“偶然社会记录模型”(一个有向的 Erdős-Rényi 模型) ，用来比较他们的网络数据中的回传链接的比例和随机模型。另一个被称为“'''<font color="#FF8000">随机网络 Random Net </font>'''”的应用是1951年 Solomonoff 和 Rapoport 使用的有向图模型，这些有向图具有固定的出度，并且随机选择附加到其他顶点。
The Erdős–Rényi model of random graphs was first defined by Paul Erdős and Alfréd Rényi in their 1959 paper "On Random Graphs" and independently by Gilbert in his paper "Random graphs".
The Erdős–Rényi model of random graphs was first defined by Paul Erdős and Alfréd Rényi in their 1959 paper "On Random Graphs" and independently by Gilbert in his paper "Random graphs".
随机图的Erdős–Rényi 模型是由Paul Erdős和Alfréd Rényi于1959年发表的论文《随机图论》中首次提出的，Gilbert 在他的论文《随机图论》中独立定义了这一模型。
==See also==
==See also==