第1行: |
第1行: |
− | 此词条暂由彩云小译翻译,翻译字数共2620,未经人工整理和审校,带来阅读不便,请见谅。
| + | 此词条由韦溢翻译审校,未经专家审核,带来阅读不便,请见谅。 |
| | | |
| {{For|the 2012 song by [[The Script]]|Six Degrees of Separation (song)}} | | {{For|the 2012 song by [[The Script]]|Six Degrees of Separation (song)}} |
第7行: |
第7行: |
| {{redirect-distinguish6|Six degrees|Six degrees of freedom||Six degrees (disambiguation)}} | | {{redirect-distinguish6|Six degrees|Six degrees of freedom||Six degrees (disambiguation)}} |
| | | |
− | [[File:Arctic_food_web_degrees_of_separation.svg|thumb|250px|An arctic [[food web]] showing the number of degrees of separation of the animals from phyto-plankton – for example, capelin are 4 connections away from phyto-plankton]] | + | [[File:Arctic_food_web_degrees_of_separation.svg|thumb|250px|An arctic [[food web]] showing the number of degrees of separation of the animals from phyto-plankton – for example, capelin are 4 connections away from phyto-plankton|链接=Special:FilePath/Arctic_food_web_degrees_of_separation.svg]] |
| | | |
− | An arctic [[food web showing the number of degrees of separation of the animals from phyto-plankton – for example, capelin are 4 connections away from phyto-plankton]]
| + | '''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. |
| | | |
− | 北极[显示动物与植物浮游生物分离程度的食物网——例如,毛鳞鱼与植物浮游生物有4个联系]
| + | '''六度分隔理论(Six degrees of separation)'''是指所有的人平均有六个,或更少的社会关系,彼此之间的关系。也被称为6次握手规则。因此,一个 "朋友的朋友 "的声明链可以在最多六个步骤中把任何两个人联系起来。它最初是由Frigyes Karinthy在1929年提出的,并在John Guare于1990年创作的同名戏剧中得到推广。它有时被概括为平均社会距离是人口规模的对数。 |
| | | |
− | '''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 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年写的同名戏剧中流行开来。它有时被推广到平均社会距离是对数的人口大小。
| |
| | | |
| + | == 初期概念 == |
| | | |
| | | |
− | == Early conceptions ==
| |
| | | |
| + | === 缩小的世界 === |
| | | |
| + | Theories on optimal design of cities, city traffic flows, neighborhoods, and demographics were in vogue after [[World War I]]. These{{Citation needed|date=January 2010}}<!--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 [[Hungary|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{{snd}} in abstract, conceptual, and fictional terms{{snd}} many of the problems that would captivate future generations of mathematicians, sociologists, and physicists within the field of network theory.<ref name=newman>Newman, Mark, Albert-László Barabási, and Duncan J. Watts. 2006. ''The Structure and Dynamics of Networks.'' Princeton, NJ: Princeton University Press.</ref><ref name=bara/> Due to technological advances in communications and travel, friendship networks could grow larger and span greater distances. In particular, Karinthy believed that the modern world was 'shrinking' due to this ever-increasing connectedness of human beings. He posited that despite great physical distances between the globe's individuals, the growing density of human networks made the actual social distance far smaller.<ref name=":0">[https://djjr-courses.wdfiles.com/local--files/soc180%3Akarinthy-chain-links/Karinthy-Chain-Links_1929.pdf Karinthy, Frigyes. (1929) "Chain Links."]</ref> |
| | | |
− | === Shrinking world === | + | 关于城市的优化设计、城市交通流、邻里关系和人口统计学的理论在第一次世界大战后大行其道。这些猜想在1929年被匈牙利作家Frigyes Karinthy扩展,他出版了一卷短篇小说,题为《万物皆不同》。其中一篇题为 "链子",或 "链子"。这个故事以抽象、概念和虚构的方式研究了许多问题,这些问题将吸引未来几代网络理论领域的数学家、社会学家和物理学家。<ref name="newman" /><ref name="bara" />由于通信和旅行方面的技术进步,友谊网络可以变得更大,跨越更远的距离。特别是,卡林西认为,由于人类的这种不断增加的联系,现代世界正在 "缩小"。他认为,尽管全球个人之间有很大的物理距离,但人类网络的密度不断增加,使得实际的社会距离大大缩小。<ref name=":0" /> |
| | | |
− | Theories on optimal design of cities, city traffic flows, neighborhoods, and demographics were in vogue after [[World War I]]. These{{Citation needed|date=January 2010}}<!--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 [[Hungary|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{{snd}} in abstract, conceptual, and fictional terms{{snd}} many of the problems that would captivate future generations of mathematicians, sociologists, and physicists within the field of network theory.<ref name=newman>Newman, Mark, Albert-László Barabási, and Duncan J. Watts. 2006. ''The Structure and Dynamics of Networks.'' Princeton, NJ: Princeton University Press.</ref><ref name=bara/> Due to technological advances in communications and travel, friendship networks could grow larger and span greater distances. In particular, Karinthy believed that the modern world was 'shrinking' due to this ever-increasing connectedness of human beings. He posited that despite great physical distances between the globe's individuals, the growing density of human networks made the actual social distance far smaller.<ref>[https://djjr-courses.wdfiles.com/local--files/soc180%3Akarinthy-chain-links/Karinthy-Chain-Links_1929.pdf Karinthy, Frigyes. (1929) "Chain Links."]</ref>
| |
− |
| |
− | 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)的短篇小说集。其中一件作品的标题是“链条”或“链环”这个故事以抽象、概念和虚构的方式调查了许多问题,这些问题将在网络理论领域吸引未来几代数学家、社会学家和物理学家。
| |
| | | |
| | | |
第37行: |
第31行: |
| As a result of this hypothesis, Karinthy's characters believed that any two individuals could be connected through at most five acquaintances. In his story, the characters create a game out of this notion. He wrote: | | As a result of this hypothesis, Karinthy's characters believed that any two individuals could be connected through at most five acquaintances. In his story, the characters create a game out of this notion. He wrote: |
| | | |
− | As a result of this hypothesis, Karinthy's characters believed that any two individuals could be connected through at most five acquaintances. In his story, the characters create a game out of this notion. He wrote:
| + | 由于这一假设,卡林西的人物认为,任何两个人最多可以通过五个熟人联系起来。在他的故事中,人物从这个概念中创造了一个游戏。他写道 |
| | | |
− | 作为这个假设的结果,Karinthy 笔下的人物相信任何两个人最多可以通过五个熟人联系起来。在他的故事里,角色们根据这个概念创造了一个游戏。他写道:
| |
| | | |
| | | |
| | | |
| <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.<ref name=karinthy>Karinthy, Frigyes. ''Chain-Links.'' Translated from Hungarian and annotated by Adam Makkai and Enikö Jankó.</ref></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.<ref name=karinthy>Karinthy, Frigyes. ''Chain-Links.'' Translated from Hungarian and annotated by Adam Makkai and Enikö Jankó.</ref></blockquote> |
− | | + | 在这次讨论中产生了一个奇妙的游戏。我们中的一个人建议做以下实验,以证明地球上的人口现在比以前更接近。我们应该从地球上的15亿居民中选择任何一个人——任何人,在任何地方。他和我们打赌,用不超过五个人,其中一个是个人熟人,除了个人熟人网络外,他可以不使用任何东西与被选中的人取得联系<ref name="karinthy" /> 。 |
− | <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 >
| |
− | | |
− | | |
| | | |
| This idea both directly and indirectly influenced a great deal of early thought on [[social network]]s. Karinthy has been regarded as the originator of the notion of six degrees of separation.<ref name=bara>[http://www.nd.edu/~alb/ Barabási, Albert-László] {{webarchive|url=https://web.archive.org/web/20050304041427/http://www.nd.edu/~alb/ |date=2005-03-04 }}. 2003. ''[http://www.nd.edu/%7Enetworks/Linked/index.html Linked: How Everything is Connected to Everything Else and What It Means for Business, Science, and Everyday Life.] {{webarchive|url=https://web.archive.org/web/20070103151518/http://www.nd.edu/%7Enetworks/Linked/index.html |date=2007-01-03 }}'' New York: Plume.</ref> | | This idea both directly and indirectly influenced a great deal of early thought on [[social network]]s. Karinthy has been regarded as the originator of the notion of six degrees of separation.<ref name=bara>[http://www.nd.edu/~alb/ Barabási, Albert-László] {{webarchive|url=https://web.archive.org/web/20050304041427/http://www.nd.edu/~alb/ |date=2005-03-04 }}. 2003. ''[http://www.nd.edu/%7Enetworks/Linked/index.html Linked: How Everything is Connected to Everything Else and What It Means for Business, Science, and Everyday Life.] {{webarchive|url=https://web.archive.org/web/20070103151518/http://www.nd.edu/%7Enetworks/Linked/index.html |date=2007-01-03 }}'' New York: Plume.</ref> |
| | | |
− | This idea both directly and indirectly influenced a great deal of early thought on social networks. Karinthy has been regarded as the originator of the notion of six degrees of separation.
| + | 这一思想直接和间接地影响了大量早期的社会网络思想。卡林西被认为是 "六度分隔 "这一概念的提出者<ref name="bara" />。 |
− | | |
− | 这种观点直接或间接地影响了社交网络的早期思想。被认为是六度分隔理论概念的创始人。
| |
| | | |
| A related theory deals with the quality of connections, rather than their existence. The theory of [[three degrees of influence]] was created by Nicholas A. Christakis and James H. Fowler.{{Citation needed|date = July 2016}} | | A related theory deals with the quality of connections, rather than their existence. The theory of [[three degrees of influence]] was created by Nicholas A. Christakis and James H. Fowler.{{Citation needed|date = July 2016}} |
第61行: |
第47行: |
| A related theory deals with the quality of connections, rather than their existence. The theory of three degrees of influence was created by Nicholas A. Christakis and James H. Fowler. | | A related theory deals with the quality of connections, rather than their existence. The theory of three degrees of influence was created by Nicholas A. Christakis and James H. Fowler. |
| | | |
− | 一个相关的理论研究的是连接的质量,而不是它们的存在。三度影响理论是由尼古拉斯 · a · 克里斯塔基斯和詹姆斯 · h · 福勒创立的。
| + | 一个相关的理论涉及到连接的质量,而不是它们的存在。三度影响的理论是由尼古拉斯-A-克里斯塔基斯和詹姆斯-H-福勒创立的。 |
| | | |
| | | |
| | | |
− | === Small world === | + | === 小世界 === |
| | | |
| {{Main|Small-world experiment}} | | {{Main|Small-world experiment}} |
| | | |
− | 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]].<ref>Gurevich, M (1961) The Social Structure of Acquaintanceship Networks, Cambridge, MA: MIT Press</ref> Mathematician [[Manfred Kochen]], an Austrian who had been involved in urban design, extrapolated these empirical results in a mathematical manuscript, ''[[Contacts and Influences]]'',<ref>de Sola Pool, Ithiel, Kochen, Manfred (1978–1979)."Contacts and influence." ''Social Networks'' 1(1): 42</ref> 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 method|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]].{{Citation needed|date = July 2016}} | + | 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]].<ref name=":1">Gurevich, M (1961) The Social Structure of Acquaintanceship Networks, Cambridge, MA: MIT Press</ref> Mathematician [[Manfred Kochen]], an Austrian who had been involved in urban design, extrapolated these empirical results in a mathematical manuscript, ''[[Contacts and Influences]]'',<ref name=":2">de Sola Pool, Ithiel, Kochen, Manfred (1978–1979)."Contacts and influence." ''Social Networks'' 1(1): 42</ref> 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 method|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]].{{Citation needed|date = July 2016}} |
| | | |
− | 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年麻省理工学院伊瑟尔-德-索拉-波尔的博士论文中对社会网络结构进行了开创性的研究。<ref name=":1" />数学家曼弗雷德-科亨,一位从事城市设计的奥地利人,在一份数学手稿《接触和影响》中推断了这些经验结果,<ref name=":2" />结论是在一个没有社会结构的美国规模的人口中,"实际上可以肯定,任何两个人可以通过最多两个中间人的方式互相接触。在一个[社会]结构的人口中,这种可能性较小,但似乎仍有可能。而对于整个世界的人口来说,可能只需要多一个搭桥的个体"。他们随后根据古列维奇的数据构建了蒙特卡洛模拟,该模拟认识到弱的和强的熟人联系都需要建立社会结构模型。在1973年相对有限的计算机上进行的模拟,仍然能够预测美国人口中存在更现实的三度分隔,这预示着美国心理学家斯坦利-米尔格伦的发现。 |
| | | |
− | 1961年,迈克尔 · 古列维奇在麻省理工学院的 istiel de Sola Pool 博士论文中对社交网络的结构进行了实证研究。数学家 Manfred Kochen 是一位奥地利人,曾经参与城市设计,他将这些经验性的结果以数学手稿《联系与影响》的形式推断出,在一个没有社会结构的美国大规模人口中,“实际上可以肯定的是,任何两个个体至多可以通过两个中间人进行联系。在一个(社会)结构化的人群中,这种情况不太可能发生,但似乎仍然是可能的。或许对于全世界的人口而言,也许只需要再增加一个连接个体。”他们随后基于 Gurevich 的数据构建了蒙特卡罗模拟,该模拟认识到为社会结构建模既需要弱的熟人联系,也需要强的熟人联系。1973年在相对有限的计算机上进行的模拟,尽管如此,仍然能够预测在美国人口中存在更为现实的三度分离,这预示着美国心理学家斯坦利 · 米尔格拉姆的发现。
| |
| | | |
| | | |
| | | |
− | Milgram continued Gurevich's experiments in acquaintanceship networks at [[Harvard University]] in Cambridge, Massachusetts, U.S. Kochen and de Sola Pool's manuscript, ''Contacts and Influences'',<ref>de Sola Pool, Ithiel, Kochen, Manfred (1978–1979)."Contacts and Influence." ''Social Networks'' 1(1): 5–51</ref> was conceived while both were working at the [[University of Paris]] in the early 1950s, during a time when Milgram visited and collaborated in their research. Their unpublished manuscript circulated among academics for over 20 years before publication in 1978. It formally articulated the mechanics of social networks, and explored the mathematical consequences of these (including the degree of connectedness). The manuscript left many significant questions about networks unresolved, and one of these was the number of degrees of separation in actual social networks. Milgram took up the challenge on his return from [[Paris]], leading to the experiments reported in ''The Small World Problem'' <ref name="Stanley Milgram 1968">{{cite journal | last1 = Milgram | first1 = Stanley | year = 1967 | title = The Small World Problem | url = | journal = Psychology Today | volume = 2 | issue = | pages = 60–67 }}</ref> in popular science journal ''[[Psychology Today]]'', with a more rigorous version of the paper appearing in [[Social Psychology Quarterly|Sociometry]] two years later.<ref>Travers, Jeffrey, and Stanley Milgram, [http://www.cis.upenn.edu/~mkearns/teaching/NetworkedLife/travers_milgram.pdf "An Experimental Study of the Small World Problem"], Sociometry 32(4, Dec. 1969):425–443</ref> The ''Psychology Today'' article generated enormous publicity for the experiments, which are well known today, long after much of the formative work has been forgotten. | + | Milgram continued Gurevich's experiments in acquaintanceship networks at [[Harvard University]] in Cambridge, Massachusetts, U.S. Kochen and de Sola Pool's manuscript, ''Contacts and Influences'',<ref name=":3">de Sola Pool, Ithiel, Kochen, Manfred (1978–1979)."Contacts and Influence." ''Social Networks'' 1(1): 5–51</ref> was conceived while both were working at the [[University of Paris]] in the early 1950s, during a time when Milgram visited and collaborated in their research. Their unpublished manuscript circulated among academics for over 20 years before publication in 1978. It formally articulated the mechanics of social networks, and explored the mathematical consequences of these (including the degree of connectedness). The manuscript left many significant questions about networks unresolved, and one of these was the number of degrees of separation in actual social networks. Milgram took up the challenge on his return from [[Paris]], leading to the experiments reported in ''The Small World Problem'' <ref name="Stanley Milgram 1968">{{cite journal | last1 = Milgram | first1 = Stanley | year = 1967 | title = The Small World Problem | url = | journal = Psychology Today | volume = 2 | issue = | pages = 60–67 }}</ref> in popular science journal ''[[Psychology Today]]'', with a more rigorous version of the paper appearing in [[Social Psychology Quarterly|Sociometry]] two years later.<ref name=":4">Travers, Jeffrey, and Stanley Milgram, [http://www.cis.upenn.edu/~mkearns/teaching/NetworkedLife/travers_milgram.pdf "An Experimental Study of the Small World Problem"], Sociometry 32(4, Dec. 1969):425–443</ref> The ''Psychology Today'' article generated enormous publicity for the experiments, which are well known today, long after much of the formative work has been forgotten. |
| | | |
− | Milgram continued Gurevich's experiments in acquaintanceship networks at Harvard University in Cambridge, Massachusetts, U.S. Kochen and de Sola Pool's manuscript, Contacts and Influences, was conceived while both were working at the University of Paris in the early 1950s, during a time when Milgram visited and collaborated in their research. Their unpublished manuscript circulated among academics for over 20 years before publication in 1978. It formally articulated the mechanics of social networks, and explored the mathematical consequences of these (including the degree of connectedness). The manuscript left many significant questions about networks unresolved, and one of these was the number of degrees of separation in actual social networks. Milgram took up the challenge on his return from Paris, leading to the experiments reported in The Small World Problem in popular science journal Psychology Today, with a more rigorous version of the paper appearing in Sociometry two years later. The Psychology Today article generated enormous publicity for the experiments, which are well known today, long after much of the formative work has been forgotten.
| + | 米尔格拉姆在美国马萨诸塞州剑桥市的哈佛大学继续进行古雷维奇的熟人网络实验。科琴和德索拉-波尔的手稿《接触与影响》<ref name=":3" />是两人在20世纪50年代初在巴黎大学工作时构思的,当时米尔格拉姆访问并合作进行研究。他们未发表的手稿在学术界流传了20多年,然后于1978年出版。它正式阐明了社会网络的机制,并探讨了这些机制的数学后果(包括连接程度)。这份手稿留下了许多关于网络的重要问题没有解决,其中之一就是实际社会网络中的分离度数量。米尔格拉姆从巴黎回来后接受了这一挑战,导致在大众科学杂志《今日心理学》(Psychology Today)上的《小世界问题》(The Small World Problem)[8]中报道了这些实验,两年后在《社会测量学》(Sociometry)上出现了该论文更严格的版本。<ref name=":4" />《今日心理学》的文章为这些实验带来了巨大的宣传,在许多形成性工作被遗忘很久后,这些实验今天仍然广为人知。 |
| | | |
− | 继续 Gurevich 在马萨诸塞州剑桥市哈佛大学的相识网络中的实验,Kochen 和 de Sola Pool 的手稿,联系和影响,构思于20世纪50年代早期,当时两人都在巴黎大学工作,当时 Milgram 访问并合作进行他们的研究。他们未出版的手稿在学术界流传了20多年,直到1978年出版。它正式阐述了社会网络的机制,并探索了这些机制的数学结果(包括连通性的程度)。手稿留下了许多关于网络的重要问题没有解决,其中之一就是实际社会网络中的分离度数。从巴黎回来后,米尔格拉姆接受了这一挑战,并在《今日心理学》杂志上发表了《小世界问题》中的实验报告,两年后,这篇论文的更为严谨的版本在 Sociometry 发表。今日心理学》的文章为这些实验赢得了大量的宣传,这些实验在今天已经广为人知,尽管许多形成性的工作早已被遗忘。
| |
| | | |
| | | |
第87行: |
第71行: |
| Milgram's article made famous<ref name="Stanley Milgram 1968" /> his 1967 set of experiments to investigate de Sola Pool and Kochen's "small world problem." Mathematician [[Benoit Mandelbrot]], born in [[Warsaw]], growing up in [[Poland]] then [[France]], was aware of the Statist [[rule of thumb]], and was also a colleague of de Sola Pool, Kochen and Milgram at the University of Paris during the early 1950s (Kochen brought Mandelbrot to work at the Institute for Advanced Study and later IBM in the U.S.). This circle of researchers was fascinated by the interconnectedness and "social capital" of human networks. Milgram's study results showed that people in the [[United States]] seemed to be connected by approximately three friendship links, on average, without speculating on global linkages; he never actually used the term "six degrees of separation." Since the ''Psychology Today'' article gave the experiments wide publicity, Milgram, Kochen, and [[Karinthy]] all had been incorrectly attributed as the origin of the notion of six degrees; the most likely popularizer of the term "six degrees of separation" would be [[John Guare]], who attributed the value '6' to [[Guglielmo Marconi|Marconi]].<ref name=SDS-R-01>{{cite web |url=http://www.aaa.si.edu/exhibitions/peggy-bacon|title= The concept of Six degrees of separation stretches back to Italian inventor Guglielmo Marconi |accessdate=16 July 2012 }}</ref> | | Milgram's article made famous<ref name="Stanley Milgram 1968" /> his 1967 set of experiments to investigate de Sola Pool and Kochen's "small world problem." Mathematician [[Benoit Mandelbrot]], born in [[Warsaw]], growing up in [[Poland]] then [[France]], was aware of the Statist [[rule of thumb]], and was also a colleague of de Sola Pool, Kochen and Milgram at the University of Paris during the early 1950s (Kochen brought Mandelbrot to work at the Institute for Advanced Study and later IBM in the U.S.). This circle of researchers was fascinated by the interconnectedness and "social capital" of human networks. Milgram's study results showed that people in the [[United States]] seemed to be connected by approximately three friendship links, on average, without speculating on global linkages; he never actually used the term "six degrees of separation." Since the ''Psychology Today'' article gave the experiments wide publicity, Milgram, Kochen, and [[Karinthy]] all had been incorrectly attributed as the origin of the notion of six degrees; the most likely popularizer of the term "six degrees of separation" would be [[John Guare]], who attributed the value '6' to [[Guglielmo Marconi|Marconi]].<ref name=SDS-R-01>{{cite web |url=http://www.aaa.si.edu/exhibitions/peggy-bacon|title= The concept of Six degrees of separation stretches back to Italian inventor Guglielmo Marconi |accessdate=16 July 2012 }}</ref> |
| | | |
− | Milgram's article made famous | + | 米尔格拉姆的文章使他在1967年为研究德-索拉-波尔和科亨的 "小世界问题 "而进行的一组实验变得有名<ref name="Stanley Milgram 1968" />。数学家Benoit Mandelbrot出生于华沙,在波兰和法国长大,他知道统计学家的经验法则,也是de Sola Pool、Kochen和Milgram在50年代初在巴黎大学的同事(Kochen把Mandelbrot带到高级研究所和后来在美国的IBM工作)。这个研究圈子对人类网络的相互关联性和 "社会资本 "非常着迷。米尔格拉姆的研究结果显示,在美国,人们似乎平均有大约三个友谊联系,而没有推测全球联系;他实际上从未使用过 "六度分隔 "一词。由于《今日心理学》的文章对这些实验进行了广泛的宣传,米尔格拉姆、科亨和卡林西都被错误地归结为六度概念的起源;"六度分隔 "一词最有可能的普及者是约翰-瓜雷,他将 "6 "这个数值归结为马可尼<ref name="SDS-R-01" />。 |
− | | |
− | 米尔格拉姆的文章很出名
| |
− | | |
− | | |
| | | |
− | === Continued research: Small World Project ===
| |
| | | |
− | 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{{#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步就达到了目标。等人。“超过一半的参与者居住在北美,属于中产阶级、专业人士、受过大学教育的人和基督徒,这反映了人们对使用互联网人群的普遍看法。”
| + | === 继续研究:小世界项目 === |
| | | |
| + | 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">{{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> |
| | | |
| + | 2003年,哥伦比亚大学对互联网电子邮件用户的社会联系进行了类似的实验。他们的努力被命名为 "哥伦比亚小世界项目",包括24,163条电子邮件链,目标是13个国家的18个目标。<ref name="dodds" />几乎有10万人注册,但只有384人(0.4%)达到了最终目标。在成功的邮件链中,虽然长度较短的邮件链比较常见,但有些邮件链只经过7、8、9或10步就达到了目标。Dodds等人指出,参与者(他们都是志愿者)强烈地偏向于现有的互联网用户模式,基于职业关系的联系要比家庭或朋友关系中的联系强得多。作者指出,"缺乏兴趣 "是造成高流失率的主要因素,这一发现与早期研究一致。<ref name="kleinfeld" /> |
| | | |
− | == Research ==
| |
| | | |
− | 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.
| + | 然而,反对者认为,米尔格拉姆的实验并没有证明这种联系,而 "六度 "的说法也被斥为 "学术界的城市神话"。此外,孤立的人类群体的存在,例如科鲁博人和其他巴西本地人口,将倾向于使对该假设的最严格解释失效。 |
| | | |
− | 然而,批评者认为,米尔格拉姆的实验并没有证明这种联系,“六度”的说法被斥为“学术上的都市神话”。此外,孤立的人类群体的存在,例如科鲁博人和其他巴西本地人,将倾向于使对假说的最严格的解释失效。
| |
| | | |
− | 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>
| + | 一些研究,如Milgram的小世界实验,已经被用来实证测量这种联系性。"六度分隔 "这一短语经常被用作 "小世界 "现象这一概念的同义词。 |
| | | |
| | | |
| | | |
− | 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.
| + | == 研究 == |
| | | |
− | 2001年,哥伦比亚大学(Columbia University)教授邓肯•沃茨(Duncan Watts)试图在互联网上重现米尔格拉姆的实验,他使用一封电子邮件作为需要投递的“包裹” ,共有4.8万个发件人和19个目标(分布在157个国家)。Watts 发现,中间商的平均数量(虽然不是最大数量)约为6个。
| + | ===计算机网络=== |
| | | |
| + | 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 name=":5">{{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> |
| | | |
| + | 2001年,哥伦比亚大学的教授邓肯-瓦茨(Duncan Watts)试图在互联网上重现米尔格拉姆的实验,用电子邮件作为需要传递的 "包裹",有48000个发送者和19个目标(在157个国家)。瓦特发现,中间人的平均数(虽然不是最大值)大约是6个。<ref name=":5" /> |
| | | |
− | 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.
| |
| | | |
− | 2007年,Jure Leskovec 和 Eric Horvitz 进行了一项研究,调查了2.4亿人的300亿次对话,组成了一个即时消息数据集。他们发现微软信使用户的平均路径长度为6。
| |
| | | |
− | ===Computer networks=== | + | 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 name=":6">{{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>It has been suggested by some commentators<ref name=":7">{{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. |
| | | |
− | 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>
| + | Jure Leskovec和Eric Horvitz在2007年的一项研究中检查了一个由2.4亿人之间的300亿次对话组成的即时信息数据集。他们发现微软Messenger用户的平均路径长度为6<ref name=":6" />。一些评论家<ref name=":7" />提出,以计算机为媒介的横向交流的连锁网络可以按照6度分隔原则,通过信息路由组(Information Routing Groups)向全世界所有感兴趣的用户扩散单一信息,信息路由组是专门为利用这一原则和横向扩散而设计的网络。 |
| | | |
− | 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.
| |
| | | |
− | 一些评论者建议,计算机中介的横向通信联锁网络可以按照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>
| + | '''计算社会网络中分离度的最佳算法''' |
| | | |
| + | Bakhshandeh et al.<ref name=":8">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. |
| | | |
| + | Bakhshandeh等人<ref name=":8" />解决了识别Twitter等社交网络中两个用户之间的分离度的搜索问题。他们引入了新的搜索技术来提供最优或接近最优的解决方案。实验是使用Twitter进行的,他们显示出比贪婪的方法有几个数量级的改进。他们的最优算法在两个随机的Twitter用户之间找到了3.43的平均分离度,平均只需要通过互联网向Twitter提出67次信息请求。通过平均13.3次请求,可以找到一个长度为3.88的近乎最佳的解决方案。 |
| | | |
− | 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.
| |
− |
| |
− | 巴赫尚德等人。已经解决了在 Twitter 这样的社交网络中识别两个用户之间的分离程度的搜索问题。他们引进了新的搜索技术来提供最优或接近最优的解决方案。这些实验是在 Twitter 上进行的,它们显示了一些比贪婪方法更好的数量级。他们的最佳算法发现,两个随机 Twitter 用户之间的平均分离度为3.43,平均只需要67个通过互联网向 Twitter 发送信息的请求。通过平均发出13.3个请求,可以找到长度为3.88的近似最优解。
| |
− |
| |
− |
| |
− |
| |
− | ===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.
| |
| | | |
| 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. |
第155行: |
第121行: |
| | | |
| | | |
− | == 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.
| |
− | | |
− | | |
− | | |
− | ===Popularization of offline practice===
| |
− | | |
− | | |
− | | |
− | 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年发行了一部电影使其流行起来; 这是瓜尔最广为人知的作品。这出戏反复思考任何两个人至多由五个其他人联系在一起的想法。正如其中一个角色所说:
| + | ===.线下实践普及=== |
| | | |
− | ====John Guare's ''Six Degrees of Separation''==== | + | ====约翰·瓜尔的《六度分隔》==== |
| + | 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: |
| | | |
− | {{Main|Six Degrees of Separation (play)|Six Degrees of Separation (film)}}
| + | 美国剧作家约翰-瓜尔(John Guare)在1990年写了一出戏,并在1993年发行了一部电影,将其推广开来;这是瓜尔最广为人知的作品。该剧反思了这样一个观点:任何两个人最多被另外五个人联系起来。正如其中一个人物所说。 |
| | | |
− | <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 |
| | | |
− | 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:
| + | 我在某个地方读到,这个星球上的每个人都只与其他六个人相隔。我们和这个星球上的其他人之间有六度的距离。美国总统,威尼斯的一个贡多拉人,只要填上名字就可以了。我把它命名为A)我们如此接近,让人感到非常欣慰;并且命名为B)我们如此接近,就像中国的水刑,因为你必须找到合适的六个人,才能建立正确的联系... 我和这个星球上的每一个人都是由六个人的足迹联系在一起的。 |
| | | |
− | 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)我们如此亲密就像中国的水刑,因为你必须找到合适的六个人来建立正确的联系... ..。我和这个星球上的每一个人都有联系,只有六个人。
| |
− |
| |
− |
| |
− |
| |
− | </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. 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. |
| | | |
− | 在采访中,瓜雷将他对“六度”的意识归因于马可尼。虽然这个想法已经以各种形式流传了几十年,但是这是 Guare 的作品,它最有责任推广短语“六度分隔理论”在 Guare 的带领下,许多未来的电视和电影资源后来将把这个概念纳入他们的故事。
| + | 瓜尔在接受采访时,将他对 "六度 "的认识归功于马可尼。尽管这个想法已经以各种形式流传了几十年,但对普及 "六度分隔 "这一短语负有最大责任的还是瓜尔的作品。在瓜尔的带领下,许多未来的电视和电影资料后来都将这个概念纳入他们的故事中。 |
− | | |
− | </blockquote>
| |
− | | |
− | | |
− | | |
− | 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 · 艾布拉姆斯,电视连续剧《六度》和《迷失》的执行制片人,在这部改编剧本的电影中扮演道格的角色。该剧的许多主题在他的电视节目中都很明显。
| |
− | | |
− | 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}}
| |
− | | |
| | | |
| | | |
− | [[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}} | + | [[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. Many of the play's themes are apparent in his television shows (see below). |
| | | |
| 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. |
| | | |
− | 《凯文 · 培根的六度》这个游戏是根据这个概念发明的: 目标是通过不超过六个连接将任何一个演员与凯文 · 培根联系起来,如果两个演员一起出现在电影或商业广告中,他们就会被连接起来。它是由宾夕法尼亚州奥尔布赖特学院的三个学生在观看《浑身是劲》时想出来的。2012年9月13日,谷歌通过他们的搜索引擎搜索任何特定演员的培根号码。
| + | J电视剧《六度空间》和《迷失》的执行制片人J.J.艾布拉姆斯在本剧改编的电影中扮演了道格一角。该剧的许多主题在他的电视节目中都很明显(见下文)。 |
| | | |
| + | 游戏 "凯文-培根的六度 "是作为一个概念的游戏而发明的:目标是通过不超过六种联系将任何演员与凯文-培根联系起来,其中两个演员如果一起出现在电影或广告中就会被联系起来。它是由宾夕法尼亚州奥尔布赖特学院的三名学生创造的,他们在观看《Footloose》时想出了这个概念。2012年9月13日,谷歌使通过其搜索引擎搜索任何特定演员的 "培根号码 "成为可能。 |
| | | |
| | | |
− | ====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 移动网络在英国的到来,Kevin Bacon 出现在 EE Network 的几个商业广告中,他把自己和英国几个著名的名人和电视节目联系起来。
| + | 在英国的4G移动网络到来后,凯文-培根出现在EE网络的几个广告中,在广告中他将自己与英国几个知名的名人和电视节目联系起来。 |
− | | |
− | 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>
| |
− | | |
− | | |
− | | |
− | 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.'"
| |
− | | |
− | 早期的一个版本涉及前世界重量级拳击冠军约翰 · 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>
| |
| | | |
| | | |
| + | The game "[[Six Degrees of Kevin Bacon]]"<ref name="Futon Critic 07-13-15">{{cite web|last1=staff|title=SIX DEGREES OF EVERYTHING (TRUTV) Premieres Tuesday, August 18|url=http://www.thefutoncritic.com/devwatch/six-degrees-of-everything/|accessdate=August 12, 2015|website=[[Futon Critic]]|date=July 13, 2015}}</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, 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. |
| | | |
− | ===In popular culture=== | + | 游戏 "凯文-培根六度"<ref name="Futon Critic 07-13-15" />是作为对这一概念的发挥而发明的:目标是通过不超过六种联系将任何演员与凯文-培根联系起来,其中两个演员如果一起出现在电影或广告中就会被联系起来。它是由宾夕法尼亚州奥尔布赖特学院的三名学生创造的,<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>他们在观看《Footloose》时想出了这个概念。2012年9月13日,谷歌使通过他们的搜索引擎搜索任何特定演员的 "培根号码 "成为可能<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>。 |
| | | |
− | ====Films====
| |
| | | |
− | * The Oscar-winning film ''[[Babel (film)|Babel]]'' is based on the concept of Six Degrees of Separation. The lives of all of the characters were intimately intertwined, although they did not know each other and lived thousands of miles from each other.
| |
| | | |
− | * ''[[Six Degrees of Separation (film)|Six Degrees of Separation]]'' is a 1993 drama film featuring [[Will Smith]], [[Donald Sutherland]], and [[Stockard Channing]].
| |
| | | |
| + | ====约翰·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.'"<ref name=":9">{{cite web|url=http://abc.go.com/primetime/sixdegrees/index.html|title=ABC TV Shows, Specials & Movies - ABC.com|work=ABC}}</ref> |
| | | |
− | ====Games==== | + | 早期的版本涉及前世界重量级拳击冠军约翰-L-沙利文,人们会要求其他人 "与握过'伟大的约翰-L'的手的人握手"。<ref name=":9" /> |
| | | |
− | * One of the achievements in the video game ''[[Brütal Legend]]'' is called "Six Degrees of Schafer," after the concept and [[Tim Schafer]], who was presumably in the handful of players to have the achievement as of the game's release. A player can only obtain this achievement by playing online with someone who already has it, further paralleling it to the concept.
| |
| | | |
− | *One of the merits in the video game [[Torn (online text game)|Torn City]] is called “domino.” The merit requires you to attack a person online who already has the merit.
| |
| | | |
| | | |
| + | ===在流行文化中=== |
| | | |
− | ====Literature==== | + | ====电影==== |
| | | |
− | *''[[Joined-Up Thinking]]'' and ''[[Connectoscope]]'' by [[Stevyn Colgan]] are trivia books based upon the idea of "Six Degrees" of information; that everything is connected. | + | * · The Oscar-winning film [[Babel (film)|''Babel'']] is based on the concept of Six Degrees of Separation. The lives of all of the characters were intimately intertwined, although they did not know each other and lived thousands of miles from each other. · 奥斯卡获奖影片《巴别塔》是基于 "六度分隔 "的概念。所有人物的生活都紧密地交织在一起,尽管他们互不相识,而且彼此生活在千里之外。 · [[Six Degrees of Separation (film)|''Six Degrees of Separation'']] is a 1993 drama film featuring [[Will Smith]], [[Donald Sutherland]], and [[Stockard Channing]]. · 《六度分隔》是一部1993年的剧情片,由威尔·史密斯、唐纳德·萨瑟兰和斯托克德·钱宁主演。 |
| | | |
| | | |
| | | |
− | ====Music==== | + | ====游戏==== |
| | | |
− | * The [[No Doubt]] song "Full Circle" has a central theme dealing with six degrees of separation. | + | * · One of the achievements in the video game ''[[Brütal Legend]]'' is called "Six Degrees of Schafer," after the concept and [[Tim Schafer]], who was presumably in the handful of players to have the achievement as of the game's release. A player can only obtain this achievement by playing online with someone who already has it, further paralleling it to the concept. · 电子游戏《Brütal Legend》中的一项成就被称为 "Six Degrees of Schafer",是以这个概念和Tim Schafer命名的,他大概是在游戏发布时拥有该成就的少数玩家中的一员。玩家只能通过与已经拥有该成就的人进行在线游戏来获得该成就,进一步将其与该概念相提并论。 · One of the merits in the video game [[Torn (online text game)|Torn City]] is called “domino.” The merit requires you to attack a person online who already has the merit. · 电子游戏《撕裂的城市》中的一项成就被称为 "多米诺"。该成就要求你在网上攻击一个已经拥有该成就的人。 |
| | | |
− | * "[[The Weight of These Wings|Six Degrees of Separation]]" is the 10th track on the second disc ''[[The Weight of These Wings|The Heart]]'' of the 2016 double album ''[[The Weight of These Wings]]'' by American country artist [[Miranda Lambert]]. It is the 22nd track overall.
| |
| | | |
− | * "[[Six Degrees of Separation (song)|Six Degrees of Separation]]" is the 2nd track on [[The Script]]'s third album, ''[[The Script#2012–present: #3|#3]]''.
| |
| | | |
− | * "Six Degrees" is the sixth track on [[Scouting for Girls]]' album, ''[[The Light Between Us]]''.
| + | ====文学==== |
| | | |
− | * ''[[Six Degrees of Inner Turbulence]]'' is a 2002 album by progressive rock band [[Dream Theater]]. | + | *· Joined-Up Thinking and Connectoscope by Stevyn Colgan are trivia books based upon the idea of "Six Degrees" of information; that everything is connected. 斯蒂文-科尔根(Stevyn Colgan)的《联合思考》(Join-Up Thinking)和《连接镜》(Connectoscope)是基于 "六度 "信息理念的小册子,即一切都有联系。 |
| | | |
− | * 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]].
| |
| | | |
| + | ====音乐==== |
| | | |
| + | * No Doubt的歌曲《Full Circle》的中心主题是处理六度分隔的问题。 <br />"Six Degrees of Separation "是美国乡村歌手米兰达-兰伯特(Miranda Lambert)2016年双专辑《The Weight of These Wings》的第二张唱片《The Heart》中的第10首歌曲。它是总的第22首歌曲。 "Six Degrees of Separation "是The Script第三张专辑《#3》中的第二首歌曲。 "Six Degrees "是Scouting for Girls的专辑《The Light Between Us》中的第六首歌曲。 Six Degrees of Inner Turbulence》是进步摇滚乐队Dream Theater 2002年的一张专辑。 英国前卫摇滚乐队Arena在2011年发行了一张名为《七度分离》的专辑。 Nessun grado di separazione是意大利歌手Francesca Michielin在2016年演唱的歌曲。这首歌的英语和意大利语双语版本名为 "No Degree of Separation",代表意大利参加了在瑞典斯德哥尔摩举行的2016年欧洲电视歌唱大赛。 |
| + | ====电视节目==== |
| | | |
− | <!-- PLEASE DON'T ADD MORE EXAMPLES TO LIST!!! I only had one to illustrate the point.-->
| + | * · [[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. · 《六度》是美国ABC电视台2006年的一部电视连续剧。该节目详细介绍了六个纽约人的经历,他们在没有意识到自己正在影响对方的情况下进行生活,并逐渐认识了彼此。 · ''Connected: The Power of Six Degrees'' is a 2008 television episode on the [[Science Channel]] in the US and abroad. · 《连接:六度的力量》是2008年美国和国外科学频道的一集电视节目[27] 。 · [[Lonely Planet Six Degrees|''Lonely Planet Six Degrees'']] is a TV travel show that uses the "six degrees of separation" concept: the hosts, Asha Gill and [[Toby Amies]], explore various cities through its people, by following certain personalities of the city around and being introduced by them to other personalities. · 《孤独星球六度空间》是一档采用 "六度分隔 "概念的电视旅游节目:主持人阿莎·吉尔和托比·阿米斯通过城市中的人探索各个城市,他们跟随城市中的某些人物到处走动,并由他们介绍给其他人物。 · The television program [[Lost (TV series)|''Lost'']] explores the idea of six degrees of separation, as almost all the characters have randomly met each other before the crash or someone the other characters know. · 电视节目《迷失》(Lost)探讨了六度分隔的概念,因为几乎所有的角色在坠机前都随机见过对方,或者其他角色认识的人。 · The [[Woestijnvis]] production [[Man Bijt Hond|''Man Bijt Hond'']], broadcast on [[Flanders|Flemish]] TV, features a weekly section ''Dossier Costers'', in which a worldwide event from the past week is linked to Gustaaf Costers, an ordinary Flemish citizen, in six steps. · 弗拉芒电视台播出的Woestijnvis制作的《Man Bijt Hond》每周都有一个Dossier Costers栏目,在这个栏目中,过去一周的世界性事件与普通弗拉芒公民Gustaaf Costers的关系分六个步骤。 · [[Six Degrees of Martina McBride|''Six Degrees of Martina McBride'']] is a [[television pilot]] wherein six aspiring country singers from America's smallest towns tried to connect themselves to [[Martina McBride]] in under six points of human connection. Those who made it from "Nowhere to [[Nashville, Tennessee|Nashville]] to New York," got both a shot at a studio session with McBride and a record deal with [[SONY BMG]]. It was not picked up as a series. · 《玛蒂娜·麦克布莱德的六度》是一个电视试播节目,来自美国最小城镇的六位有抱负的乡村歌手试图在六点人际关系下将自己与玛蒂娜-麦克布莱德联系起来。那些从 "无名之地到纳什维尔再到纽约 "的人,都有机会在录音室与麦克布赖德进行交流,并获得与SONY BMG的唱片合约。它没有被选为一个系列。 · "[[Six Degrees of Separation (Battlestar Galactica)|Six Degrees of Separation]]" is an episode of the [[Battlestar Galactica (2004 TV series)|reimagined ''Battlestar Galactica'' series]]. · "六度分隔 "是重新设计的《太空堡垒卡拉狄加》系列的一集。 · The Israeli TV program ''Cultural Attache'', presented by [[Dov Alfon]], is based on the concept of Six Degrees of Separation. The first guest is asked to name a cultural figure with which he has an unexpected connection, and this person is interviewed and gives yet another name as connection, till the 6th person on the show, who is then asked about a possible connection to the first guest. Such connection is found in about 50% of the interviews. · 由多夫·阿方主持的以色列电视节目《文化随员》以 "六度分隔 "的概念为基础。第一位嘉宾被要求说出一个与他有意外联系的文化人物,这个人在接受采访时又给出了另一个名字作为联系,直到节目中的第6个人,然后他被问及与第一位嘉宾的可能联系。这种联系在大约50%的采访中被发现。 · [[Six Degrees of Everything|''Six Degrees of Everything'']] is a comedy series starring [[Benny Fine]] and [[Rafi Fine]] where they illustrate that everything in the world is connected by a six-degree separation. · 《万物六度》是一个喜剧系列,由本尼·费恩和拉菲·费恩主演,他们说明世界上的一切都以六度之差相连。 · [[Jorden runt på 6 steg|''Jorden runt på 6 steg'']] is a three-episode infotainment series produced by [[Nexiko Media]] which aired in Swedish [[Kanal 5 (Sweden)|Kanal 5]] in 2015. For each episode, hosts [[Filip Hammar and Fredrik Wikingsson]] selected one random person (in [[Bolivia]], [[Nepal]] and [[Senegal]]) and traced their relationships to three respective celebrities: [[Leif G. W. Persson]], [[Gordon Ramsay]] and [[Buzz Aldrin]] within a week of travelling. They reached Persson within seven steps, and Ramsay and Aldrin within six steps. The second season features [[Michael Bolton]], [[Jeremy Clarkson]], [[Pamela Anderson]], and [[Charlie Sheen]]. · 《Jorden runt på 6 steg》是由Nexiko Media制作的三集信息娱乐节目,于2015年在瑞典Kanal 5播出。每一集,主持人菲利普·哈马尔和弗雷德里克·维金森随机选择一个人(在玻利维亚、尼泊尔和塞内加尔),并追溯他们与三位名人的关系。Leif G. W. Persson、Gordon Ramsay和Buzz Aldrin在旅行的一个星期内。他们在七步之内到达佩尔森,而拉姆塞和奥尔德林则在六步之内。第二季有迈克尔·波顿、杰里米·克拉克森、帕米拉·安德森和查理·辛。 · [[Jorden rundt på seks steg|''Jorden rundt på seks steg'']] is an ongoing Norwegian TV-series produced by NRK. In each episode, a pair of Norwegian celebrities are placed in one of the world's most remote areas and from there, asked to get in touch with a certain celebrity through a chain of six people. They are usually successful: In Season 1, three out of six pairs managed to get to their chosen celebrity in six steps; two of the pairs managed it in seven, and one pair managed it in five. In Season 2, all six pairs reached their target in six steps. · 《Jorden rundt på seks steg》是挪威国家广播公司(NRK)正在制作的一个电视系列节目。在每集节目中,一对挪威名人被安排在世界最偏远的地区之一,并从那里被要求通过六人链与某位名人取得联系。他们通常是成功的。在第一季中,六对组合中的三对在六个步骤中成功地找到了他们所选择的名人;其中两对在七个步骤中成功,一对在五个步骤中成功。在第二季中,所有六对都在六步之内到达了他们的目标。 |
− | | |
− | < ! -- 请不要在列表中增加更多的例子! ! !我只有一个例子来说明这一点
| |
− | | |
− | ====Television====
| |
− | | |
− | * ''[[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.-->
| |
− | | |
− | * ''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>
| |
− | | |
− | * ''[[Lonely Planet Six Degrees]]'' is a TV travel show that uses the "six degrees of separation" concept: the hosts, Asha Gill and [[Toby Amies]], explore various cities through its people, by following certain personalities of the city around and being introduced by them to other personalities.
| |
− | | |
− | * The television program ''[[Lost (TV series)|Lost]]'' explores the idea of six degrees of separation, as almost all the characters have randomly met each other before the crash or someone the other characters know.
| |
− | | |
− | * The [[Woestijnvis]] production ''[[Man Bijt Hond]]'', broadcast on [[Flanders|Flemish]] TV, features a weekly section ''Dossier Costers'', in which a worldwide event from the past week is linked to Gustaaf Costers, an ordinary Flemish citizen, in six steps.<ref>Het Nieuwsblad, 25 September 2009 {{cite web |url=http://www.nieuwsblad.be/article/detail.aspx?articleid=GDC2FNI8B |title=Archived copy |accessdate=2010-02-25 |url-status=dead |archiveurl=https://web.archive.org/web/20110501073520/http://www.nieuwsblad.be/article/detail.aspx?articleid=GDC2FNI8B |archivedate=2011-05-01 }}{{cite web |url=http://www.nieuwsblad.be/article/detail.aspx?articleid=GDC2FNI8J |title=Archived copy |accessdate=2010-02-25 |url-status=dead |archiveurl=https://web.archive.org/web/20110501073602/http://www.nieuwsblad.be/article/detail.aspx?articleid=GDC2FNI8J |archivedate=2011-05-01 }} ([[Dutch language|Dutch]])</ref>
| |
− | | |
− | * ''[[Six Degrees of Martina McBride]]'' is a [[television pilot]] wherein six aspiring country singers from America's smallest towns tried to connect themselves to [[Martina McBride]] in under six points of human connection. Those who made it from "Nowhere to [[Nashville, Tennessee|Nashville]] to New York," got both a shot at a studio session with McBride and a record deal with [[SONY BMG]]. It was not picked up as a series.
| |
− | | |
− | * "[[Six Degrees of Separation (Battlestar Galactica)|Six Degrees of Separation]]" is an episode of the [[Battlestar Galactica (2004 TV series)|reimagined ''Battlestar Galactica'' series]].
| |
− | | |
− | * The Israeli TV program ''Cultural Attache'', presented by [[Dov Alfon]], is based on the concept of Six Degrees of Separation. The first guest is asked to name a cultural figure with which he has an unexpected connection, and this person is interviewed and gives yet another name as connection, till the 6th person on the show, who is then asked about a possible connection to the first guest. Such connection is found in about 50% of the interviews.<ref>Israel's Channel 2 website [http://www.rashut2.org.il/prod_self.asp?pgId=18625&sttsId=3&year=2005&catId=100&arc=1] ([[Hebrew language|Hebrew]])</ref>
| |
− | | |
− | * ''[[Six Degrees of Everything]]'' is a comedy series starring [[Benny Fine]] and [[Rafi Fine]] where they illustrate that everything in the world is connected by a six-degree separation.<ref name="Futon Critic 07-13-15">{{cite web|last1=staff|title=SIX DEGREES OF EVERYTHING (TRUTV) Premieres Tuesday, August 18|url=http://www.thefutoncritic.com/devwatch/six-degrees-of-everything/|accessdate=August 12, 2015|website=[[Futon Critic]]|date=July 13, 2015}}</ref>
| |
− | | |
− | * ''[[Jorden runt på 6 steg]]'' is a three-episode infotainment series produced by [[Nexiko Media]] which aired in Swedish [[Kanal 5 (Sweden)|Kanal 5]] in 2015. For each episode, hosts [[Filip Hammar and Fredrik Wikingsson]] selected one random person (in [[Bolivia]], [[Nepal]] and [[Senegal]]) and traced their relationships to three respective celebrities: [[Leif G. W. Persson]], [[Gordon Ramsay]] and [[Buzz Aldrin]] within a week of travelling. They reached Persson within seven steps, and Ramsay and Aldrin within six steps. The second season features [[Michael Bolton]], [[Jeremy Clarkson]], [[Pamela Anderson]], and [[Charlie Sheen]].
| |
− | | |
− | * ''[[Jorden rundt på seks steg]]'' is an ongoing Norwegian TV-series produced by NRK. In each episode, a pair of Norwegian celebrities are placed in one of the world's most remote areas and from there, asked to get in touch with a certain celebrity through a chain of six people. They are usually successful: In Season 1, three out of six pairs managed to get to their chosen celebrity in six steps; two of the pairs managed it in seven, and one pair managed it in five. In Season 2, all six pairs reached their target in six steps. https://tv.nrk.no/serie/jorden-rundt-paa-seks-steg
| |
| | | |
| + | ===网站与应用=== |
| | | |
| + | ==== 互联网 ==== |
| | | |
| 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 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度的分离度。
| + | In late February 2018, the website 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 degreesofwikipedia.com.) |
| | | |
− | ===Website and application=== | + | 2013年,匈牙利物理学家Albert-László Barabási发现,平均而言,任何两个网页之间有19度的间隔。<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> |
| | | |
− | ==== Internet ====
| |
| | | |
− | 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 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].)
| |
| | | |
− | 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。)
| + | ==== 维基百科的六度 ==== |
| | | |
| + | In late February 2018, the website 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 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. |
| | | |
− | ==== Six Degrees of Wikipedia ==== | + | 2018年2月底,网站www.SixDegreesOfWikipedia.com,由雅各布-温格发布。该网站以任何两篇维基百科文章为例,以最少的点击次数找到将两者相互连接的各种超链接路径。然后,它显示了为此所采取的每一个步骤,还以图形的方式展示了这些连接。2018年3月14日,该网站表示,在截至该日的搜索中(约50万),平均分离度为3.0190°。从这些中,需要六个或更多度数的搜索数量为1.417%。它还说,没有找到任何联系的搜索是1.07%,这归因于某些文章是死胡同或者链接很少。<ref name=":10" />(温格的开放源代码可以在GitHub上找到,这使得其他网站可以复制这个概念,比如degreeofwikipedia.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].)
| |
| | | |
− | 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.
| + | 卡尔-班扬开发了一个名为 "六度 "的Facebook平台应用程序,计算人与人之间的分离程度。从该小组的页面上看,它有超过580万用户。该应用程序所有用户的平均分离度为5.73度,而最大分离度为12度。该应用程序有一个 "搜索连接 "窗口,可以输入Facebook用户的任何名字,然后显示其连接链。2009年6月,布尼恩关闭了该应用程序,可能是由于Facebook的缓存政策问题;具体而言,该政策禁止储存朋友名单超过24小时,这将使该应用程序不准确。在卡尔-班扬允许托德-查菲领导的一组开发人员根据Facebook修改后的数据缓存政策重新开发该应用程序后,该应用程序的新版本在六度空间开始使用。 |
| | | |
− | 一个名为“ Six Degrees”的 Facebook 平台应用程序是由 Karl Bunyan 开发的,它可以计算人与人之间的距离。它拥有超过580万的用户,从该组织的页面上可以看到。应用程序的所有用户的平均分离度为5.73度,而最大分离度为12度。该应用程序有一个“搜索连接”窗口,用于输入 Facebook 用户的任何名称,然后显示连接链。2009年6月,班扬关闭了这个应用程序,可能是因为 Facebook 的缓存政策出了问题; 具体来说,政策禁止存储朋友列表超过24小时,这会导致这个应用程序不准确。这个应用程序的一个新版本在 Six Degrees 上发布,此前卡尔•班扬(Karl Bunyan)允许托德•查菲(Todd Chaffee)领导的一群开发人员根据 Facebook 修订后的缓存数据政策重新开发该应用程序。
| |
| | | |
| | | |
第345行: |
第231行: |
| 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 开发者车库的黑客马拉松上开发的,马克 · 扎克伯格也参加了这个活动。
| + | A [[Facebook]] platform application named "Six Degrees" was developed by Karl Bunyan<ref name=":11">{{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>, 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. |
| | | |
− | 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. |
| | | |
| + | The initial version of the application was built at a Facebook Developers Garage London [[hackathon]] with [[Mark Zuckerberg]] in attendance. |
| | | |
− | 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.
| |
| | | |
− | 雅虎!研究小世界实验已经进行了一项实验,每个拥有 Facebook 账号的人都可以参与其中。根据研究页面,这项研究有可能解决尚未解决的六度分隔理论理论。
| + | 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 |
| | | |
− | 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开发者车库伦敦黑客马拉松上建立的,马克-扎克伯格出席了会议。 |
| | | |
| + | 一个名为 "六度 "的Facebook平台应用是由卡尔-布尼恩开发的,它计算人与人之间的分离程度。从该小组的页面上看,它有超过580万用户。该应用程序所有用户的平均分离度为5.73度,而最大分离度为12度。该应用程序有一个 "搜索连接 "窗口,可以输入Facebook用户的任何名字,然后显示其连接链。2009年6月,Bunyan关闭了该应用程序,可能是由于Facebook的缓存政策问题;具体而言,该政策禁止储存朋友名单超过24小时,这将使该应用程序不准确。<ref name=":11" /> 在Karl Bunyan允许Todd Chaffee领导的一组开发人员根据Facebook修订的缓存数据政策重新开发该应用程序后,该应用程序的新版本在六度空间可用。 |
| | | |
| | | |
− | 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账户的人都可以参与其中。根据研究页面,这项研究有可能解决仍未解决的六度分隔理论。 |
| | | |
− | Facebook 的数据团队在2011年11月发表了两篇论文,文中指出,在进行研究的时候,所有 Facebook 用户(7.21亿用户,拥有690亿个好友链接)之间的平均距离为4.74。调查还发现,99.91% 的 Facebook 用户是相互联系的,形成了一个巨大的连接元件(图论)。
| + | 该应用程序的最初版本是在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>
| |
| | | |
| + | Facebook的数据团队在2011年11月发布了两篇论文,其中记录了在研究时的所有Facebook用户中(7.21亿用户,690亿条友谊链接),平均距离为4.74。研究还发现,99.91%的Facebook用户是相互联系的,形成了一个大的连接部分 |
| | | |
| + | 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%)。 |
| {| class="wikitable infobox" | | {| class="wikitable infobox" |
| | | |
第436行: |
第324行: |
| | | |
| |} | | |} |
− |
| |
− | |-
| |
− |
| |
− | 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>
| |
− |
| |
− | |}
| |
− |
| |
− | 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>
| |
− |
| |
− | 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.
| |
− |
| |
− | LinkedIn 专业社交网站操作的是一个人与他或她希望与之交流的人之间的分离程度。在 LinkedIn 上,一个人的社交网络由第一学位、第二学位和第三学位的联系人和 LinkedIn 群组的成员组成。此外,LinkedIn 还会通知用户他们和其他用户有多少共同的连接。
| |
− |
| |
| | | |
| | | |
第461行: |
第332行: |
| 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. | | 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. |
| | | |
− | SixDegrees.com 是一个早期的社交网站,从1997年到2001年一直存在。它允许用户列出朋友、家庭成员和熟人,发送消息和贴布告栏的项目给他们的第一个、第二个和第三个学位的人,并查看他们与网站上任何其他用户的联系。在其鼎盛时期,它有350万正式注册会员。然而,它在2000年关闭了。
| + | LinkedIn 专业社交网站操作的是一个人与他或她希望与之交流的人之间的分离程度。在 LinkedIn 上,一个人的社交网络由第一学位、第二学位和第三学位的联系人和 LinkedIn 群组的成员组成。此外,LinkedIn 还会通知用户他们和其他用户有多少共同的连接。 |
| | | |
| | | |
第467行: |
第338行: |
| ==== SixDegrees.com ==== | | ==== SixDegrees.com ==== |
| | | |
− | [[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 name=":10">{{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. | | | year = 2010 | isbn = 978-1439102121 |title-link=The Facebook Effect }}</ref> However, it was closed in 2000. |
| | | |
− | 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步或更少。
| + | SixDegrees.com是一个早期的社会网络网站,从1997年到2001年一直存在。它允许用户列出朋友、家人和熟人,向他们的第一、第二和第三等级的人发送信息和发布公告板项目,并查看他们与网站上任何其他用户的联系。在其鼎盛时期,它有3,500,000名完全注册的成员。<ref name=":10" /> 然而,它在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>
| + | ==== Twitter ==== |
| | | |
| + | 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 name=":12">Apr 30, 2010, [http://www.sysomos.com/insidetwitter/sixdegrees/ Six Degrees of Separation, Twitter Style], from [[Sysomos]].</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 上所有活跃用户计算出每对用户之间的距离。
| + | 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. |
| | | |
− | ==== Twitter ==== | + | 推特上的用户可以关注其他用户,创建一个网络。根据社交媒体监测公司Sysomos对52亿这种关系的研究,Twitter上的平均距离是4.67。平均而言,Twitter上约有50%的人彼此之间只有四步之遥,而几乎所有人的距离都在五步以内<ref name=":12" /> 。 |
| | | |
− | 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>
| + | 在另一项工作中,研究人员表明,Twitter中1500名随机用户的平均距离是3.435。他们用Twitter中所有的活跃用户来计算每对用户之间的距离。 |
| | | |
| + | 推特上的用户可以关注其他用户,形成一个网络。根据社交媒体监测公司Sysomos对52亿这种关系的研究,Twitter上的平均距离是4.67。平均而言,Twitter上约有50%的人彼此之间只有四步之遥,而几乎所有人的距离都在五步以内<ref>{{cite web|url=http://www.ams.org/mathscinet/collaborationDistance.html|title=MR: Collaboration Distance|work=ams.org}}</ref>。 |
| | | |
| + | ==数学== |
| | | |
| 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. | | 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. |
第493行: |
第365行: |
| 数学家们使用了一个类似的合作距离的概念: 如果两个人是一篇文章的合著者,那么他们就是连在一起的。与数学家保罗 · 尔德的合作距离称为尔德数。Erd s-bacon 数字和 erd s-bacon-sabbath (EBS)数字是同一思想的进一步延伸。 | | 数学家们使用了一个类似的合作距离的概念: 如果两个人是一篇文章的合著者,那么他们就是连在一起的。与数学家保罗 · 尔德的合作距离称为尔德数。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. |
− | | |
− | | |
− | | |
− | 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==
| |
− | | |
− | = 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.
| + | 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 |
| | | |
− | (Assume 10% of population is too young to participate.)
| + | 在另一项工作中,研究人员表明,Twitter中1500名随机用户的平均距离为3.435。他们用Twitter中所有的活跃用户来计算每对用户之间的距离[46] 。 |
| | | |
− | (假设10% 的人口年龄太小不能参与。)
| + | Watts和Strogatz表明,随机网络中两个节点之间的平均路径长度等于 ,其中=总节点和=每个节点的熟人。因此,如果 |
| | | |
| + | ''N'' = 300,000,000 (90% of the US population) and ''K'' = 30 then ''Degrees of Separation'' = 19.5 / 3.4 = 5.7 and if ''N'' = 6,000,000,000 (90% of the World population) and ''K'' = 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 |
| | | |
− | [[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
| + | 如果N=300,000,000(90%的美国人口),K=30,那么分离度=19.5/3.4=5.7;如果N=6,000,000(90%的世界人口),K=30,那么分离度=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.
| + | 2007年,密歇根州立大学的Jesse S. Michel在《工业-组织心理学家》上发表了一篇文章,通过共同作者的出版联系,将Stanley Milgram的小世界现象(即 "小世界问题")应用于国际组织心理学领域。按照六个标准,Scott Highhouse(鲍林格林州立大学教授、工业与组织心理学会会员)被选为目标。共同作者的出版联系被确定为:(1) I-O社区的顶级作者;(2) 北美高产I-O项目的准随机教师;(3) 目标的出版趋势。结果表明,小世界现象依然存在,与顶级作者的平均联系为3.00,与准随机教员的平均联系为2.50,而目标人物的共同作者联系相对广泛且不重复。然后,作者提出了一系列对未来研究的影响和建议 |
| | | |
− | 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。最后,作者对未来的研究提出了一系列的启示和建议。
| |
| | | |
− | (Assume 10% of population is too young to participate.)
| |
| | | |
| + | ==心理学== |
| | | |
| + | A 2007 article published in ''The Industrial-Organizational Psychologist''<ref name="Futon Critic 07-13-15" />, 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. |
| | | |
− | ==Psychology==
| + | 密歇根州立大学的Jesse S. Michel在2007年发表在《工业-组织心理学家》上的一篇文章[49],通过共同作者的出版物联系,将Stanley Milgram的小世界现象(即 "小世界问题")应用于I-O心理学领域。按照六个标准,Scott Highhouse(鲍林格林州立大学教授、工业与组织心理学会会员)被选为目标。共同作者的出版联系被确定为:(1) I-O社区的顶级作者;(2) 北美高产I-O项目的准随机教师;(3) 目标的出版趋势。结果表明,小世界现象依然存在,与顶级作者的平均联系为3.00,与准随机教员的平均联系为2.50,而目标人物的共同作者联系相对广泛且不重复。然后,作者提出了一系列对未来研究的影响和建议。 |
| | | |
− | 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.
| |
| | | |
| | | |
| | | |
− | == See also == | + | == 拓展阅读 == |
| | | |
| {{div col}} | | {{div col}} |
第573行: |
第433行: |
| | | |
| | | |
− | ==Notes== | + | ==标注== |
| | | |
| {{reflist|group=Note}} | | {{reflist|group=Note}} |
第579行: |
第439行: |
| | | |
| | | |
− | ==References== | + | 1."所有参与者中有一半以上居住在北美,是中产阶级、专业人士、受过大学教育和基督徒,反映了人们对互联网使用人群的普遍看法"<ref name="dodds" />。 |
| + | |
| + | 2."表明缺乏兴趣......是 "完成率极低 "的主要原因"<ref name="dodds" />。 |
| + | |
| + | ==参考文献== |
| | | |
| {{Reflist|30em}} | | {{Reflist|30em}} |
第585行: |
第449行: |
| | | |
| | | |
− | ==External links== | + | ==外部链接== |
| | | |
| *[https://www.naraview.com/#/ naraview] - A game which you need to find a connection between two articles in Wikipedia. | | *[https://www.naraview.com/#/ naraview] - A game which you need to find a connection between two articles in Wikipedia. |