The BookCrossing user–book network in its implicit form, as distributed by KONECT (bookcrossing_full-rating): 1,149,739 interactions between 105,278 members of the BookCrossing community and 340,523 books, collected by Cai-Nicolas Ziegler in August and September 2004. An edge records that a user interacted with a book; this version carries no rating values. Useful for collaborative filtering, implicit-feedback recommendation and the structure of user–item networks.
A Stack Exchange (scifi.stackexchange.com) dataset of 45,536 users, 100,186 answer-collaboration edges, 75,252 questions, 131,903 answers, collected by Stack Exchange, Inc. via the annual Stack Exchange Data Dump. Each record contains user nodes (reputation, badge counts, vote history), directed weighted edges (answerer→asker, weight=answer score, count=interactions, accepted=bool), post text, tag distribution. User collaboration network from scifi.stackexchange.com — directed weighted graph where edges represent knowledge-sharing relationships (A answered B's question), with edge weight reflecting answer quality. Enables prestige hierarchy, community detection, and expertise flow analysis.. Suitable for expertise network analysis, reputation systems, community detection, knowledge flow, PageRank-based authority ranking, Q&A platform dynamics..
A Stack Exchange (writers.stackexchange.com) dataset of 10,127 users, 28,045 answer-collaboration edges, 12,683 questions, 38,780 answers, collected by Stack Exchange, Inc. via the annual Stack Exchange Data Dump. Each record contains user nodes (reputation, badge counts, vote history), directed weighted edges (answerer→asker, weight=answer score, count=interactions, accepted=bool), post text, tag distribution. User collaboration network from writers.stackexchange.com — directed weighted graph where edges represent knowledge-sharing relationships (A answered B's question), with edge weight reflecting answer quality. Enables prestige hierarchy, community detection, and expertise flow analysis.. Suitable for expertise network analysis, reputation systems, community detection, knowledge flow, PageRank-based authority ranking, Q&A platform dynamics..
A Stack Exchange (literature.stackexchange.com) dataset of 2,793 users, 4,729 answer-collaboration edges, 6,780 questions, 7,588 answers, collected by Stack Exchange, Inc. via the annual Stack Exchange Data Dump. Each record contains user nodes (reputation, badge counts, vote history), directed weighted edges (answerer→asker, weight=answer score, count=interactions, accepted=bool), post text, tag distribution. User collaboration network from literature.stackexchange.com — directed weighted graph where edges represent knowledge-sharing relationships (A answered B's question), with edge weight reflecting answer quality. Enables prestige hierarchy, community detection, and expertise flow analysis.. Suitable for expertise network analysis, reputation systems, community detection, knowledge flow, PageRank-based authority ranking, Q&A platform dynamics..
A Voat (Reddit alternative, 2013–2020) dataset of 1,693 submissions, 11,219 comments, 4,699 users, 8,014 collaboration edges, collected by Mekacher & Papasavva (ICWSM 2022) via full platform crawl. Each record contains user nodes (registration date, moderation status), directed weighted edges (commenter→submitter, weight=upvotes+1), submission titles and bodies, comment text, upvotes, downvotes, depth. Complete dataset for the Voat subverse v/books, covering its full lifetime on the platform (2013–2020). Includes all 1,693 submissions and 11,219 comments with full text and engagement metadata.. Suitable for social network analysis, community dynamics, content moderation, platform migration studies, online community research.
A Stack Exchange (ebooks.stackexchange.com) dataset of 1,375 users, 1,813 answer-collaboration edges, 1,535 questions, 2,333 answers, collected by Stack Exchange, Inc. via the annual Stack Exchange Data Dump. Each record contains user nodes (reputation, badge counts, vote history), directed weighted edges (answerer→asker, weight=answer score, count=interactions, accepted=bool), post text, tag distribution. User collaboration network from ebooks.stackexchange.com — directed weighted graph where edges represent knowledge-sharing relationships (A answered B's question), with edge weight reflecting answer quality. Enables prestige hierarchy, community detection, and expertise flow analysis.. Suitable for expertise network analysis, reputation systems, community detection, knowledge flow, PageRank-based authority ranking, Q&A platform dynamics..
A Fediverse (bookwyrm, federation graph) dataset of 151 nodes, 4,966 edges (62 snapshots merged), collected by Damie & Cyffers via weekly crawls over 6 months. Each record contains undirected edges between instances that have ever communicated, with instances.csv providing node metadata. The dataset is notable for its communication backbone graph where nodes are instances and edges represent any past interaction (undirected), showing how servers in the Fediverse are connected at the infrastructure level. Intended for research into decentralized network topology analysis, infrastructure resilience, cross-instance communication patterns, and federation policy impact studies.
A David Copperfield novel (word adjacency network) dataset of 112 nodes and 425 edges, collected by M.E.J. Newman. Each record contains directed: False, weighted: False, signed: False. Word adjacency network of adjectives and nouns in David Copperfield — classic linguistic network benchmark.. Suitable for linguistic network analysis, community detection benchmark.
A Literary character co-occurrence (Les Misérables) dataset of 77 nodes and 254 edges, collected by D.E. Knuth. Each record contains directed edges: False, weighted: True, signed: False. This undirected network contains co-occurances of characters in Victor Hugo's novel 'Les Misérables'. A node represents a character and an edge between two nodes shows that these two characters appeared in the same chapter of the the book. The weight of each link indicates how often such a co-appear. Suitable for community detection benchmark, graph algorithm testing.