# Degrees of Separation in Social Networks

@inproceedings{Bakhshandeh2011DegreesOS, title={Degrees of Separation in Social Networks}, author={Reza Bakhshandeh and Mehdi Samadi and Zohreh Azimifar and Jonathan Schaeffer}, booktitle={SOCS}, year={2011} }

Social networks play an increasingly important role in today's society. Special characteristics of these networks make them challenging domains for the search community. In particular, social networks of users can be viewed as search graphs of nodes, where the cost of obtaining information about a node can be very high. This paper addresses the search problem of identifying the degree of separation between two users. New search techniques are introduced to provide optimal or near-optimal…

## 54 Citations

On Small-World Networks: Survey and Properties Analysis

- Computer ScienceArXiv
- 2021

The first empirical study for the “six degrees of separation” phenomenon in social networks is explained, some of the probabilistic network models based on this work are reviewed, elaborating how these models tried to explain the phenomenon’s properties, and few of the recent empirical studies empowered by these models are reviewed.

Online Link Disclosure Strategies for Social Networks

- Computer ScienceCRiSIS
- 2016

The proposed algorithm is able to perform friendship and mutual-friend attacks along a strategy that minimizes the number of queries and sheds new light on the intrinsic relation between communities (usually represented as groups) and friendships between individuals.

Lurking in social networks: topology-based analysis and ranking methods

- Computer ScienceSocial Network Analysis and Mining
- 2014

This work addresses the new problem of lurker ranking and proposes the first centrality methods specifically conceived for ranking lurkers in social networks, and utilizes only the network topology without probing into text contents or user relationships related to media.

On M-Polynomials of Dunbar Graphs in Social Networks

- MathematicsSymmetry
- 2020

A novel application of M-polynomials is developed, the ( m, n, r ) -agent recruitment graph where n > 1 , to study the relationship between the Dunbar graphs of social networks and the small-world phenomenon.

Lost in the City: Revisiting Milgram's Experiment in the Age of Social Networks

- Computer SciencePloS one
- 2014

This work simulated message routing within a representative sub-graph of the network of Twitter users with about 6 million geo-located nodes and 122 million edges and found that the examined network is navigable on large scales, but navigability breaks down at the city scale and the network becomes unnavigable on intra-city distances.

Flocking based evolutionary computation strategy for measuring centrality of online social networks

- Computer ScienceAppl. Soft Comput.
- 2017

An empirical study of the financial community network on Twitter

- Economics2014 IEEE Conference on Computational Intelligence for Financial Engineering & Economics (CIFEr)
- 2014

It is argued that the critical Twitter users within the financial community provide a better proxy between social sentiment and financial market movement and provide a more robust predictor of financial markets than the general social sentiment.

Link Prediction Methods and Their Accuracy for Different Social Networks and Network Metrics

- Computer ScienceSci. Program.
- 2015

Correlation analysis between network metrics and prediction accuracy of prediction methods may form the basis of a metalearning system where based on network characteristics it will be able to recommend the right prediction method for a given network.

Personalized search based on micro-blogging social networks

- Computer ScienceThe 16th CSI International Symposium on Artificial Intelligence and Signal Processing (AISP 2012)
- 2012

This work addresses the problem of using micro-blogging social networks to personalize search engine results by introducing a framework which combines the similarity of results fetched from a non-personalized search engine and the users's interests extracted from the micro- bloggers social networks.

## References

SHOWING 1-10 OF 16 REFERENCES

Geographic routing in social networks

- Computer ScienceProc. Natl. Acad. Sci. USA
- 2005

A richer model relating geography and social-network friendship is introduced, in which the probability of befriending a particular person is inversely proportional to the number of closer people.

Navigating networks by using homophily and degree

- Computer ScienceProceedings of the National Academy of Sciences
- 2008

A probabilistic analysis of this navigation problem that produces a surprisingly simple and effective method for directing messages and provides a formal model that may describe how humans make decisions in sociological studies intended to explore the social network as well as how they made decisions in more naturalistic settings.

What is Twitter, a social network or a news media?

- Computer ScienceWWW '10
- 2010

This work is the first quantitative study on the entire Twittersphere and information diffusion on it and finds a non-power-law follower distribution, a short effective diameter, and low reciprocity, which all mark a deviation from known characteristics of human social networks.

Search in Power-Law Networks

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2001

A number of local search strategies that utilize high degree nodes in power-law graphs and that have costs scaling sublinearly with the size of the graph are introduced and demonstrated on the GNUTELLA peer-to-peer network.

Identity and Search in Social Networks

- Computer ScienceScience
- 2002

A model is presented that offers an explanation of social network searchability in terms of recognizable personal identities: sets of characteristics measured along a number of social dimensions that may be applicable to many network search problems.

Path finding strategies in scale-free networks.

- Computer SciencePhysical review. E, Statistical, nonlinear, and soft matter physics
- 2002

Numerically investigate the scale-free network model of Barabási and Albert through the use of various path finding strategies and a simple strategy, which utilizes only local information on the connectivity, is suggested and shown to yield small-world behavior.

Collective dynamics of ‘small-world’ networks

- Computer ScienceNature
- 1998

Simple models of networks that can be tuned through this middle ground: regular networks ‘rewired’ to introduce increasing amounts of disorder are explored, finding that these systems can be highly clustered, like regular lattices, yet have small characteristic path lengths, like random graphs.

BIDA: An Improved Perimeter Search Algorithm

- Computer ScienceArtif. Intell.
- 1995

Best-First Frontier Search with Delayed Duplicate Detection

- Computer ScienceAAAI
- 2004

The main contributions of this paper are to provide a scalable implementation of DDD, to combine it with frontier search, and to extend it to more general best-first searches such as A*.