trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://netw…
I need cake.
amazon_copurchases: Amazon co-purchasing network (2003)
Network of items for sale on amazon.com in 2003 and the items they "recommend" (via the "Customers Who Bought This Item Also Bought" feature). If one item is frequently co-purchased with another, then the first item recommends the second.
This network has 403394 nodes and 3387388 edges.
Tags: Economic, Commerce, Unweighted
Real Losers – Time To Lose [2003, full album]
#FediRadio
amazon_copurchases: Amazon co-purchasing network (2003)
Network of items for sale on amazon.com in 2003 and the items they "recommend" (via the "Customers Who Bought This Item Also Bought" feature). If one item is frequently co-purchased with another, then the first item recommends the second.
This network has 410236 nodes and 3356824 edges.
Tags: Economic, Commerce, Unweighted
wiki_rfa: Wikipedia RfA voting network (2013)
The set of all votes on Requests for Adminships (RfA), from 2003 to May 2013, represented as a directed, signed network in which nodes represent Wikipedia members and edges represent votes.
This network has 11381 nodes and 198275 edges.
Tags: Social, Relationships, Signed
https://
trec_web: TREC WT10g (2003)
A web graph network originally constructed in 2003 as a testbed for information-retrieval techniques, including web search engines. Distributed by University of Glasgow.
This network has 1601787 nodes and 8063026 edges.
Tags: Informational, Web graph, Unweighted
https://netw…
arxiv_authors: Arxiv authors (1993-2003)
Scientific collaborations between authors of papers submitted to arxiv.org, under 5 categories: gr-qc, astro-ph, cond-mat, hep-ph, and hep-th categories, spanning January 1993 to April 2003. If an author i co-authored a paper with author j, the graph contains a undirected edge from i to j. If the paper is co-authored by k authors this generates a completely connected (sub)graph on k nodes.
This network has 89209 nodes and 237010 edges.