facebook_wall — Facebook wall posts and friendships (2009)

Description

Wall posts and friendship links among users of the New Orleans regional network of Facebook, collected by B. Viswanath, A. Mislove, M. Cha and K. P. Gummadi. The authors joined the regional network with several accounts, crawled its friendship graph in a breadth-first fashion between 29 December 2008 and 3 January 2009, starting from a single user, and then downloaded, between 20 and 22 January 2009, the entire wall history of the users found, as far as their profiles were visible to the members of the regional network (the default privacy setting). On Facebook, a user's friends can post messages on the user's wall, which are visible to the visitors of the user's profile. Only users in the giant connected component of the regional network could be crawled. The user IDs were anonymized, but are the same in both networks of the collection:

wall: the wall posts. Nodes are users and a directed edge $(i,j)$ indicates that user $i$ posted on the wall of user $j$. Each wall post is a separate edge, so a pair of users can be connected by multiple edges, and posts by users on their own walls appear as self-loops. The posts span from September 2004 to January 2009.
friends: the friendship links. Nodes are users and a directed edge $(i,j)$ indicates that user $j$ appeared in the friend list of user $i$. Friendships are symmetric on Facebook, but the links are given as directed in the source data, with their own times of establishment; for most (94%) of the links, the reverse link is also present. The times, determined by the authors when possible, span from September 2006 to January 2009, and are unknown for 41% of the links.

The networks have the following properties:

user_id: the anonymized user ID in the source data.
time (edge): for wall, the time of the wall post; for friends, the time of the establishment of the link (-1 if unknown). In Unix time.

Tags

Social Online Communication Timestamps Multigraph

Citation

B. Viswanath, A. Mislove, M. Cha, K. P. Gummadi, "On the evolution of user interaction in Facebook." Proceedings of the 2nd ACM Workshop on Online Social Networks (WOSN '09), 37-42 (2009) 10.1145/1592665.1592675 Sci-Hub

Upstream URL OK

http://socialnetworks.mpi-sws.org/data-wosn2009.html

Networks

Tip: click on a column header to sort the list, or hover over it for a description.

Column legend

$\left<k\right>$: Mean degree
$\sigma_k$: Standard deviation of the degrees
$\lambda_h$: Largest eigenvalue of the Hashimoto (non-backtracking) matrix
$\tau$: Random walk mixing time
$r$: Degree assortativity
$c$: Global clustering coefficient
$\oslash$: (Pseudo-) diameter
$S$: Relative size of the largest component
NPs: Node properties
EPs: Edge properties

Name	Nodes	Edges	$\left<k\right>$	$\sigma_k$	$\lambda_h$	$\tau$	$r$	$c$	$\oslash$	$S$	Kind	Mode	NPs	EPs	gt	GraphML	GML	csv
wall	46,952	876,993	18.68	86.88	39.06	303.94	0.46	0.20	18	0.94	Directed	Unipartite	user_id	time	4.9 MiB	6.8 MiB	6.7 MiB	6.5 MiB
friends	63,731	1,545,686	24.25	75.82	130.82	54.49	0.17	0.15	15	0.99	Directed	Unipartite	user_id	time	6.7 MiB	12.3 MiB	12.2 MiB	11.0 MiB

Ridiculograms^*

^* These are automatically generated force-directed visualizations, and can be quite meaningless for networks both big and small. They should not be taken seriously as sources of scientific insight. See here for a discussion.