Skip to main content
Article thumbnail
Location of Repository

Extraction and Analysis of Facebook Friendship Relations

By Salvatore Catanese, Pasquale De Meo, Emilio Ferrara, Giacomo Fiumara and Alessandro Provetti

Abstract

Online Social Networks (OSNs) are a unique Web and social phenomenon, affecting tastes and behaviors of their users and helping them to maintain/create friendships. It is interesting to analyze the growth and evolution of Online Social Networks both from the point of view of marketing and other of new services and from a scientific viewpoint, since their structure and evolution may share similarities with real-life social networks. In social sciences, several techniques for analyzing (online) social networks have been developed, to evaluate quantitative properties (e.g., defining metrics and measures of structural characteristics of the networks) or qualitative aspects (e.g., studying the attachment model for the network evolution, the binary trust relationships, and the link prediction problem).\ud However, OSN analysis poses novel challenges both to Computer and Social scientists. We present our long-term research effort in analyzing Facebook, the largest and arguably most successful OSN today: it gathers more than 500 million users. Access to data about Facebook users and their friendship relations, is restricted; thus, we acquired the necessary information directly from the front-end of the Web site, in order to reconstruct a sub-graph representing anonymous interconnections among a significant subset of users. We describe our ad-hoc, privacy-compliant crawler for Facebook data extraction. To minimize bias, we adopt two different graph mining techniques: breadth-first search (BFS) and rejection sampling. To analyze the structural properties of samples consisting of millions of nodes, we developed a specific tool for analyzing quantitative and qualitative properties of social networks, adopting and improving existing Social Network Analysis (SNA) techniques and algorithms

Topics: Dynamical Systems, Machine Learning
Publisher: Springer Verlag, London
Year: 2011
OAI identifier: oai:cogprints.org:7668

Suggested articles

Citations

  1. (2002). A.: Statistical mechanics of complex networks.
  2. (2007). Analysis of topological characteristics of huge online social networking services. In:
  3. (2000). Classes of small-world networks.
  4. (1999). Diameter of the World Wide Web.
  5. (1999). Emergence of scaling in random networks.
  6. (2000). et al.: Power-law distribution of the world wide web.
  7. (2003). Friends and Neighbors on the Web.
  8. (2010). Link creation and profile alignment in the aNobii social network. In:
  9. (2005). Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.