# Cluster your Facebook friends

[This article was first published on

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

**jean-robert.github.com**, and kindly contributed to R-bloggers]. (You can report issue about the content on this page here)Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.

Last week, I came across two interesting posts by Romain François and Petr Simecek:

- Crawling Facebook with R, in which Romain explains how to connect to the Facebook Graph API
- Mining Facebook Data: Most “Liked” Status and Friendship Network, in which Petr use Romain’s function to visualize your friend’s network.

As coincidence would have it, I also came across an older introductory post about social network analysis (Grey’s Anatomy Network of Sexual Relations) which could actually complement quite well the two posts above.

Using the igraph package, it is very easy to use the Girvan-Newman algorithm to automatically detect your groups/clusters of friends. The code below show how to display the names of your friends on the plot.

Here is the full code to create the chart above:

To

**leave a comment**for the author, please follow the link and comment on their blog:**jean-robert.github.com**.R-bloggers.com offers

**daily e-mail updates**about R news and tutorials about learning R and many other topics. Click here if you're looking to post or find an R/data-science job.

Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.