Browse Definitions :
Definition

six degrees of separation

Six degrees of separation is the theory that any person on the planet can be connected to any other person on the planet through a chain of acquaintances that has no more than five intermediaries. The concept of six degrees of separation is often represented by a graph database, a type of NoSQL database that uses graph theory to store, map and query relationships.Real-world applications of the theory include power grid mapping and analysis, disease transmission mapping and analysis, computer circuitry design and search engine ranking.

The six degrees of separation theory was first proposed in 1929 by the Hungarian writer Frigyes Karinthy in a short story called "Chains." In the 1950s, Ithiel de Sola Pool (MIT) and Manfred Kochen (IBM) set out to prove the theory mathematically. Although they were able to phrase the question mathematically (given a set N of people, what is the probability that each member of N is connected to another member via k_1, k_2, k_3...k_n links?), after twenty years they were still unable to solve the problem to their satisfaction.

In 1967, American sociologist Stanley Milgram devised a new way to test the theory, which he called "the small-world problem." Milgram randomly selected people in the midwest to send packages to a stranger located in Massachusetts. The senders knew the recipient's name, occupation and general location. Each participant was instructed to send the package to a person he knew on a first-name basis who was most likely, out of all the participant's friends, to know the target personally. That person would do the same, and so on until the package was personally delivered to its target recipient. Although participants expected the chain to include at least a hundred intermediaries, it only took (on average) between five and seven intermediaries for each package to be delivered successfully.

Milgram's findings were published in Psychology Today and inspired the phrase "six degrees of separation." Playwright John Guare popularized the phrase when he chose it as the title for his 1990 play. Although Milgram's findings were discounted after it was discovered that he based his conclusion on a very small number of packages, six degrees of separation became an accepted notion in pop culture after Brett C. Tjaden published a computer game on the University of Virginia's Web site based on the small-world problem.

Tjaden used the Internet Movie Database (IMDB) to document connections between different actors. The game, which asked web site visitors to guess the number of connections between the actor Kevin Bacon and any other actor in the dataset, was called The Oracle of Bacon at Virginia. Time magazine selected it as one of the "Ten Best Web Sites of 1996."

In 2001, Duncan Watts, a professor at Columbia University, continued his earlier research into the phenomenon and recreated Milgram's experiment on the Internet. Watts used an email message as the "package" that needed to be delivered, and surprisingly, after reviewing the data collected by 48,000 senders and 19 targets (in 157 countries), Watts found that the average number of intermediaries was indeed six.

In 2008, Microsoft attempted to validate the experiment by analyzing the minimum chain length it would take to connect 180 billion different pairs of users in the Microsoft Messenger database. According to Microsoft's finding, the average chain length was 6.6 hops. In 2016, researchers at Facebook reported that the social networking site had reduced the chain length of its members to three and a half degrees of separation. Dutch mathematician Edsger Dijkstra is credited with developing the algorithm that made it possible for Facebook researchers and others to find the shortest path between two nodes in a graph database.

This was last updated in February 2017

Continue Reading About six degrees of separation

SearchCompliance
  • ISO 31000 Risk Management

    The ISO 31000 Risk Management framework is an international standard that provides businesses with guidelines and principles for ...

  • pure risk

    Pure risk refers to risks that are beyond human control and result in a loss or no loss with no possibility of financial gain.

  • risk reporting

    Risk reporting is a method of identifying risks tied to or potentially impacting an organization's business processes.

SearchSecurity
  • Twofish

    Twofish is a symmetric-key block cipher with a block size of 128 bits and variable-length key of size 128, 192 or 256 bits.

  • walled garden

    On the internet, a walled garden is an environment that controls the user's access to network-based content and services.

  • potentially unwanted program (PUP)

    A potentially unwanted program (PUP) is a program that may be unwanted, despite the possibility that users consented to download ...

SearchHealthIT
SearchDisasterRecovery
  • What is risk mitigation?

    Risk mitigation is a strategy to prepare for and lessen the effects of threats faced by a business.

  • fault-tolerant

    Fault-tolerant technology is a capability of a computer system, electronic system or network to deliver uninterrupted service, ...

  • synchronous replication

    Synchronous replication is the process of copying data over a storage area network, local area network or wide area network so ...

SearchStorage
  • Remote Direct Memory Access (RDMA)

    Remote Direct Memory Access (RDMA) is a technology that enables two networked computers to exchange data in main memory without ...

  • storage (computer storage)

    Data storage is the collective methods and technologies that capture and retain digital information on electromagnetic, optical ...

  • storage medium (storage media)

    In computers, a storage medium is a physical device that receives and retains electronic data for applications and users and ...

Close