Maier Facebook friends (2014)

A small anonymized Facebook ego network, from April 2014. Nodes are Facebook profiles, and an edge exists if the two profiles are "friends" on Facebook. Metadata gives the social context for the relationship between ego and alter.[^icon] [^icon]: Description obtained from the [ICON](https://icon.colorado.edu) project.

npx keepset fetch netzschleuder-facebook_friends

Nodes: 362
Edges: 1,988
Size: 20 B

Fetch and preview this dataset on this page, or download the result as JSON. The command line fetches it without a browser.

Overview

Id	`netzschleuder-facebook_friends`
Namespace	`netzschleuder`
Aliases	`facebook_friends`
Category	`graph/v1`
Kind	graph
Domain	Social network
Licence	not recorded by the source
Catalogue	`keepset` 1.33.0

Sources and provenance

#	URL	Status	Retrieved	Read by recipe	Pinned snapshot	SHA-256
0	https://github.com/benmaier/BFMaierFBnetwork	live	2026-04-20		20260228133049raw	`58c86bef2c3a`
1	https://networks.skewed.de/net/facebook_friends	live	2026-04-20		20260606111453raw	`e497810d8152`
2	https://networks.skewed.de/net/facebook_friends/files/facebook_friends.csv.zip	live	2026-04-20	yes

Citations

B. F. Maier and D. Brockmann, "Cover time for random walks on arbitrary complex networks." Phys. Rev. E 96, 042307 (2017) https://arxiv.org/abs/1706.02356

Recipe

Source	#2
Archive	zip
Member	`edges.csv`
Parser format	`"edge-list"`
Parser encoding	`"utf-8"`
Parser delimiter	`"comma"`
Parser skipLines	`0`
Parser commentPrefixes	`["#"]`
Parser sourceColumn	`0`
Parser targetColumn	`1`

Crosswalk

keepset/topology to graph/v1, as a crossmap crosswalk.

Rule	From	To	Direction
move	`meta`	`meta`	both
move	`nodes[].id`	`nodes[].id`	both
move	`edges[].source`	`edges[].source`	both
move	`edges[].target`	`edges[].target`	both

Expected counts

Edges	1,988
Nodes	362

Properties

Directed	no
Download bytes	20 B
Heterogeneous	no
Multigraph	no
Self loops	no
Weighted	no