第1行: |
第1行: |
− | 此词条暂由彩云小译翻译,未经人工整理和审校,带来阅读不便,请见谅。
| + | 此词条暂由彩云小译翻译,翻译字数共2620,未经人工整理和审校,带来阅读不便,请见谅。 |
| + | |
| + | {{For|the 2012 song by [[The Script]]|Six Degrees of Separation (song)}} |
| | | |
| {{short description|Concept of social inter-connectedness of all people}} | | {{short description|Concept of social inter-connectedness of all people}} |
第11行: |
第13行: |
| 北极[显示动物与植物浮游生物分离程度的食物网——例如,毛鳞鱼与植物浮游生物有4个联系] | | 北极[显示动物与植物浮游生物分离程度的食物网——例如,毛鳞鱼与植物浮游生物有4个联系] |
| | | |
− | '''Six degrees of separation''' is the idea that all people are six, or fewer, social connections away from each other. Also known as the 6 Handshakes rule. As a result, a chain of "[[friend of a friend|a friend of a friend]]" statements can be made to connect any two people in a maximum of six steps. It was originally set out by [[Frigyes Karinthy]] in 1929 and popularized in an eponymous [[Six Degrees of Separation (play)|1990 play]] written by [[John Guare]]. It is sometimes generalized to the average [[Path length|social distance]] being [[logarithm]]ic in the size of the population. | + | '''Six degrees of separation''' is the idea that all people on average are six, or fewer, social connections away from each other. Also known as the 6 Handshakes rule. As a result, a chain of "[[friend of a friend|a friend of a friend]]" statements can be made to connect any two people in a maximum of six steps. It was originally set out by [[Frigyes Karinthy]] in 1929 and popularized in an eponymous [[Six Degrees of Separation (play)|1990 play]] written by [[John Guare]]. It is sometimes generalized to the average [[Path length|social distance]] being [[logarithm]]ic in the size of the population. |
| | | |
− | Six degrees of separation is the idea that all people are six, or fewer, social connections away from each other. Also known as the 6 Handshakes rule. As a result, a chain of "a friend of a friend" statements can be made to connect any two people in a maximum of six steps. It was originally set out by Frigyes Karinthy in 1929 and popularized in an eponymous 1990 play written by John Guare. It is sometimes generalized to the average social distance being logarithmic in the size of the population. | + | Six degrees of separation is the idea that all people on average are six, or fewer, social connections away from each other. Also known as the 6 Handshakes rule. As a result, a chain of "a friend of a friend" statements can be made to connect any two people in a maximum of six steps. It was originally set out by Frigyes Karinthy in 1929 and popularized in an eponymous 1990 play written by John Guare. It is sometimes generalized to the average social distance being logarithmic in the size of the population. |
| | | |
− | 六度分隔理论是这样一种观点,即所有人之间的社会联系都是6个或者更少。也被称为6握手规则。因此,一连串的“朋友的朋友”陈述可以连接任何两个人在最多六个步骤。它最初由 Frigyes Karinthy 于1929年创作,并在 John Guare 于1990年创作的同名戏剧中流行开来。它有时被推广到平均社会距离是对数的人口大小。
| + | 六度分隔理论是这样一个观点,即所有的人平均只有6个或更少的社会关系。也被称为6握手规则。因此,一连串的“朋友的朋友”陈述可以连接任何两个人在最多六个步骤。它最初由 Frigyes Karinthy 于1929年创作,并在 John Guare 于1990年写的同名戏剧中流行开来。它有时被推广到平均社会距离是对数的人口大小。 |
| | | |
| | | |
第29行: |
第31行: |
| Theories on optimal design of cities, city traffic flows, neighborhoods, and demographics were in vogue after World War I. These<!--What does statism have to do with this? Has some paranoic Libertarian been at work even here? ... Formally, I'm requesting a citation for the claim that the Karinthy story is connected to "statism" in city design.--> conjectures were expanded in 1929 by Hungarian author Frigyes Karinthy, who published a volume of short stories titled Everything is Different. One of these pieces was titled "Chains," or "Chain-Links." The story investigated in abstract, conceptual, and fictional terms many of the problems that would captivate future generations of mathematicians, sociologists, and physicists within the field of network theory. | | Theories on optimal design of cities, city traffic flows, neighborhoods, and demographics were in vogue after World War I. These<!--What does statism have to do with this? Has some paranoic Libertarian been at work even here? ... Formally, I'm requesting a citation for the claim that the Karinthy story is connected to "statism" in city design.--> conjectures were expanded in 1929 by Hungarian author Frigyes Karinthy, who published a volume of short stories titled Everything is Different. One of these pieces was titled "Chains," or "Chain-Links." The story investigated in abstract, conceptual, and fictional terms many of the problems that would captivate future generations of mathematicians, sociologists, and physicists within the field of network theory. |
| | | |
− | 第一次世界大战后,关于城市、城市交通流、社区和人口统计学的最优化设计理论非常流行。这些! ——国家主义与此有什么关系?是不是有一些偏执的自由主义者在起作用?...正式地说,我要求引证卡琳蒂的故事与城市设计中的“国家主义”有关。 ——1929年匈牙利作家弗里吉斯 · 卡林西(Frigyes Karinthy)扩展了这些猜想,他出版了一本名为《一切都不同》(Everything is Different)的短篇小说集。其中一件作品的标题是“链条”或“链环”这个故事以抽象、概念和虚构的方式调查了许多问题,这些问题将在网络理论领域吸引下一代的数学家、社会学家和物理学家。
| + | 在第一次世界大战之后,关于城市、交通流量、社区和人口统计学的最优化设计理论非常流行。这些与国家主义有什么关系?是不是有一些偏执的自由主义者在起作用?...正式地说,我要求引证卡琳蒂的故事与城市设计中的“国家主义”有关。1929年,匈牙利作家弗里吉斯 · 卡林西(Frigyes Karinthy)扩展了这些猜想,出版了一本名为《一切都不同》(Everything is Different)的短篇小说集。其中一件作品的标题是“链条”或“链环”这个故事以抽象、概念和虚构的方式调查了许多问题,这些问题将在网络理论领域吸引未来几代数学家、社会学家和物理学家。 |
| | | |
| | | |
第45行: |
第47行: |
| <blockquote>A fascinating game grew out of this discussion. One of us suggested performing the following experiment to prove that the population of the Earth is closer together now than they have ever been before. We should select any person from the 1.5 billion inhabitants of the Earth – anyone, anywhere at all. He bet us that, using no more than five individuals, one of whom is a personal acquaintance, he could contact the selected individual using nothing except the network of personal acquaintances.</blockquote> | | <blockquote>A fascinating game grew out of this discussion. One of us suggested performing the following experiment to prove that the population of the Earth is closer together now than they have ever been before. We should select any person from the 1.5 billion inhabitants of the Earth – anyone, anywhere at all. He bet us that, using no more than five individuals, one of whom is a personal acquaintance, he could contact the selected individual using nothing except the network of personal acquaintances.</blockquote> |
| | | |
− | 一个引人入胜的游戏诞生于这场讨论。我们中的一个人建议进行下面的实验,以证明现在地球上的人口比以往任何时候都更加紧密。我们应该从地球上的15亿居民中选择任何人——任何人,任何地方。他跟我们打赌,使用不超过五个人,其中一个是他的熟人,他可以通过除了个人熟人网络之外的任何方式与被选中的个人联系。 / blockquote
| + | 这场讨论产生了一个有趣的游戏。我们中的一个人建议进行下面的实验,以证明现在地球上的人口比以往任何时候都更加紧密。我们应该从地球上的15亿居民中选择任何人——任何人,任何地方。他跟我们打赌,只要使用不超过五个人,其中一个是他的熟人,他就可以通过除了个人熟人网络之外的任何方式与被选中的人联系。</blockquote > |
| | | |
| | | |
第71行: |
第73行: |
| Michael Gurevich conducted seminal work in his empirical study of the structure of social networks in his 1961 Massachusetts Institute of Technology PhD dissertation under Ithiel de Sola Pool. Mathematician Manfred Kochen, an Austrian who had been involved in urban design, extrapolated these empirical results in a mathematical manuscript, Contacts and Influences, concluding that in a U.S.-sized population without social structure, "it is practically certain that any two individuals can contact one another by means of at most two intermediaries. In a [socially] structured population it is less likely but still seems probable. And perhaps for the whole world's population, probably only one more bridging individual should be needed." They subsequently constructed Monte Carlo simulations based on Gurevich's data, which recognized that both weak and strong acquaintance links are needed to model social structure. The simulations, carried out on the relatively limited computers of 1973, were nonetheless able to predict that a more realistic three degrees of separation existed across the U.S. population, foreshadowing the findings of American psychologist Stanley Milgram. | | Michael Gurevich conducted seminal work in his empirical study of the structure of social networks in his 1961 Massachusetts Institute of Technology PhD dissertation under Ithiel de Sola Pool. Mathematician Manfred Kochen, an Austrian who had been involved in urban design, extrapolated these empirical results in a mathematical manuscript, Contacts and Influences, concluding that in a U.S.-sized population without social structure, "it is practically certain that any two individuals can contact one another by means of at most two intermediaries. In a [socially] structured population it is less likely but still seems probable. And perhaps for the whole world's population, probably only one more bridging individual should be needed." They subsequently constructed Monte Carlo simulations based on Gurevich's data, which recognized that both weak and strong acquaintance links are needed to model social structure. The simulations, carried out on the relatively limited computers of 1973, were nonetheless able to predict that a more realistic three degrees of separation existed across the U.S. population, foreshadowing the findings of American psychologist Stanley Milgram. |
| | | |
− | 1961年,迈克尔 · 古列维奇在麻省理工学院的 istiel de Sola Pool 博士论文中对社交网络的结构进行了实证研究。从事城市设计的奥地利数学家曼弗雷德 · 科陈(Manfred Kochen)将这些实证结果以数学手稿《联系与影响》(Contacts and influence)的形式推断出,在一个没有社会结构的美国大规模人口中,“几乎可以肯定,任何两个人至多可以通过两个中间人进行联系。在一个(社会)结构化的人群中,这种情况不太可能发生,但似乎仍然是可能的。或许对于全世界的人口而言,也许只需要再增加一个连接个体。”他们随后基于 Gurevich 的数据构建了蒙特卡罗模拟,该模拟认识到为社会结构建模既需要弱的熟人联系,也需要强的熟人联系。1973年在相对有限的计算机上进行的模拟,尽管如此,仍然能够预测整个美国人口中存在更为现实的三度分离,这预示着美国心理学家斯坦利 · 米尔格拉姆的发现。 | + | 1961年,迈克尔 · 古列维奇在麻省理工学院的 istiel de Sola Pool 博士论文中对社交网络的结构进行了实证研究。数学家 Manfred Kochen 是一位奥地利人,曾经参与城市设计,他将这些经验性的结果以数学手稿《联系与影响》的形式推断出,在一个没有社会结构的美国大规模人口中,“实际上可以肯定的是,任何两个个体至多可以通过两个中间人进行联系。在一个(社会)结构化的人群中,这种情况不太可能发生,但似乎仍然是可能的。或许对于全世界的人口而言,也许只需要再增加一个连接个体。”他们随后基于 Gurevich 的数据构建了蒙特卡罗模拟,该模拟认识到为社会结构建模既需要弱的熟人联系,也需要强的熟人联系。1973年在相对有限的计算机上进行的模拟,尽管如此,仍然能够预测在美国人口中存在更为现实的三度分离,这预示着美国心理学家斯坦利 · 米尔格拉姆的发现。 |
| | | |
| | | |
第95行: |
第97行: |
| In 2003, [[Columbia University]] conducted an analogous experiment on social connectedness amongst Internet email users. Their effort was named the Columbia Small World Project, and included 24,163 e-mail chains, aimed at 18 targets from 13 countries.<ref name="dodds">Dodds, Muhamad, Watts (2003)."Small World Project," Science Magazine. pp.827-829, 8 August 2003 https://www.sciencemag.org/content/301/5634/827</ref> Almost 100,000 people registered, but only 384 (0.4%) reached the final target. Amongst the successful chains, while shorter lengths were more common some reached their target after only 7, 8, 9 or 10 steps. Dodds et al. noted that participants (all of whom volunteers) were strongly biased towards existing models of Internet users{{#tag:ref|"More than half of all participants resided in North America and were middle class, professional, college educated, and Christian, reflecting commonly held notions of the Internet-using population"<ref name="dodds"/>|group=Note}} and that connectedness based on professional ties was much stronger than those within families or friendships. The authors cite "lack of interest" as the predominating factor in the high attrition rate,{{#tag:ref|"suggesting lack of interest ... was the main reason" for the "extremely low completion rate"<ref name="dodds"/>|group=Note}} a finding consistent with earlier studies.<ref name="kleinfeld"/> | | In 2003, [[Columbia University]] conducted an analogous experiment on social connectedness amongst Internet email users. Their effort was named the Columbia Small World Project, and included 24,163 e-mail chains, aimed at 18 targets from 13 countries.<ref name="dodds">Dodds, Muhamad, Watts (2003)."Small World Project," Science Magazine. pp.827-829, 8 August 2003 https://www.sciencemag.org/content/301/5634/827</ref> Almost 100,000 people registered, but only 384 (0.4%) reached the final target. Amongst the successful chains, while shorter lengths were more common some reached their target after only 7, 8, 9 or 10 steps. Dodds et al. noted that participants (all of whom volunteers) were strongly biased towards existing models of Internet users{{#tag:ref|"More than half of all participants resided in North America and were middle class, professional, college educated, and Christian, reflecting commonly held notions of the Internet-using population"<ref name="dodds"/>|group=Note}} and that connectedness based on professional ties was much stronger than those within families or friendships. The authors cite "lack of interest" as the predominating factor in the high attrition rate,{{#tag:ref|"suggesting lack of interest ... was the main reason" for the "extremely low completion rate"<ref name="dodds"/>|group=Note}} a finding consistent with earlier studies.<ref name="kleinfeld"/> |
| | | |
− | In 2003, Columbia University conducted an analogous experiment on social connectedness amongst Internet email users. Their effort was named the Columbia Small World Project, and included 24,163 e-mail chains, aimed at 18 targets from 13 countries. Almost 100,000 people registered, but only 384 (0.4%) reached the final target. Amongst the successful chains, while shorter lengths were more common some reached their target after only 7, 8, 9 or 10 steps. Dodds et al. noted that participants (all of whom volunteers) were strongly biased towards existing models of Internet users and that connectedness based on professional ties was much stronger than those within families or friendships. The authors cite "lack of interest" as the predominating factor in the high attrition rate, a finding consistent with earlier studies. | + | In 2003, Columbia University conducted an analogous experiment on social connectedness amongst Internet email users. Their effort was named the Columbia Small World Project, and included 24,163 e-mail chains, aimed at 18 targets from 13 countries. Almost 100,000 people registered, but only 384 (0.4%) reached the final target. Amongst the successful chains, while shorter lengths were more common some reached their target after only 7, 8, 9 or 10 steps. Dodds et al. noted that participants (all of whom volunteers) were strongly biased towards existing models of Internet users{{#tag:ref|"More than half of all participants resided in North America and were middle class, professional, college educated, and Christian, reflecting commonly held notions of the Internet-using population" |
| | | |
− | 2003年,哥伦比亚大学在互联网电子邮件用户之间进行了一个类似的社会联系实验。他们的努力被命名为“哥伦比亚小世界项目”(Columbia Small World Project) ,其中包括24,163个电子邮件链,目标是来自13个国家的18个目标。近10万人注册,但只有384人(0.4%)达到了最终目标。在成功的连锁店中,较短的长度更常见,有些只经过7、8、9或10步就达到了目标。等人。他指出,参与者(全部是志愿者)对现有的互联网用户模式有强烈的偏见,基于职业联系的联系比家庭或友谊的联系强得多。作者认为“缺乏兴趣”是高自然减员率的主要因素,这一发现与早期的研究结果一致。 | + | 2003年,哥伦比亚大学在互联网电子邮件用户之间进行了一个类似的社会联系实验。他们的努力被命名为“哥伦比亚小世界项目”(Columbia Small World Project) ,其中包括24,163个电子邮件链,目标是来自13个国家的18个目标。近10万人注册,但只有384人(0.4%)达到了最终目标。在成功的连锁店中,较短的长度更常见,有些只经过7、8、9或10步就达到了目标。等人。“超过一半的参与者居住在北美,属于中产阶级、专业人士、受过大学教育的人和基督徒,这反映了人们对使用互联网人群的普遍看法。” |
| | | |
| | | |
| | | |
| == Research == | | == Research == |
− |
| |
− | Several studies, such as [[Small world experiment|Milgram's small world experiment]], have been conducted to measure this connectedness empirically. The phrase "six degrees of separation" is often used as a synonym for the idea of the "small world" phenomenon.<ref name=AFC-NA-21>[[Steven Strogatz]], [[Duncan J. Watts]] and [[Albert-László Barabási]] {{cite web |first = |last = |title = explaining synchronicity, network theory, adaption of complex systems, Six Degrees, Small world phenomenon in the BBC Documentary |work = BBC |url=http://topdocumentaryfilms.com/six-degrees-of-separation/|page = |accessdate=11 June 2012}} "Unfolding the science behind the idea of six degrees of separation"</ref>
| |
− |
| |
− | Several studies, such as Milgram's small world experiment, have been conducted to measure this connectedness empirically. The phrase "six degrees of separation" is often used as a synonym for the idea of the "small world" phenomenon.
| |
− |
| |
− | 一些研究,如米尔格拉姆的小世界实验,已经进行了测量这种关联性的经验。“六度分隔理论”这个词经常被用作“小世界”现象的同义词。
| |
− |
| |
− |
| |
− |
| |
− | However, detractors argue that Milgram's experiment did not demonstrate such a link,<ref>[http://news.bbc.co.uk/1/hi/programmes/more_or_less/5176698.stm BBC News: More Or Less: Connecting With People In Six Steps] 13 July 2006, "Judith Kleinfeld ... told us, that 95% of the letters sent out had failed to reach the target."</ref> and the "six degrees" claim has been decried as an "academic [[urban myth]]".<ref name="kleinfeld">{{cite web|url=http://www.stat.cmu.edu/~fienberg/Stat36-835/Kleinfeld_SWP.pdf|title=The Small World Problem|publisher=[[Society (journal)|Society (Springer)]], Social Science and Public Policy|author=[[Judith Kleinfeld|Judith S. Kleinfeld]], [[University of Alaska Fairbanks]]|date=January–February 2002}}</ref><ref name="pt2002">{{cite magazine|url=http://www.psychologytoday.com/articles/200203/six-degrees-urban-myth|magazine=Psychology Today|date=March 1, 2002|title=Six Degrees: Urban Myth? Replicating the small world of Stanley Milgram. Can you reach anyone through a chain of six people.}}</ref> Also, the existence of isolated groups of humans, for example the [[Korubo people|Korubo]] and other native Brazilian populations,<ref>[http://www.survivalinternational.org/tribes/uncontacted-brazil The Uncontacted Indians of Brazil] Survivalinternational</ref> would tend to invalidate the strictest interpretation of the hypothesis.
| |
| | | |
| However, detractors argue that Milgram's experiment did not demonstrate such a link, and the "six degrees" claim has been decried as an "academic urban myth". Also, the existence of isolated groups of humans, for example the Korubo and other native Brazilian populations, would tend to invalidate the strictest interpretation of the hypothesis. | | However, detractors argue that Milgram's experiment did not demonstrate such a link, and the "six degrees" claim has been decried as an "academic urban myth". Also, the existence of isolated groups of humans, for example the Korubo and other native Brazilian populations, would tend to invalidate the strictest interpretation of the hypothesis. |
第117行: |
第109行: |
| 然而,批评者认为,米尔格拉姆的实验并没有证明这种联系,“六度”的说法被斥为“学术上的都市神话”。此外,孤立的人类群体的存在,例如科鲁博人和其他巴西本地人,将倾向于使对假说的最严格的解释失效。 | | 然而,批评者认为,米尔格拉姆的实验并没有证明这种联系,“六度”的说法被斥为“学术上的都市神话”。此外,孤立的人类群体的存在,例如科鲁博人和其他巴西本地人,将倾向于使对假说的最严格的解释失效。 |
| | | |
| + | Several studies, such as [[Small world experiment|Milgram's small world experiment]], have been conducted to measure this connectedness empirically. The phrase "six degrees of separation" is often used as a synonym for the idea of the "small world" phenomenon.<ref name=AFC-NA-21>[[Steven Strogatz]], [[Duncan J. Watts]] and [[Albert-László Barabási]] {{cite web |first = |last = |title = explaining synchronicity, network theory, adaption of complex systems, Six Degrees, Small world phenomenon in the BBC Documentary |work = BBC |url=http://topdocumentaryfilms.com/six-degrees-of-separation/|page = |accessdate=11 June 2012}} "Unfolding the science behind the idea of six degrees of separation"</ref> |
| | | |
| | | |
− | ===Computer networks===
| |
| | | |
− | In 2001, [[Duncan Watts]], a professor at [[Columbia University]], attempted to recreate Milgram's experiment on the Internet, using an e-mail message as the "package" that needed to be delivered, with 48,000 senders and 19 targets (in 157 countries). Watts found that the average (though not maximum) number of intermediaries was around six.<ref>{{cite journal |author=Duncan J Watts, Steven H Strogatz |year=1998 |title=Collective dynamics of 'small-world' networks |journal=Nature |pages=440–442 |doi=10.1038/30918 |pmid=9623998 |volume=393 |issue=6684|bibcode=1998Natur.393..440W }}</ref>
| + | However, detractors argue that Milgram's experiment did not demonstrate such a link,<ref>[http://news.bbc.co.uk/1/hi/programmes/more_or_less/5176698.stm BBC News: More Or Less: Connecting With People In Six Steps] 13 July 2006, "Judith Kleinfeld ... told us, that 95% of the letters sent out had failed to reach the target."</ref> and the "six degrees" claim has been decried as an "academic [[urban myth]]".<ref name="kleinfeld">{{cite web|url=http://www.stat.cmu.edu/~fienberg/Stat36-835/Kleinfeld_SWP.pdf|title=The Small World Problem|publisher=[[Society (journal)|Society (Springer)]], Social Science and Public Policy|author=[[Judith Kleinfeld|Judith S. Kleinfeld]], [[University of Alaska Fairbanks]]|date=January–February 2002}}</ref><ref name="pt2002">{{cite magazine|url=http://www.psychologytoday.com/articles/200203/six-degrees-urban-myth|magazine=Psychology Today|date=March 1, 2002|title=Six Degrees: Urban Myth? Replicating the small world of Stanley Milgram. Can you reach anyone through a chain of six people.}}</ref> Also, the existence of isolated groups of humans, for example the [[Korubo people|Korubo]] and other native Brazilian populations,<ref>[http://www.survivalinternational.org/tribes/uncontacted-brazil The Uncontacted Indians of Brazil] Survivalinternational</ref> would tend to invalidate the strictest interpretation of the hypothesis. |
| | | |
| In 2001, Duncan Watts, a professor at Columbia University, attempted to recreate Milgram's experiment on the Internet, using an e-mail message as the "package" that needed to be delivered, with 48,000 senders and 19 targets (in 157 countries). Watts found that the average (though not maximum) number of intermediaries was around six. | | In 2001, Duncan Watts, a professor at Columbia University, attempted to recreate Milgram's experiment on the Internet, using an e-mail message as the "package" that needed to be delivered, with 48,000 senders and 19 targets (in 157 countries). Watts found that the average (though not maximum) number of intermediaries was around six. |
第127行: |
第119行: |
| 2001年,哥伦比亚大学(Columbia University)教授邓肯•沃茨(Duncan Watts)试图在互联网上重现米尔格拉姆的实验,他使用一封电子邮件作为需要投递的“包裹” ,共有4.8万个发件人和19个目标(分布在157个国家)。Watts 发现,中间商的平均数量(虽然不是最大数量)约为6个。 | | 2001年,哥伦比亚大学(Columbia University)教授邓肯•沃茨(Duncan Watts)试图在互联网上重现米尔格拉姆的实验,他使用一封电子邮件作为需要投递的“包裹” ,共有4.8万个发件人和19个目标(分布在157个国家)。Watts 发现,中间商的平均数量(虽然不是最大数量)约为6个。 |
| | | |
− | A 2007 study by [[Jure Leskovec]] and [[Eric Horvitz]] examined a data set of instant messages composed of 30 billion conversations among 240 million people. They found the average path length among Microsoft Messenger users to be 6.<ref>{{cite journal| arxiv=0803.0939| title=Planetary-Scale Views on an Instant-Messaging Network| author=Jure Leskovec and Eric Horvitz|date=June 2007| bibcode=2008arXiv0803.0939L}}</ref>
| + | |
| | | |
| A 2007 study by Jure Leskovec and Eric Horvitz examined a data set of instant messages composed of 30 billion conversations among 240 million people. They found the average path length among Microsoft Messenger users to be 6. | | A 2007 study by Jure Leskovec and Eric Horvitz examined a data set of instant messages composed of 30 billion conversations among 240 million people. They found the average path length among Microsoft Messenger users to be 6. |
第133行: |
第125行: |
| 2007年,Jure Leskovec 和 Eric Horvitz 进行了一项研究,调查了2.4亿人的300亿次对话,组成了一个即时消息数据集。他们发现微软信使用户的平均路径长度为6。 | | 2007年,Jure Leskovec 和 Eric Horvitz 进行了一项研究,调查了2.4亿人的300亿次对话,组成了一个即时消息数据集。他们发现微软信使用户的平均路径长度为6。 |
| | | |
| + | ===Computer networks=== |
| | | |
− | | + | In 2001, [[Duncan Watts]], a professor at [[Columbia University]], attempted to recreate Milgram's experiment on the Internet, using an e-mail message as the "package" that needed to be delivered, with 48,000 senders and 19 targets (in 157 countries). Watts found that the average (though not maximum) number of intermediaries was around six.<ref>{{cite journal |author=Duncan J Watts, Steven H Strogatz |year=1998 |title=Collective dynamics of 'small-world' networks |journal=Nature |pages=440–442 |doi=10.1038/30918 |pmid=9623998 |volume=393 |issue=6684|bibcode=1998Natur.393..440W |s2cid=4429113 }}</ref> |
− | It has been suggested by some commentators<ref>{{cite web|url=http://www.masternewmedia.org/news/2006/03/20/the_power_of_open_participatory.htm|title=The Power Of Open Participatory Media And Why Mass Media Must Be Abandoned|author=Robin Good|work=Robin Good's Master New Media}}</ref> that interlocking networks of computer mediated lateral communication could diffuse single messages to all interested users worldwide as per the 6 degrees of separation principle via Information Routing Groups, which are networks specifically designed to exploit this principle and lateral diffusion.
| |
| | | |
| It has been suggested by some commentators that interlocking networks of computer mediated lateral communication could diffuse single messages to all interested users worldwide as per the 6 degrees of separation principle via Information Routing Groups, which are networks specifically designed to exploit this principle and lateral diffusion. | | It has been suggested by some commentators that interlocking networks of computer mediated lateral communication could diffuse single messages to all interested users worldwide as per the 6 degrees of separation principle via Information Routing Groups, which are networks specifically designed to exploit this principle and lateral diffusion. |
第141行: |
第133行: |
| 一些评论者建议,计算机中介的横向通信联锁网络可以按照6度分离原则,通过信息路由组向全世界所有感兴趣的用户传播单一的信息,而信息路由组是专门设计来利用这一原则和横向传播的网络。 | | 一些评论者建议,计算机中介的横向通信联锁网络可以按照6度分离原则,通过信息路由组向全世界所有感兴趣的用户传播单一的信息,而信息路由组是专门设计来利用这一原则和横向传播的网络。 |
| | | |
| + | A 2007 study by [[Jure Leskovec]] and [[Eric Horvitz]] examined a data set of instant messages composed of 30 billion conversations among 240 million people. They found the average path length among Microsoft Messenger users to be 6.<ref>{{cite journal| arxiv=0803.0939| title=Planetary-Scale Views on an Instant-Messaging Network| author=Jure Leskovec and Eric Horvitz|date=June 2007| bibcode=2008arXiv0803.0939L}}</ref> |
| | | |
| | | |
− | ===An optimal algorithm to calculate degrees of separation in social networks===
| |
| | | |
− | Bakhshandeh ''et al.''<ref>Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer, "[http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4031 Degrees of Separation in Social Networks]", Fourth Annual Symposium on Combinatorial Search, 2011</ref> have addressed the search problem of identifying the degree of separation between two users in social networks such as Twitter. They have introduced new search techniques to provide optimal or near optimal solutions. The experiments are performed using Twitter, and they show an improvement of several orders of magnitude over greedy approaches. Their optimal algorithm finds an average degree of separation of 3.43 between two random Twitter users, requiring an average of only 67 requests for information over the Internet to Twitter. A near-optimal solution of length 3.88 can be found by making an average of 13.3 requests.
| + | It has been suggested by some commentators<ref>{{cite web|url=http://www.masternewmedia.org/news/2006/03/20/the_power_of_open_participatory.htm|title=The Power Of Open Participatory Media And Why Mass Media Must Be Abandoned|author=Robin Good|work=Robin Good's Master New Media}}</ref> that interlocking networks of computer mediated lateral communication could diffuse single messages to all interested users worldwide as per the 6 degrees of separation principle via Information Routing Groups, which are networks specifically designed to exploit this principle and lateral diffusion. |
| | | |
| Bakhshandeh et al. have addressed the search problem of identifying the degree of separation between two users in social networks such as Twitter. They have introduced new search techniques to provide optimal or near optimal solutions. The experiments are performed using Twitter, and they show an improvement of several orders of magnitude over greedy approaches. Their optimal algorithm finds an average degree of separation of 3.43 between two random Twitter users, requiring an average of only 67 requests for information over the Internet to Twitter. A near-optimal solution of length 3.88 can be found by making an average of 13.3 requests. | | Bakhshandeh et al. have addressed the search problem of identifying the degree of separation between two users in social networks such as Twitter. They have introduced new search techniques to provide optimal or near optimal solutions. The experiments are performed using Twitter, and they show an improvement of several orders of magnitude over greedy approaches. Their optimal algorithm finds an average degree of separation of 3.43 between two random Twitter users, requiring an average of only 67 requests for information over the Internet to Twitter. A near-optimal solution of length 3.88 can be found by making an average of 13.3 requests. |
第153行: |
第145行: |
| | | |
| | | |
− | == Popularization == | + | ===An optimal algorithm to calculate degrees of separation in social networks=== |
| | | |
− | No longer limited strictly to academic or philosophical thinking, the notion of six degrees recently has become influential throughout [[popular culture]]. Further advances in communication technology – and particularly the Internet – have drawn great attention to social networks and human interconnectedness. As a result, many popular media sources have addressed the term. The following provide a brief outline of the ways such ideas have shaped popular culture.
| + | Bakhshandeh ''et al.''<ref>Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer, "[http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4031 Degrees of Separation in Social Networks]", Fourth Annual Symposium on Combinatorial Search, 2011</ref> have addressed the search problem of identifying the degree of separation between two users in social networks such as Twitter. They have introduced new search techniques to provide optimal or near optimal solutions. The experiments are performed using Twitter, and they show an improvement of several orders of magnitude over greedy approaches. Their optimal algorithm finds an average degree of separation of 3.43 between two random Twitter users, requiring an average of only 67 requests for information over the Internet to Twitter. A near-optimal solution of length 3.88 can be found by making an average of 13.3 requests. |
| | | |
| No longer limited strictly to academic or philosophical thinking, the notion of six degrees recently has become influential throughout popular culture. Further advances in communication technology – and particularly the Internet – have drawn great attention to social networks and human interconnectedness. As a result, many popular media sources have addressed the term. The following provide a brief outline of the ways such ideas have shaped popular culture. | | No longer limited strictly to academic or philosophical thinking, the notion of six degrees recently has become influential throughout popular culture. Further advances in communication technology – and particularly the Internet – have drawn great attention to social networks and human interconnectedness. As a result, many popular media sources have addressed the term. The following provide a brief outline of the ways such ideas have shaped popular culture. |
第163行: |
第155行: |
| | | |
| | | |
− | ===Popularization of offline practice===
| + | == Popularization == |
| + | |
| + | No longer limited strictly to academic or philosophical thinking, the notion of six degrees recently has become influential throughout [[popular culture]]. Further advances in communication technology – and particularly the Internet – have drawn great attention to social networks and human interconnectedness. As a result, many popular media sources have addressed the term. The following provide a brief outline of the ways such ideas have shaped popular culture. |
| | | |
| | | |
| | | |
− | ====John Guare's ''Six Degrees of Separation''==== | + | ===Popularization of offline practice=== |
| | | |
− | {{Main|Six Degrees of Separation (play)|Six Degrees of Separation (film)}}
| |
| | | |
− | American playwright [[John Guare]] wrote a play in 1990 and released a 1993 film that popularized it; it is Guare's most widely known work. {{Citation needed|date = July 2016}} The play ruminates upon the idea that any two individuals are connected by at most five others. As one of the characters states:
| |
| | | |
| American playwright John Guare wrote a play in 1990 and released a 1993 film that popularized it; it is Guare's most widely known work. The play ruminates upon the idea that any two individuals are connected by at most five others. As one of the characters states: | | American playwright John Guare wrote a play in 1990 and released a 1993 film that popularized it; it is Guare's most widely known work. The play ruminates upon the idea that any two individuals are connected by at most five others. As one of the characters states: |
| | | |
− | 美国剧作家约翰 · 瓜尔在1990年写了一部戏剧,并在1993年发行了一部电影使其流行起来; 这是瓜尔最广为人知的作品。这出戏反复思考任何两个人最多由五个人联系在一起的想法。正如其中一个角色所说: | + | 美国剧作家约翰 · 瓜尔在1990年写了一部戏剧,并在1993年发行了一部电影使其流行起来; 这是瓜尔最广为人知的作品。这出戏反复思考任何两个人至多由五个其他人联系在一起的想法。正如其中一个角色所说: |
| | | |
| + | ====John Guare's ''Six Degrees of Separation''==== |
| | | |
| + | {{Main|Six Degrees of Separation (play)|Six Degrees of Separation (film)}} |
| | | |
| <blockquote> | | <blockquote> |
| | | |
− | <blockquote> | + | < 我们的目标是什么 > |
| | | |
− | 块引号
| + | American playwright [[John Guare]] wrote a play in 1990 and released a 1993 film that popularized it; it is Guare's most widely known work. {{Citation needed|date = July 2016}} The play ruminates upon the idea that any two individuals are connected by at most five others. As one of the characters states: |
| | | |
− | I read somewhere that everybody on this planet is separated by only six other people. Six degrees of separation between us and everyone else on this planet. The President of the United States, a gondolier in Venice, just fill in the names. I find it A) extremely comforting that we're so close, and B) like [[Chinese water torture]] that we're so close because you have to find the right six people to make the right connection... I am bound to everyone on this planet by a trail of six people.<ref name=imdb>Memorable quotes from ''Six Degrees of Separation.'' Accessed Nov. 11, 2006 from [https://www.imdb.com/title/tt0108149/quotes IMDB.com].</ref> | + | I read somewhere that everybody on this planet is separated by only six other people. Six degrees of separation between us and everyone else on this planet. The President of the United States, a gondolier in Venice, just fill in the names. I find it A) extremely comforting that we're so close, and B) like Chinese water torture that we're so close because you have to find the right six people to make the right connection... I am bound to everyone on this planet by a trail of six people. |
| | | |
− | I read somewhere that everybody on this planet is separated by only six other people. Six degrees of separation between us and everyone else on this planet. The President of the United States, a gondolier in Venice, just fill in the names. I find it A) extremely comforting that we're so close, and B) like Chinese water torture that we're so close because you have to find the right six people to make the right connection... I am bound to everyone on this planet by a trail of six people.
| + | 我在哪里读到过,这个星球上的每个人之间只隔着六个人。我们和这个星球上其他人之间的六度分隔理论。美国总统,威尼斯的贡多拉船夫,只需填写这些名字。我觉得 a)我们如此亲密让人极其欣慰,b)我们如此亲密就像中国的水刑,因为你必须找到合适的六个人来建立正确的联系... ..。我和这个星球上的每一个人都有联系,只有六个人。 |
| | | |
− | 我在哪里读到过,这个星球上的每个人之间只隔着六个人。我们和这个星球上的其他人之间的六度分隔理论。美国总统,威尼斯的贡多拉船夫,只需填写这些名字。我觉得 a)我们如此亲密让人极其欣慰,b)我们如此亲密就像中国的水刑,因为你必须找到合适的六个人来建立正确的联系... ..。我和这个星球上的每一个人都有联系,只有六个人。
| |
| | | |
− | </blockquote>
| |
| | | |
| </blockquote> | | </blockquote> |
| | | |
− | / blockquote | + | </blockquote > |
| | | |
| + | <blockquote> |
| | | |
− | | + | I read somewhere that everybody on this planet is separated by only six other people. Six degrees of separation between us and everyone else on this planet. The President of the United States, a gondolier in Venice, just fill in the names. I find it A) extremely comforting that we're so close, and B) like [[Chinese water torture]] that we're so close because you have to find the right six people to make the right connection... I am bound to everyone on this planet by a trail of six people.<ref name=imdb>Memorable quotes from ''Six Degrees of Separation.'' Accessed Nov. 11, 2006 from [https://www.imdb.com/title/tt0108149/quotes IMDB.com].</ref> |
− | Guare, in interviews, attributed his awareness of the "six degrees" to Marconi.{{Citation needed|date = July 2016}} Although this idea had been circulating in various forms for decades, it is Guare's piece that is most responsible for popularizing the phrase "six degrees of separation."{{Citation needed|date = July 2016}} Following Guare's lead, many future television and film sources would later incorporate the notion into their stories.{{Citation needed|date = July 2016}}
| |
| | | |
| Guare, in interviews, attributed his awareness of the "six degrees" to Marconi. Although this idea had been circulating in various forms for decades, it is Guare's piece that is most responsible for popularizing the phrase "six degrees of separation." Following Guare's lead, many future television and film sources would later incorporate the notion into their stories. | | Guare, in interviews, attributed his awareness of the "six degrees" to Marconi. Although this idea had been circulating in various forms for decades, it is Guare's piece that is most responsible for popularizing the phrase "six degrees of separation." Following Guare's lead, many future television and film sources would later incorporate the notion into their stories. |
第205行: |
第197行: |
| 在采访中,瓜雷将他对“六度”的意识归因于马可尼。虽然这个想法已经以各种形式流传了几十年,但是这是 Guare 的作品,它最有责任推广短语“六度分隔理论”在 Guare 的带领下,许多未来的电视和电影资源后来将把这个概念纳入他们的故事。 | | 在采访中,瓜雷将他对“六度”的意识归因于马可尼。虽然这个想法已经以各种形式流传了几十年,但是这是 Guare 的作品,它最有责任推广短语“六度分隔理论”在 Guare 的带领下,许多未来的电视和电影资源后来将把这个概念纳入他们的故事。 |
| | | |
| + | </blockquote> |
| | | |
| | | |
− | [[J. J. Abrams]], the executive producer of television series ''[[Six Degrees]]'' and ''[[Lost (TV series)|Lost]]'', played the role of Doug in the film adaptation of this play.{{Citation needed|date = July 2016}} Many of the play's themes are apparent in his television shows (see below).{{Citation needed|date = July 2016}}
| |
| | | |
| J. J. Abrams, the executive producer of television series Six Degrees and Lost, played the role of Doug in the film adaptation of this play. Many of the play's themes are apparent in his television shows (see below). | | J. J. Abrams, the executive producer of television series Six Degrees and Lost, played the role of Doug in the film adaptation of this play. Many of the play's themes are apparent in his television shows (see below). |
| | | |
− | J · j · 艾布拉姆斯,电视连续剧《六度》和《迷失》的执行制片人,在这部改编剧本的电影中扮演道格的角色。该剧的许多主题在他的电视节目中都很明显(见下文)。 | + | J · j · 艾布拉姆斯,电视连续剧《六度》和《迷失》的执行制片人,在这部改编剧本的电影中扮演道格的角色。该剧的许多主题在他的电视节目中都很明显。 |
| | | |
| + | Guare, in interviews, attributed his awareness of the "six degrees" to Marconi.{{Citation needed|date = July 2016}} Although this idea had been circulating in various forms for decades, it is Guare's piece that is most responsible for popularizing the phrase "six degrees of separation."{{Citation needed|date = July 2016}} Following Guare's lead, many future television and film sources would later incorporate the notion into their stories.{{Citation needed|date = July 2016}} |
| | | |
| | | |
− | ====Kevin Bacon game====
| |
| | | |
− | The game "[[Six Degrees of Kevin Bacon]]"<ref name=SDS-T-02>{{cite news|url=https://www.telegraph.co.uk/technology/facebook/8704891/Six-degrees-of-separation-theory-tested-on-Facebook.html|title=Six degrees of separation' theory tested on Facebook|work=Telegraph|accessdate=7 May 2012|date=17 August 2011}}</ref> was invented as a play on the concept: the goal is to link any actor to [[Kevin Bacon]] through no more than six connections, where two actors are connected if they have appeared in a movie or commercial together. It was created by three students at [[Albright College]] in Pennsylvania,<ref name=SDS-T-03>{{cite news|url=https://www.telegraph.co.uk/news/celebritynews/8560483/Actors-Hollywood-career-spawned-Six-Degrees-of-Kevin-Bacon.html|title=Actor's Hollywood career spawned 'Six Degrees of Kevin Bacon'|work=Telegraph|accessdate=7 May 2012|date=6 June 2011}}</ref> who came up with the concept while watching ''[[Footloose (1984 film)|Footloose]]''. On September 13, 2012, Google made it possible to search for any given actor's 'Bacon Number' through their search engine.
| + | [[J. J. Abrams]], the executive producer of television series ''[[Six Degrees (TV series)|Six Degrees]]'' and ''[[Lost (TV series)|Lost]]'', played the role of Doug in the film adaptation of this play.{{Citation needed|date = July 2016}} Many of the play's themes are apparent in his television shows (see below).{{Citation needed|date = July 2016}} |
| | | |
| The game "Six Degrees of Kevin Bacon" was invented as a play on the concept: the goal is to link any actor to Kevin Bacon through no more than six connections, where two actors are connected if they have appeared in a movie or commercial together. It was created by three students at Albright College in Pennsylvania, who came up with the concept while watching Footloose. On September 13, 2012, Google made it possible to search for any given actor's 'Bacon Number' through their search engine. | | The game "Six Degrees of Kevin Bacon" was invented as a play on the concept: the goal is to link any actor to Kevin Bacon through no more than six connections, where two actors are connected if they have appeared in a movie or commercial together. It was created by three students at Albright College in Pennsylvania, who came up with the concept while watching Footloose. On September 13, 2012, Google made it possible to search for any given actor's 'Bacon Number' through their search engine. |
第225行: |
第217行: |
| | | |
| | | |
− | Upon the arrival of the 4G mobile network in the United Kingdom, Kevin Bacon appears in several commercials for the [[EE (telecommunications company)|EE]] Network in which he links himself to several well known celebrities and TV shows in the UK.
| + | ====Kevin Bacon game==== |
| | | |
| Upon the arrival of the 4G mobile network in the United Kingdom, Kevin Bacon appears in several commercials for the EE Network in which he links himself to several well known celebrities and TV shows in the UK. | | Upon the arrival of the 4G mobile network in the United Kingdom, Kevin Bacon appears in several commercials for the EE Network in which he links himself to several well known celebrities and TV shows in the UK. |
| | | |
− | 随着4 g 移动网络进入英国,凯文 · 培根出现在 EE Network 的几个商业广告中,他把自己和英国的几个知名名人和电视节目联系起来。 | + | 随着4 g 移动网络在英国的到来,Kevin Bacon 出现在 EE Network 的几个商业广告中,他把自己和英国几个著名的名人和电视节目联系起来。 |
| | | |
| + | The game "[[Six Degrees of Kevin Bacon]]"<ref name=SDS-T-02>{{cite news|url=https://www.telegraph.co.uk/technology/facebook/8704891/Six-degrees-of-separation-theory-tested-on-Facebook.html|title=Six degrees of separation' theory tested on Facebook|work=Telegraph|accessdate=7 May 2012|date=17 August 2011}}</ref> was invented as a play on the concept: the goal is to link any actor to [[Kevin Bacon]] through no more than six connections, where two actors are connected if they have appeared in a movie or commercial together. It was created by three students at [[Albright College]] in Pennsylvania,<ref name=SDS-T-03>{{cite news|url=https://www.telegraph.co.uk/news/celebritynews/8560483/Actors-Hollywood-career-spawned-Six-Degrees-of-Kevin-Bacon.html|title=Actor's Hollywood career spawned 'Six Degrees of Kevin Bacon'|work=Telegraph|accessdate=7 May 2012|date=6 June 2011}}</ref> who came up with the concept while watching ''[[Footloose (1984 film)|Footloose]]''. On September 13, 2012, Google made it possible to search for any given actor's 'Bacon Number' through their search engine.<ref>https://www.cnbc.com/2012/09/13/whats-your-bacon-number-just-ask-google.html</ref> |
| | | |
| | | |
− | ====John L. Sullivan====
| |
| | | |
− | An early version involved former world Heavyweight boxing champion, [[John L. Sullivan]], in which people would ask others to "shake the hand that shook the hand that shook the hand that shook the hand of 'the great John L.'"<ref>{{cite news |url=http://www.thesweetscience.com/component/content/article/41-articles-of-2005/1514-the-great-john-l-sullivan |title=The Great John L. Sullivan |first=Robert |last=Ecksel |date=1 January 2005 |access-date=5 October 2019 |work=The Sweet Science |publisher=IBofP}}</ref>
| + | Upon the arrival of the 4G mobile network in the United Kingdom, Kevin Bacon appears in several commercials for the [[EE (telecommunications company)|EE]] Network in which he links himself to several well known celebrities and TV shows in the UK. |
| | | |
| An early version involved former world Heavyweight boxing champion, John L. Sullivan, in which people would ask others to "shake the hand that shook the hand that shook the hand that shook the hand of 'the great John L.'" | | An early version involved former world Heavyweight boxing champion, John L. Sullivan, in which people would ask others to "shake the hand that shook the hand that shook the hand that shook the hand of 'the great John L.'" |
| | | |
| 早期的一个版本涉及前世界重量级拳击冠军约翰 · l · 沙利文,在这个版本中,人们会要求其他人“和握过‘伟大的约翰 · l’的手的人握手” | | 早期的一个版本涉及前世界重量级拳击冠军约翰 · l · 沙利文,在这个版本中,人们会要求其他人“和握过‘伟大的约翰 · l’的手的人握手” |
| + | |
| + | |
| + | |
| + | ====John L. Sullivan==== |
| + | |
| + | An early version involved former world Heavyweight boxing champion, [[John L. Sullivan]], in which people would ask others to "shake the hand that shook the hand that shook the hand that shook the hand of 'the great John L.'"<ref>{{cite news |url=http://www.thesweetscience.com/component/content/article/41-articles-of-2005/1514-the-great-john-l-sullivan |title=The Great John L. Sullivan |first=Robert |last=Ecksel |date=1 January 2005 |access-date=5 October 2019 |work=The Sweet Science |publisher=IBofP}}</ref> |
| | | |
| | | |
第278行: |
第276行: |
| | | |
| * ''[[Six Degrees of Inner Turbulence]]'' is a 2002 album by progressive rock band [[Dream Theater]]. | | * ''[[Six Degrees of Inner Turbulence]]'' is a 2002 album by progressive rock band [[Dream Theater]]. |
| + | |
| + | * English progressive rock band [[Arena (band)|Arena]] released an album titled ''The Seventh Degree of Separation'' in 2011. |
| | | |
| * ''[[Nessun grado di separazione]]'' is a 2016 song by Italian singer [[Francesca Michielin]]. A bilingual English and Italian version of the song called "No Degree of Separation" represented [[Italy in the Eurovision Song Contest 2016|Italy]] in the [[Eurovision Song Contest 2016]] held in [[Stockholm]], [[Sweden]]. | | * ''[[Nessun grado di separazione]]'' is a 2016 song by Italian singer [[Francesca Michielin]]. A bilingual English and Italian version of the song called "No Degree of Separation" represented [[Italy in the Eurovision Song Contest 2016|Italy]] in the [[Eurovision Song Contest 2016]] held in [[Stockholm]], [[Sweden]]. |
| | | |
| | | |
| + | |
| + | <!-- PLEASE DON'T ADD MORE EXAMPLES TO LIST!!! I only had one to illustrate the point.--> |
| + | |
| + | < ! -- 请不要在列表中增加更多的例子! ! !我只有一个例子来说明这一点 |
| | | |
| ====Television==== | | ====Television==== |
| | | |
− | * ''[[Six Degrees]]'' is a 2006 television series on [[American Broadcasting Company|ABC]] in the US. The show details the experiences of six [[New York City|New Yorkers]] who go about their lives without realizing they are affecting each other, and gradually meet one another.<ref>{{cite web|url=http://abc.go.com/primetime/sixdegrees/index.html|title=ABC TV Shows, Specials & Movies - ABC.com|work=ABC}}</ref> | + | * ''[[Six Degrees (TV series)|Six Degrees]]'' is a 2006 television series on [[American Broadcasting Company|ABC]] in the US. The show details the experiences of six [[New York City|New Yorkers]] who go about their lives without realizing they are affecting each other, and gradually meet one another.<ref>{{cite web|url=http://abc.go.com/primetime/sixdegrees/index.html|title=ABC TV Shows, Specials & Movies - ABC.com|work=ABC}}</ref> |
− | | |
− | <!-- PLEASE DON'T ADD MORE EXAMPLES TO LIST!!! I only had one to illustrate the point.-->
| |
| | | |
| <!-- PLEASE DON'T ADD MORE EXAMPLES TO LIST!!! I only had one to illustrate the point.--> | | <!-- PLEASE DON'T ADD MORE EXAMPLES TO LIST!!! I only had one to illustrate the point.--> |
− |
| |
− | ! -- 请不要在列表中添加更多的例子! !我只有一个例子来说明这一点
| |
| | | |
| * ''Connected: The Power of Six Degrees'' is a 2008 television episode on the [[Science Channel]] in the US and abroad.<ref>{{cite web|url=http://science.discovery.com/tv-schedules/special.html?paid=48.15725.125206.36064.0|title=Connected: The Power of Six Degrees|publisher=The Science Channel – [[Discovery Channel]]}}</ref> | | * ''Connected: The Power of Six Degrees'' is a 2008 television episode on the [[Science Channel]] in the US and abroad.<ref>{{cite web|url=http://science.discovery.com/tv-schedules/special.html?paid=48.15725.125206.36064.0|title=Connected: The Power of Six Degrees|publisher=The Science Channel – [[Discovery Channel]]}}</ref> |
第314行: |
第314行: |
| | | |
| | | |
| + | |
| + | In 2013, Hungarian physicist Albert-László Barabási discovered that, on average, there are 19 degrees of separation between any two web pages. |
| + | |
| + | 2013年,匈牙利物理学家 albert-lászló Barabási 发现,任何两个网页之间平均有19度的分离度。 |
| | | |
| ===Website and application=== | | ===Website and application=== |
第321行: |
第325行: |
| In 2013, Hungarian physicist [[Albert-László Barabási]] discovered that, on average, there are 19 degrees of separation between any two web pages.<ref>[https://www.pcworld.com/article/2028714/any-two-web-pages-are-separated-by-just-19-clicks-study-finds.html /any two web pages are separated by just 19 clicks study finds]</ref> | | In 2013, Hungarian physicist [[Albert-László Barabási]] discovered that, on average, there are 19 degrees of separation between any two web pages.<ref>[https://www.pcworld.com/article/2028714/any-two-web-pages-are-separated-by-just-19-clicks-study-finds.html /any two web pages are separated by just 19 clicks study finds]</ref> |
| | | |
− | In 2013, Hungarian physicist Albert-László Barabási discovered that, on average, there are 19 degrees of separation between any two web pages. | + | In late February 2018, the website [https://www.sixdegreesofwikipedia.com www.SixDegreesOfWikipedia.com] was published by Jacob Wenger. This site takes any two Wikipedia articles and finds the various hyperlink paths that interconnect the two in the fewest clicks. It then shows each of the steps that were taken to do so and also presents a graphical display of the connections. On March 14, 2018, the site stated that among searches up to that date (~half a million), there have been an average separation of 3.0190°. From these, the number of searches that required six or more degrees was 1.417 percent. It also stated that searches with no connection found was 1.07%, and this was attributed to certain articles being dead ends or having very few links. (Wenger's open source code is available on GitHub, and this enabled other sites to copy the concept, such as [http://degreesofwikipedia.com/ degreesofwikipedia.com].) |
| | | |
− | 2013年,匈牙利物理学家 albert-l szl barab si 发现,任何两个网页之间平均有19度的分离度。
| + | 2018年2月下旬,雅各布 · 温格发布了一个网站,名为《 https://www.sixdegreesofwikipedia.com sixdegreesofwikipedia.com。这个网站只需要两篇维基百科文章,就可以找到不同的超链接路径,以最少的点击量将两者连接起来。然后,它显示了为此所采取的每个步骤,并且还显示了连接的图形显示。2018年3月14日,该网站表示,在截至当时的搜索中(约50万次) ,平均间隔为3.0190 ° 。其中,需要6个或更多学位的搜索次数为1.417% 。它还指出,没有发现连接的搜索占1.07% ,这是由于某些文章是死胡同或只有很少的链接。(Wenger 的开源代码可以在 GitHub 上找到,这使得其他网站可以复制这个概念,比如 http://degreesofwikipedia.com/ degreesofwikipedia.com。) |
| | | |
| | | |
第329行: |
第333行: |
| ==== Six Degrees of Wikipedia ==== | | ==== Six Degrees of Wikipedia ==== |
| | | |
− | In late February 2018, the website [https://www.sixdegreesofwikipedia.com www.SixDegreesOfWikipedia.com] was published by Jacob Wenger. This site takes any two Wikipedia articles and finds the various hyperlink paths that interconnect the two in the least number of clicks. It then shows each of the steps that were taken to do so and also presents a graphical display of the connections. On March 14, 2018, the site stated that among searches up to that date (~half a million), there have been an average separation of 3.0190°. From these, the number of searches that required six or more degrees was 1.417 percent. It also stated that searches with no connection found was 1.07%, and this was attributed to certain articles being dead ends or having very few links.<ref>[https://www.sixdegreesofwikipedia.com/blog/search-results-analysis Insights On Hitler And More From The First 500,000 Searches] by Jacob Wenger, March 14, 2018 (Searches with the same start and end page were not included in this average, and neither were articles in which no connection was found.)</ref> (Wenger's open source code is available on GitHub, and this enabled other sites to copy the concept, such as [http://degreesofwikipedia.com/ degreesofwikipedia.com].) | + | In late February 2018, the website [https://www.sixdegreesofwikipedia.com www.SixDegreesOfWikipedia.com] was published by Jacob Wenger. This site takes any two Wikipedia articles and finds the various hyperlink paths that interconnect the two in the fewest clicks. It then shows each of the steps that were taken to do so and also presents a graphical display of the connections. On March 14, 2018, the site stated that among searches up to that date (~half a million), there have been an average separation of 3.0190°. From these, the number of searches that required six or more degrees was 1.417 percent. It also stated that searches with no connection found was 1.07%, and this was attributed to certain articles being dead ends or having very few links.<ref>[https://www.sixdegreesofwikipedia.com/blog/search-results-analysis Insights On Hitler And More From The First 500,000 Searches] by Jacob Wenger, March 14, 2018 (Searches with the same start and end page were not included in this average, and neither were articles in which no connection was found.)</ref> (Wenger's open source code is available on GitHub, and this enabled other sites to copy the concept, such as [http://degreesofwikipedia.com/ degreesofwikipedia.com].) |
| | | |
− | In late February 2018, the website [https://www.sixdegreesofwikipedia.com www.SixDegreesOfWikipedia.com] was published by Jacob Wenger. This site takes any two Wikipedia articles and finds the various hyperlink paths that interconnect the two in the least number of clicks. It then shows each of the steps that were taken to do so and also presents a graphical display of the connections. On March 14, 2018, the site stated that among searches up to that date (~half a million), there have been an average separation of 3.0190°. From these, the number of searches that required six or more degrees was 1.417 percent. It also stated that searches with no connection found was 1.07%, and this was attributed to certain articles being dead ends or having very few links. (Wenger's open source code is available on GitHub, and this enabled other sites to copy the concept, such as [http://degreesofwikipedia.com/ degreesofwikipedia.com].)
| + | A Facebook platform application named "Six Degrees" was developed by Karl Bunyan, which calculates the degrees of separation between people. It had over 5.8 million users, as seen from the group's page. The average separation for all users of the application is 5.73 degrees, whereas the maximum degree of separation is 12. The application has a "Search for Connections" window to input any name of a Facebook user, to which it then shows the chain of connections. In June 2009, Bunyan shut down the application, presumably due to issues with Facebook's caching policy; specifically, the policy prohibited the storing of friend lists for more than 24 hours, which would have made the application inaccurate. A new version of the application became available at Six Degrees after Karl Bunyan gave permission to a group of developers led by Todd Chaffee to re-develop the application based on Facebook's revised policy on caching data. |
| | | |
− | 2018年2月下旬,雅各布 · 温格发布了一个网站,名为《 https://www.sixdegreesofwikipedia.com sixdegreesofwikipedia.com。这个网站接受任意两篇维基百科文章,找到各种超链接路径,以最少的点击次数将两者相互连接。然后,它显示了为此所采取的每个步骤,并且还显示了连接的图形显示。2018年3月14日,该网站声明,截止到那一天(大约50万次)的搜索中,平均间隔为3.0190次。其中,需要6个或更多学位的搜索次数为1.417% 。它还指出,没有发现连接的搜索占1.07% ,这是由于某些文章是死胡同或只有很少的链接。(Wenger 的开源代码可以在 GitHub 上找到,这使得其他网站可以复制这个概念,比如 http://degreesofwikipedia.com/ degreesofwikipedia.com。)
| + | 一个名为“ Six Degrees”的 Facebook 平台应用程序是由 Karl Bunyan 开发的,它可以计算人与人之间的距离。它拥有超过580万的用户,从该组织的页面上可以看到。应用程序的所有用户的平均分离度为5.73度,而最大分离度为12度。该应用程序有一个“搜索连接”窗口,用于输入 Facebook 用户的任何名称,然后显示连接链。2009年6月,班扬关闭了这个应用程序,可能是因为 Facebook 的缓存政策出了问题; 具体来说,政策禁止存储朋友列表超过24小时,这会导致这个应用程序不准确。这个应用程序的一个新版本在 Six Degrees 上发布,此前卡尔•班扬(Karl Bunyan)允许托德•查菲(Todd Chaffee)领导的一群开发人员根据 Facebook 修订后的缓存数据政策重新开发该应用程序。 |
| | | |
| | | |
| | | |
| ==== Facebook ==== | | ==== Facebook ==== |
− |
| |
− | A [[Facebook]] platform application named "Six Degrees" was developed by Karl Bunyan, which calculates the degrees of separation between people. It had over 5.8 million users, as seen from the group's page. The average separation for all users of the application is 5.73 degrees, whereas the maximum degree of separation is 12. The application has a "Search for Connections" window to input any name of a [[Facebook]] user, to which it then shows the chain of connections. In June 2009, Bunyan shut down the application, presumably due to issues with Facebook's caching policy; specifically, the policy prohibited the storing of friend lists for more than 24 hours, which would have made the application inaccurate.<ref>{{cite web|url=http://blog.karlbunyan.com/2009/06/24/six-degrees-come-in-your-time-is-up/|title=Six Degrees: come in, your time is up|work=K! - the blog of Karl Bunyan}}</ref> A new version of the application became available at Six Degrees after Karl Bunyan gave permission to a group of developers led by Todd Chaffee to re-develop the application based on Facebook's revised policy on caching data.<ref>{{cite web|url=http://apps.facebook.com/sixdegreesearch|title=Six Degrees on Facebook - Facebook|work=facebook.com}}</ref><ref>{{cite web|url=http://www.insidefacebook.com/2010/04/21/facebook-removing-24-hour-caching-policy-on-user-data-for-developers/|title=Facebook Removing 24 Hour Caching Policy on User Data for Developers|work=insidefacebook.com}}</ref>
| |
− |
| |
− | A Facebook platform application named "Six Degrees" was developed by Karl Bunyan, which calculates the degrees of separation between people. It had over 5.8 million users, as seen from the group's page. The average separation for all users of the application is 5.73 degrees, whereas the maximum degree of separation is 12. The application has a "Search for Connections" window to input any name of a Facebook user, to which it then shows the chain of connections. In June 2009, Bunyan shut down the application, presumably due to issues with Facebook's caching policy; specifically, the policy prohibited the storing of friend lists for more than 24 hours, which would have made the application inaccurate. A new version of the application became available at Six Degrees after Karl Bunyan gave permission to a group of developers led by Todd Chaffee to re-develop the application based on Facebook's revised policy on caching data.
| |
− |
| |
− | 一个名为“ Six Degrees”的 Facebook 平台应用程序是由 Karl Bunyan 开发的,它可以计算人与人之间的距离。从该组织的页面上可以看到,它拥有超过580万的用户。应用程序的所有用户的平均分离度为5.73度,而最大分离度为12度。该应用程序有一个“搜索连接”窗口,用于输入 Facebook 用户的任何名称,然后显示连接链。2009年6月,班扬关闭了这个应用程序,可能是因为 Facebook 的缓存政策出了问题; 具体来说,政策禁止存储朋友列表超过24小时,这会导致这个应用程序不准确。这个应用程序的一个新版本在 Six Degrees 上发布,此前卡尔•班扬(Karl Bunyan)允许托德•查菲(Todd Chaffee)领导的一群开发人员根据 Facebook 修订后的高速缓存数据政策重新开发该应用程序。
| |
− |
| |
− |
| |
− |
| |
− | The initial version of the application was built at a Facebook Developers Garage London [[hackathon]] with [[Mark Zuckerberg]] in attendance.<ref>{{cite web |url=http://blog.mikamai.co.uk/2010/06/mikamai-participates-with-zuck-in-london-facebook-hackathon/ |title=Archived copy |accessdate=2010-09-11 |url-status=dead |archiveurl=https://archive.is/20120707013246/http://blog.mikamai.co.uk/2010/06/mikamai-participates-with-zuck-in-london-facebook-hackathon/ |archivedate=2012-07-07 }}</ref>
| |
| | | |
| The initial version of the application was built at a Facebook Developers Garage London hackathon with Mark Zuckerberg in attendance. | | The initial version of the application was built at a Facebook Developers Garage London hackathon with Mark Zuckerberg in attendance. |
| | | |
− | 这个应用程序的最初版本是在伦敦 Facebook 开发者车库黑客马拉松上开发的,马克 · 扎克伯格也参加了这个活动。 | + | 这个应用程序的最初版本是在伦敦 Facebook 开发者车库的黑客马拉松上开发的,马克 · 扎克伯格也参加了这个活动。 |
| | | |
| + | A [[Facebook]] platform application named "Six Degrees" was developed by Karl Bunyan, which calculates the degrees of separation between people. It had over 5.8 million users, as seen from the group's page. The average separation for all users of the application is 5.73 degrees, whereas the maximum degree of separation is 12. The application has a "Search for Connections" window to input any name of a [[Facebook]] user, to which it then shows the chain of connections. In June 2009, Bunyan shut down the application, presumably due to issues with Facebook's caching policy; specifically, the policy prohibited the storing of friend lists for more than 24 hours, which would have made the application inaccurate.<ref>{{cite web|url=http://blog.karlbunyan.com/2009/06/24/six-degrees-come-in-your-time-is-up/|title=Six Degrees: come in, your time is up|work=K! - the blog of Karl Bunyan}}</ref> A new version of the application became available at Six Degrees after Karl Bunyan gave permission to a group of developers led by Todd Chaffee to re-develop the application based on Facebook's revised policy on caching data.<ref>{{cite web|url=http://apps.facebook.com/sixdegreesearch|title=Six Degrees on Facebook - Facebook|work=facebook.com}}</ref><ref>{{cite web|url=http://www.insidefacebook.com/2010/04/21/facebook-removing-24-hour-caching-policy-on-user-data-for-developers/|title=Facebook Removing 24 Hour Caching Policy on User Data for Developers|work=insidefacebook.com}}</ref> |
| | | |
| | | |
− | Yahoo! Research Small World Experiment has been conducting an experiment and everyone with a Facebook account can take part in it. According to the research page, this research has the potential of resolving the still unresolved theory of six degrees of separation.<ref name=SDS-T-02/><ref>{{cite web |url=http://smallworld.sandbox.yahoo.com/ |title=Archived copy |accessdate=2011-09-27 |url-status=dead |archiveurl=https://web.archive.org/web/20110926141619/http://smallworld.sandbox.yahoo.com/ |archivedate=2011-09-26 }}</ref>
| |
| | | |
| Yahoo! Research Small World Experiment has been conducting an experiment and everyone with a Facebook account can take part in it. According to the research page, this research has the potential of resolving the still unresolved theory of six degrees of separation. | | Yahoo! Research Small World Experiment has been conducting an experiment and everyone with a Facebook account can take part in it. According to the research page, this research has the potential of resolving the still unresolved theory of six degrees of separation. |
第361行: |
第355行: |
| 雅虎!研究小世界实验已经进行了一项实验,每个拥有 Facebook 账号的人都可以参与其中。根据研究页面,这项研究有可能解决尚未解决的六度分隔理论理论。 | | 雅虎!研究小世界实验已经进行了一项实验,每个拥有 Facebook 账号的人都可以参与其中。根据研究页面,这项研究有可能解决尚未解决的六度分隔理论理论。 |
| | | |
| + | The initial version of the application was built at a Facebook Developers Garage London [[hackathon]] with [[Mark Zuckerberg]] in attendance.<ref>{{cite web |url=http://blog.mikamai.co.uk/2010/06/mikamai-participates-with-zuck-in-london-facebook-hackathon/ |title=Archived copy |accessdate=2010-09-11 |url-status=dead |archiveurl=https://archive.is/20120707013246/http://blog.mikamai.co.uk/2010/06/mikamai-participates-with-zuck-in-london-facebook-hackathon/ |archivedate=2012-07-07 }}</ref> |
| | | |
| | | |
− | Facebook's data team released two papers in November 2011 which document that amongst all Facebook users at the time of research (721 million users with 69 billion friendship links) there is an average distance of 4.74.<ref name=SDS-T-01>{{cite news|url=https://www.telegraph.co.uk/technology/facebook/8906693/Facebook-cuts-six-degrees-of-separation-to-four.html|title=Facebook cuts six degrees of separation to four|work=Telegraph|accessdate=7 May 2012|first=Emma|last=Barnett|date=22 November 2011}}</ref><ref name="facebook2016" /> Probabilistic algorithms were applied on statistical metadata to verify the accuracy of the measurements.<ref>{{cite arXiv|eprint=1111.4570|title=Four Degrees of Separation|last=Backstrom|first=Lars |author2=Boldi, Paolo |author3=Rosa, Marco |author4=Ugander, Johan |author5=Vigna, Sebastiano|date=2011-11-19|class=cs.SI}}</ref> It was also found that 99.91% of Facebook users were interconnected, forming a large connected component.<ref>{{cite arXiv|eprint=1111.4503|title=The Anatomy of the Facebook Social Graph|last=Ugander|first=Johan|author2=Karrer, Brian |author3=Backstrom, Lars |author4= Marlow, Cameron |class=cs.SI|year=2011}}</ref>
| |
| | | |
| Facebook's data team released two papers in November 2011 which document that amongst all Facebook users at the time of research (721 million users with 69 billion friendship links) there is an average distance of 4.74. It was also found that 99.91% of Facebook users were interconnected, forming a large connected component. | | Facebook's data team released two papers in November 2011 which document that amongst all Facebook users at the time of research (721 million users with 69 billion friendship links) there is an average distance of 4.74. It was also found that 99.91% of Facebook users were interconnected, forming a large connected component. |
| | | |
− | Facebook 的数据团队在2011年11月发表了两篇论文,文中指出在所有 Facebook 用户(7.21亿用户拥有690亿个好友链接)之间的平均距离为4.74。研究还发现,99.91% 的 Facebook 用户是相互联系的,形成了一个巨大的连接元件(图论)。 | + | Facebook 的数据团队在2011年11月发表了两篇论文,文中指出,在进行研究的时候,所有 Facebook 用户(7.21亿用户,拥有690亿个好友链接)之间的平均距离为4.74。调查还发现,99.91% 的 Facebook 用户是相互联系的,形成了一个巨大的连接元件(图论)。 |
| | | |
| + | Yahoo! Research Small World Experiment has been conducting an experiment and everyone with a Facebook account can take part in it. According to the research page, this research has the potential of resolving the still unresolved theory of six degrees of separation.<ref name=SDS-T-02/><ref>{{cite web |url=http://smallworld.sandbox.yahoo.com/ |title=Archived copy |accessdate=2011-09-27 |url-status=dead |archiveurl=https://web.archive.org/web/20110926141619/http://smallworld.sandbox.yahoo.com/ |archivedate=2011-09-26 }}</ref> |
| | | |
| | | |
− | {| class="wikitable infobox"
| |
| | | |
| {| class="wikitable infobox" | | {| class="wikitable infobox" |
| | | |
− | { | class“ wikitable infobox” | + | { | class = “ wikitable infobox” |
| + | |
| + | Facebook's data team released two papers in November 2011 which document that amongst all Facebook users at the time of research (721 million users with 69 billion friendship links) there is an average distance of 4.74.<ref name=SDS-T-01>{{cite news|url=https://www.telegraph.co.uk/technology/facebook/8906693/Facebook-cuts-six-degrees-of-separation-to-four.html|title=Facebook cuts six degrees of separation to four|work=Telegraph|accessdate=7 May 2012|first=Emma|last=Barnett|date=22 November 2011}}</ref><ref name="facebook2016" /> Probabilistic algorithms were applied on statistical metadata to verify the accuracy of the measurements.<ref>{{cite arXiv|eprint=1111.4570|title=Four Degrees of Separation|last=Backstrom|first=Lars |author2=Boldi, Paolo |author3=Rosa, Marco |author4=Ugander, Johan |author5=Vigna, Sebastiano|date=2011-11-19|class=cs.SI}}</ref> It was also found that 99.91% of Facebook users were interconnected, forming a large connected component.<ref>{{cite arXiv|eprint=1111.4503|title=The Anatomy of the Facebook Social Graph|last=Ugander|first=Johan|author2=Karrer, Brian |author3=Backstrom, Lars |author4= Marlow, Cameron |class=cs.SI|year=2011}}</ref> |
| | | |
| |- | | |- |
第381行: |
第377行: |
| |- | | |- |
| | | |
− | |-
| + | |
| | | |
| ! Year !! colspan="2"|Distance | | ! Year !! colspan="2"|Distance |
| | | |
− | ! Year !! colspan="2"|Distance | + | !一年!Colspan = “2” | 距离 |
| | | |
− | !一年!Colspan“2” | 距离
| + | {| class="wikitable infobox" |
| | | |
| |- | | |- |
第394行: |
第390行: |
| | | |
| |- | | |- |
− |
| |
− | | 2008 || {{bartable|5.28||20}}
| |
| | | |
| | 2008 || | | | 2008 || |
| | | |
| | 2008 || | | | 2008 || |
| + | |
| + | ! Year !! colspan="2"|Distance |
| | | |
| |- | | |- |
第406行: |
第402行: |
| | | |
| |- | | |- |
− |
| |
− | | 2011 || {{bartable|4.74||20}}
| |
| | | |
| | 2011 || | | | 2011 || |
| | | |
| | 2011 || | | | 2011 || |
| + | |
| + | | 2008 || {{bartable|5.28||20}} |
| | | |
| |- | | |- |
第418行: |
第414行: |
| | | |
| |- | | |- |
− |
| |
− | | 2016 || {{bartable|4.57||20}}
| |
| | | |
| | 2016 || | | | 2016 || |
| | | |
| | 2016 || | | | 2016 || |
| + | |
| + | | 2011 || {{bartable|4.74||20}} |
| | | |
| |- | | |- |
第430行: |
第426行: |
| | | |
| |- | | |- |
− |
| |
− | | colspan="3"|Distances as reported in Feb 2016 <ref name="facebook2016" /><ref>{{cite web|title=Facebook says there are only 3.57 degrees of separation|url=https://www.telegraph.co.uk/technology/2016/02/04/facebook-says-there-are-actually-357-degrees-of-separation/|accessdate=4 February 2016}}</ref>
| |
| | | |
| | colspan="3"|Distances as reported in Feb 2016 | | | colspan="3"|Distances as reported in Feb 2016 |
| | | |
− | | colspan“3” | 2016年2月报道的距离 | + | | colspan = “3” | rises as reported in Feb 2016 |
| + | |
| + | | 2016 || {{bartable|4.57||20}} |
| | | |
| |} | | |} |
| | | |
| |} | | |} |
| + | |
| + | |- |
| + | |
| + | Facebook reported that the distance had decreased to 4.57 in February 2016, when it had 1.6 billion users (about 22% of the world population). |
| + | |
| + | 据 Facebook 报道,2016年2月,这个数字降到了4.57,当时 Facebook 拥有16亿用户(约占世界人口的22%)。 |
| + | |
| + | | colspan="3"|Distances as reported in Feb 2016 <ref name="facebook2016" /><ref>{{cite web|title=Facebook says there are only 3.57 degrees of separation|url=https://www.telegraph.co.uk/technology/2016/02/04/facebook-says-there-are-actually-357-degrees-of-separation/|accessdate=4 February 2016}}</ref> |
| | | |
| |} | | |} |
第445行: |
第449行: |
| Facebook reported that the distance had decreased to 4.57 in February 2016, when it had 1.6 billion users (about 22% of the world population).<ref name="facebook2016">{{cite web|title=Three and a half degrees of separation – Facebook Research|url=https://research.fb.com/three-and-a-half-degrees-of-separation/|accessdate=9 July 2017}}</ref> | | Facebook reported that the distance had decreased to 4.57 in February 2016, when it had 1.6 billion users (about 22% of the world population).<ref name="facebook2016">{{cite web|title=Three and a half degrees of separation – Facebook Research|url=https://research.fb.com/three-and-a-half-degrees-of-separation/|accessdate=9 July 2017}}</ref> |
| | | |
− | Facebook reported that the distance had decreased to 4.57 in February 2016, when it had 1.6 billion users (about 22% of the world population).
| + | The LinkedIn professional networking site operates the degree of separation one is away from a person with which he or she wishes to communicate. On LinkedIn, one's network is made up of 1st-degree, 2nd-degree, and 3rd-degree connections and fellow members of LinkedIn Groups. In addition, LinkedIn notifies the user how many connections they and any other user have in common. |
| | | |
− | 据 Facebook 报道,到2016年2月,距离已经缩小到4.57,当时它拥有16亿用户(约占世界人口的22%)。
| + | LinkedIn 专业社交网站操作的是一个人与他或她希望与之交流的人之间的分离程度。在 LinkedIn 上,一个人的社交网络由第一学位、第二学位和第三学位的联系人和 LinkedIn 群组的成员组成。此外,LinkedIn 还会通知用户他们和其他用户有多少共同的连接。 |
| | | |
| | | |
第455行: |
第459行: |
| The [[LinkedIn]] professional networking site operates the degree of separation one is away from a person with which he or she wishes to communicate. On [[LinkedIn]], one's network is made up of 1st-degree, 2nd-degree, and 3rd-degree connections and fellow members of LinkedIn Groups. In addition, LinkedIn notifies the user how many connections they and any other user have in common. | | The [[LinkedIn]] professional networking site operates the degree of separation one is away from a person with which he or she wishes to communicate. On [[LinkedIn]], one's network is made up of 1st-degree, 2nd-degree, and 3rd-degree connections and fellow members of LinkedIn Groups. In addition, LinkedIn notifies the user how many connections they and any other user have in common. |
| | | |
− | The LinkedIn professional networking site operates the degree of separation one is away from a person with which he or she wishes to communicate. On LinkedIn, one's network is made up of 1st-degree, 2nd-degree, and 3rd-degree connections and fellow members of LinkedIn Groups. In addition, LinkedIn notifies the user how many connections they and any other user have in common.
| + | SixDegrees.com was an early social-networking website that existed from 1997 to 2001. It allowed users to list friends, family members and acquaintances, send messages and post bulletin board items to people in their first, second, and third degrees, and see their connection to any other user on the site. At its height, it had 3,500,000 fully registered members. However, it was closed in 2000. |
| | | |
− | Linkedin 专业社交网站操作的分离程度是,一个人远离他或她希望与之交流的人。在 LinkedIn 上,一个人的社交网络由第一学位、第二学位和第三学位的联系人和 LinkedIn 群组的成员组成。此外,LinkedIn 还会通知用户他们和其他用户有多少共同的连接。
| + | SixDegrees.com 是一个早期的社交网站,从1997年到2001年一直存在。它允许用户列出朋友、家庭成员和熟人,发送消息和贴布告栏的项目给他们的第一个、第二个和第三个学位的人,并查看他们与网站上任何其他用户的联系。在其鼎盛时期,它有350万正式注册会员。然而,它在2000年关闭了。 |
| | | |
| | | |
第465行: |
第469行: |
| [[SixDegrees.com]] was an early social-networking website that existed from 1997 to 2001. It allowed users to list friends, family members and acquaintances, send messages and post bulletin board items to people in their first, second, and third degrees, and see their connection to any other user on the site. At its height, it had 3,500,000 fully registered members.<ref>{{cite book |last1=Kirkpatrick |first1=David |title=The Facebook Effect: The Inside Story of the Company That Is Connecting the World | publisher = Simon & Schuster | | [[SixDegrees.com]] was an early social-networking website that existed from 1997 to 2001. It allowed users to list friends, family members and acquaintances, send messages and post bulletin board items to people in their first, second, and third degrees, and see their connection to any other user on the site. At its height, it had 3,500,000 fully registered members.<ref>{{cite book |last1=Kirkpatrick |first1=David |title=The Facebook Effect: The Inside Story of the Company That Is Connecting the World | publisher = Simon & Schuster |
| | | |
− | SixDegrees.com was an early social-networking website that existed from 1997 to 2001. It allowed users to list friends, family members and acquaintances, send messages and post bulletin board items to people in their first, second, and third degrees, and see their connection to any other user on the site. At its height, it had 3,500,000 fully registered members.<ref>{{cite book |last1=Kirkpatrick |first1=David |title=The Facebook Effect: The Inside Story of the Company That Is Connecting the World | publisher = Simon & Schuster
| + | | year = 2010 | isbn = 978-1439102121 |title-link=The Facebook Effect }}</ref> However, it was closed in 2000. |
| | | |
− | Sixdegrees.com 是一个早期的社交网站,从1997年到2001年一直存在。它允许用户列出朋友、家庭成员和熟人,发送消息和张贴公告栏条目给第一、第二和第三级别的用户,并查看他们与网站上任何其他用户的联系。在其鼎盛时期,它有350万正式注册会员。 1 David | title The Facebook Effect: The Inside Story of The Company That Is Connecting The World | publisher 西蒙与舒斯特
| + | Users on Twitter can follow other users creating a network. According to a study of 5.2 billion such relationships by social media monitoring firm Sysomos, the average distance on Twitter is 4.67. On average, about 50% of people on Twitter are only four steps away from each other, while nearly everyone is five steps or less away. |
| | | |
− | | year = 2010 | isbn = 978-1439102121 |title-link=The Facebook Effect }}</ref> However, it was closed in 2000.
| + | 在 Twitter 上的用户可以关注其他用户创建的网络。根据社交媒体监测公司 Sysomos 对52亿这样的关系的研究,Twitter 上的平均距离是4.67。平均来说,大约50% 的人在 Twitter 上只有4步之遥,而几乎每个人都是5步或更少。 |
| | | |
− | | year = 2010 | isbn = 978-1439102121 |title-link=The Facebook Effect }}</ref> However, it was closed in 2000.
| + | <ref>{{cite journal|last1=boyd|first1=d. m|last2=Ellison|first2=N. B|title=Social network sites: Definition, history, and scholarship.|journal=Computer-Mediated|volume=13 | issue = 1 |pages=210–230|doi=10.1111/j.1083-6101.2007.00393.x|year=2007|doi-access=free}}</ref> |
| | | |
− | 然而,它在2000年就关闭了。
| |
| | | |
− | <ref>{{cite journal|last1=boyd|first1=d. m|last2=Ellison|first2=N. B|title=Social network sites: Definition, history, and scholarship.|journal=Computer-Mediated|volume=13 | issue = 1 |pages=210–230|doi=10.1111/j.1083-6101.2007.00393.x|year=2007|doi-access=free}}</ref>
| |
| | | |
| + | In another work, researchers have shown that the average distance of 1,500 random users in Twitter is 3.435. They calculated the distance between each pair of users using all the active users in Twitter. |
| | | |
| + | 在另一项研究中,研究人员发现1500个 Twitter 随机用户的平均距离是3.435。他们利用 Twitter 上所有活跃用户计算出每对用户之间的距离。 |
| | | |
| ==== Twitter ==== | | ==== Twitter ==== |
第483行: |
第487行: |
| Users on Twitter can follow other users creating a network. According to a study of 5.2 billion such relationships by social media monitoring firm [[Sysomos]], the average distance on Twitter is 4.67. On average, about 50% of people on Twitter are only four steps away from each other, while nearly everyone is five steps or less away.<ref>Apr 30, 2010, [http://www.sysomos.com/insidetwitter/sixdegrees/ Six Degrees of Separation, Twitter Style], from [[Sysomos]].</ref> | | Users on Twitter can follow other users creating a network. According to a study of 5.2 billion such relationships by social media monitoring firm [[Sysomos]], the average distance on Twitter is 4.67. On average, about 50% of people on Twitter are only four steps away from each other, while nearly everyone is five steps or less away.<ref>Apr 30, 2010, [http://www.sysomos.com/insidetwitter/sixdegrees/ Six Degrees of Separation, Twitter Style], from [[Sysomos]].</ref> |
| | | |
− | Users on Twitter can follow other users creating a network. According to a study of 5.2 billion such relationships by social media monitoring firm Sysomos, the average distance on Twitter is 4.67. On average, about 50% of people on Twitter are only four steps away from each other, while nearly everyone is five steps or less away.
| |
| | | |
− | 在 Twitter 上的用户可以关注其他用户创建的网络。根据社交媒体监测公司 Sysomos 对52亿这样的关系的研究,Twitter 上的平均距离是4.67。平均来说,大约50% 的人在 Twitter 上只有4步之遥,而几乎每个人都是5步或更少。
| |
| | | |
| + | Mathematicians use an analogous notion of collaboration distance: two persons are linked if they are coauthors of an article. The collaboration distance with mathematician Paul Erdős is called the Erdős number. Erdős-Bacon numbers and Erdős-Bacon-Sabbath (EBS) numbers are further extensions of the same thinking. |
| | | |
| + | 数学家们使用了一个类似的合作距离的概念: 如果两个人是一篇文章的合著者,那么他们就是连在一起的。与数学家保罗 · 尔德的合作距离称为尔德数。Erd s-bacon 数字和 erd s-bacon-sabbath (EBS)数字是同一思想的进一步延伸。 |
| | | |
| In another work, researchers have shown that the average distance of 1,500 random users in Twitter is 3.435. They calculated the distance between each pair of users using all the active users in Twitter.<ref name=bakhsh>Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer ''[http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4031 Degrees of Separation in Social Networks.]'' Fourth Annual Symposium on Combinatorial Search, 2011</ref> | | In another work, researchers have shown that the average distance of 1,500 random users in Twitter is 3.435. They calculated the distance between each pair of users using all the active users in Twitter.<ref name=bakhsh>Reza Bakhshandeh, Mehdi Samadi, Zohreh Azimifar, Jonathan Schaeffer ''[http://www.aaai.org/ocs/index.php/SOCS/SOCS11/paper/view/4031 Degrees of Separation in Social Networks.]'' Fourth Annual Symposium on Combinatorial Search, 2011</ref> |
| | | |
− | In another work, researchers have shown that the average distance of 1,500 random users in Twitter is 3.435. They calculated the distance between each pair of users using all the active users in Twitter.
| |
| | | |
− | 在另一项研究中,研究人员发现1500个 Twitter 随机用户的平均距离是3.435。他们利用 Twitter 上所有活跃用户计算出每对用户之间的距离。
| |
| | | |
| + | Watts and Strogatz showed that the average path length between two nodes in a random network is equal to , where = total nodes and = acquaintances per node. Thus if |
| | | |
| + | Watts 和 Strogatz 证明了随机网络中两个节点之间的平均路径长度等于,其中 = 节点总数和每个节点的熟人数。因此,如果 |
| | | |
| ==Mathematics== | | ==Mathematics== |
| + | |
| + | = 300,000,000 (90% of the US population) and = 30 then Degrees of Separation = 19.5 / 3.4 = 5.7 and if = 6,000,000,000 (90% of the World population) and = 30 then Degrees of Separation = 22.5 / 3.4 = 6.6. |
| + | |
| + | = 300,000,000(美国人口的90%)和 = 30分离度 = 19.5/3.4 = 5.7,如果 = 6,000,000,000(世界人口的90%)和 = 30分离度 = 22.5/3.4 = 6.6。 |
| | | |
| Mathematicians use an analogous notion of ''[[collaboration distance]]'':<ref>{{cite web|url=http://www.ams.org/mathscinet/collaborationDistance.html|title=MR: Collaboration Distance|work=ams.org}}</ref> two persons are linked if they are coauthors of an article. The collaboration distance with mathematician Paul Erdős is called the [[Erdős number]]. [[Erdős-Bacon number]]s and Erdős-Bacon-Sabbath (EBS) numbers<ref>{{cite web|url=http://erdosbaconsabbath.com/|title=EBS Project|work=erdosbaconsabbath.com|url-status=dead|archiveurl=https://web.archive.org/web/20170724075829/http://erdosbaconsabbath.com/|archivedate=2017-07-24}}</ref> are further extensions of the same thinking. | | Mathematicians use an analogous notion of ''[[collaboration distance]]'':<ref>{{cite web|url=http://www.ams.org/mathscinet/collaborationDistance.html|title=MR: Collaboration Distance|work=ams.org}}</ref> two persons are linked if they are coauthors of an article. The collaboration distance with mathematician Paul Erdős is called the [[Erdős number]]. [[Erdős-Bacon number]]s and Erdős-Bacon-Sabbath (EBS) numbers<ref>{{cite web|url=http://erdosbaconsabbath.com/|title=EBS Project|work=erdosbaconsabbath.com|url-status=dead|archiveurl=https://web.archive.org/web/20170724075829/http://erdosbaconsabbath.com/|archivedate=2017-07-24}}</ref> are further extensions of the same thinking. |
| | | |
− | Mathematicians use an analogous notion of collaboration distance: two persons are linked if they are coauthors of an article. The collaboration distance with mathematician Paul Erdős is called the Erdős number. Erdős-Bacon numbers and Erdős-Bacon-Sabbath (EBS) numbers are further extensions of the same thinking.
| + | (Assume 10% of population is too young to participate.) |
| | | |
− | 数学家们使用了一个类似的合作距离的概念: 如果两个人是一篇文章的合著者,那么他们就是联系在一起的。与数学家保罗 · 尔德的合作距离称为尔德数。Erd s-bacon 数字和 erd s-bacon-sabbath (EBS)数字是同一思想的进一步延伸。
| + | (假设10% 的人口年龄太小不能参与。) |
| | | |
| | | |
| | | |
| [[Watts and Strogatz model|Watts and Strogatz]] showed that the average path length between two nodes in a [[random network]] is equal to {{math|ln ''N'' / ln ''K''}}, where {{math|''N''}} = total nodes and {{math|''K''}} = acquaintances per node. Thus if | | [[Watts and Strogatz model|Watts and Strogatz]] showed that the average path length between two nodes in a [[random network]] is equal to {{math|ln ''N'' / ln ''K''}}, where {{math|''N''}} = total nodes and {{math|''K''}} = acquaintances per node. Thus if |
− |
| |
− | Watts and Strogatz showed that the average path length between two nodes in a random network is equal to , where = total nodes and = acquaintances per node. Thus if
| |
− |
| |
− | Watts 和 Strogatz 指出,在一个随机网络中,两个节点之间的平均路径长度等于,其中每个节点的总节点数和熟人数。因此,如果
| |
| | | |
| {{math|''N''}} = 300,000,000 (90% of the US population) and {{math|''K''}} = 30 then ''Degrees of Separation'' = 19.5 / 3.4 = 5.7 and if {{math|''N''}} = 6,000,000,000 (90% of the World population) and {{math|''K''}} = 30 then ''Degrees of Separation'' = 22.5 / 3.4 = 6.6. | | {{math|''N''}} = 300,000,000 (90% of the US population) and {{math|''K''}} = 30 then ''Degrees of Separation'' = 19.5 / 3.4 = 5.7 and if {{math|''N''}} = 6,000,000,000 (90% of the World population) and {{math|''K''}} = 30 then ''Degrees of Separation'' = 22.5 / 3.4 = 6.6. |
| | | |
− | = 300,000,000 (90% of the US population) and = 30 then Degrees of Separation = 19.5 / 3.4 = 5.7 and if = 6,000,000,000 (90% of the World population) and = 30 then Degrees of Separation = 22.5 / 3.4 = 6.6.
| + | A 2007 article published in The Industrial-Organizational Psychologist, by Jesse S. Michel from Michigan State University, applied Stanley Milgram's small world phenomenon (i.e., “small world problem”) to the field of I-O psychology through co-author publication linkages. Following six criteria, Scott Highhouse (Bowling Green State University professor and fellow of the Society of Industrial and Organizational Psychology) was chosen as the target. Co-author publication linkages were determined for (1) top authors within the I-O community, (2) quasi-random faculty members of highly productive I-O programs in North America, and (3) publication trends of the target. Results suggest that the small world phenomenon is alive and well with mean linkages of 3.00 to top authors, mean linkages of 2.50 to quasi-random faculty members, and a relatively broad and non-repetitive set of co-author linkages for the target. The author then provided a series of implications and suggestions for future research. |
− | | |
− | 300,000,000(美国人口的90%)和30,000,000,000,000(美国人口的90%)和30,000,000,000,000(美国人口的90%)和30,000,000,000,000(美国人口的90%)和30,000,000,000(美国人口的90%) ,。
| |
| | | |
− | (Assume 10% of population is too young to participate.) | + | 2007年,密歇根州立大学的 Jesse s. Michel 在《工业-组织心理学家》上发表了一篇文章,将 Stanley Milgram 的小世界现象(即“小世界问题”)通过与合著者的联系应用到 I-O 心理学领域。根据6个标准,Scott Highhouse (鲍林格林州立大学教授,工业与组织心理学学会研究员)被选为目标。共同作者出版物的联系被确定为(1)在 I-O 社区的顶级作者,(2)准随机教师成员的高产 I-O 项目在北美,和(3)出版趋势的目标。研究结果表明,小世界现象仍然存在,平均作者联系数为3.00,平均作者联系数为2.50,与准随机教师成员的联系数为2.50。最后,作者对未来的研究提出了一系列的启示和建议。 |
| | | |
| (Assume 10% of population is too young to participate.) | | (Assume 10% of population is too young to participate.) |
− |
| |
− | (假设10% 的人口太年轻不能参与。)
| |
| | | |
| | | |
第530行: |
第530行: |
| | | |
| A 2007 article published in ''The Industrial-Organizational Psychologist'',<ref>[http://www.siop.org/tip/Oct07/Sheridan%20PDFs/452_029to035.pdf (Michel, 2007)]</ref> by Jesse S. Michel from Michigan State University, applied Stanley Milgram's small world phenomenon (i.e., “small world problem”) to the field of [[Industrial and organizational psychology|I-O psychology]] through co-author publication linkages. Following six criteria, Scott Highhouse (Bowling Green State University professor and fellow of the Society of Industrial and Organizational Psychology) was chosen as the target. Co-author publication linkages were determined for (1) top authors within the I-O community, (2) quasi-random faculty members of highly productive I-O programs in North America, and (3) publication trends of the target. Results suggest that the small world phenomenon is alive and well with mean linkages of 3.00 to top authors, mean linkages of 2.50 to quasi-random faculty members, and a relatively broad and non-repetitive set of co-author linkages for the target. The author then provided a series of implications and suggestions for future research. | | A 2007 article published in ''The Industrial-Organizational Psychologist'',<ref>[http://www.siop.org/tip/Oct07/Sheridan%20PDFs/452_029to035.pdf (Michel, 2007)]</ref> by Jesse S. Michel from Michigan State University, applied Stanley Milgram's small world phenomenon (i.e., “small world problem”) to the field of [[Industrial and organizational psychology|I-O psychology]] through co-author publication linkages. Following six criteria, Scott Highhouse (Bowling Green State University professor and fellow of the Society of Industrial and Organizational Psychology) was chosen as the target. Co-author publication linkages were determined for (1) top authors within the I-O community, (2) quasi-random faculty members of highly productive I-O programs in North America, and (3) publication trends of the target. Results suggest that the small world phenomenon is alive and well with mean linkages of 3.00 to top authors, mean linkages of 2.50 to quasi-random faculty members, and a relatively broad and non-repetitive set of co-author linkages for the target. The author then provided a series of implications and suggestions for future research. |
− |
| |
− | A 2007 article published in The Industrial-Organizational Psychologist, by Jesse S. Michel from Michigan State University, applied Stanley Milgram's small world phenomenon (i.e., “small world problem”) to the field of I-O psychology through co-author publication linkages. Following six criteria, Scott Highhouse (Bowling Green State University professor and fellow of the Society of Industrial and Organizational Psychology) was chosen as the target. Co-author publication linkages were determined for (1) top authors within the I-O community, (2) quasi-random faculty members of highly productive I-O programs in North America, and (3) publication trends of the target. Results suggest that the small world phenomenon is alive and well with mean linkages of 3.00 to top authors, mean linkages of 2.50 to quasi-random faculty members, and a relatively broad and non-repetitive set of co-author linkages for the target. The author then provided a series of implications and suggestions for future research.
| |
− |
| |
− | 2007年,密歇根州立大学的 Jesse s. Michel 在《工业-组织心理学家》上发表了一篇文章,将 Stanley Milgram 的小世界现象(即“小世界问题”)通过与合著者的联系应用到 I-O 心理学领域。根据6个标准,Scott Highhouse (鲍林格林州立大学的教授和工业与组织心理学的研究员)被选为目标。共同作者出版物的联系被确定为(1)在 I-O 社区的顶级作者,(2)准随机教师成员的高产 I-O 项目在北美,和(3)出版趋势的目标。研究结果表明,小世界现象仍然存在,平均作者联系数为3.00,平均作者联系数为2.50,与准随机教师成员的联系数为2.50。然后,作者对未来的研究提出了一系列的启示和建议。
| |
| | | |
| | | |
第603行: |
第599行: |
| *[http://whocanfindme.blogspot.com/ whocanfindme – the quest] – Off- and online contest based on the six degrees of separation principle | | *[http://whocanfindme.blogspot.com/ whocanfindme – the quest] – Off- and online contest based on the six degrees of separation principle |
| | | |
− | *[http://www.sixdegrees.org.au Six Degrees Campaign], a climate justice campaign initiated by Friends of the Earth Brisbane based on the principles of small world theory. | + | *[http://www.sixdegrees.org.au Six Degrees Campaign], a [[climate justice]] campaign initiated by Friends of the Earth Brisbane based on the principles of small world theory. |
| | | |
| *"[http://www.sciam.com/article.cfm?articleID=0001297C-C5F8-1F32-9AD380A84189F2D7 E-mail Study Corroborates Six Degrees of Separation]", a 2003 ''[[Scientific American]]'' article about a study conducted at [[Columbia University]]. | | *"[http://www.sciam.com/article.cfm?articleID=0001297C-C5F8-1F32-9AD380A84189F2D7 E-mail Study Corroborates Six Degrees of Separation]", a 2003 ''[[Scientific American]]'' article about a study conducted at [[Columbia University]]. |
第628行: |
第624行: |
| | | |
| *[http://www.6degreesofvincegill.com/ 6 Degrees of Music With Vince Gill] – The 6 degrees theory applied to music with [[Vince Gill]] at the Center | | *[http://www.6degreesofvincegill.com/ 6 Degrees of Music With Vince Gill] – The 6 degrees theory applied to music with [[Vince Gill]] at the Center |
− |
| |
− | {{Social networking}}
| |
− |
| |
− | {{Psychology}}
| |
− |
| |
− |
| |
− |
| |
− | [[Category:Social networks]]
| |
| | | |
| Category:Social networks | | Category:Social networks |
第641行: |
第629行: |
| 分类: 社交网络 | | 分类: 社交网络 |
| | | |
− | [[Category:Sociological theories]]
| + | {{Social networking}} |
| | | |
| Category:Sociological theories | | Category:Sociological theories |
第647行: |
第635行: |
| 范畴: 社会学理论 | | 范畴: 社会学理论 |
| | | |
| + | {{Psychology}} |
| | | |
| | | |
− | [[de:Kleine-Welt-Phänomen]]
| |
| | | |
| de:Kleine-Welt-Phänomen | | de:Kleine-Welt-Phänomen |