Tootfinder

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph

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://

I've rebuilt all my stuff and had to solve Puppet Apply
Have some new toys in my tool chest, here's a little video of what I put together:
* Manages code checkout, validation, fixes unexpected changes
* Manages Puppet Agent/Apply runs so that it's safe and never more than a threshold concurrently at a time
* Has a management UI for deploying, triggering, querying etc managed nodes
All autonomous and hands off
All built with just 2 x 200 line YAM…

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://

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://

This https://arxiv.org/abs/2311.17774 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csIT_…

Enumeration of Minimum Weight Codewords of Pre-Transformed Polar Codes by Tree Intersection
Pre-transformed polar codes (PTPCs) form a class of codes that perform close to the finite-length capacity bounds. The minimum distance and the number of minimum weight codewords are two decisive properties for their performance. In this work, we propose an efficient algorithm for determining the number of minimum weight codewords of general PTPCs that eliminates all redundant visits to nodes of the search tree, thus reducing the computational complexity typically by several orders of magnitude…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

This https://arxiv.org/abs/2303.13965 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csNI_…

Generalized Distance Metric for Various DHT Routing Algorithms in Peer-to-Peer Networks
We present a generalized distance metric that can be used to implement routing strategies and identify routing table entries to reach the root node for a given key, in a DHT (Distributed Hash Table) network based on either Chord, Kademlia, Tapestry, or Pastry. The generalization shows that all the above four DHT algorithms are in fact, the same algorithm but with different parameters in distance representation. We also proposes that nodes can have routing tables of varying sizes based on their …

Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
Ricardo G\'omez A\'iza
https://arxiv.org/abs/2402.16111

Trees with flowers: A catalog of integer partition and integer composition trees with their asymptotic analysis
We present families of combinatorial classes described as trees with nodes that can carry one of two types of ``flowers'': integer partitions or integer compositions. Two parameters on the flowers of trees will be considered: the number of ``petals'' in all the flowers (petals' weight) and the number of edges in the petals of all the flowers (flowers' weight). We give explicit expressions of their generating functions and deduce general formulas for the asymptotic growth of their coefficients a…

With all this talk of how to find nodes in the DOM (other than using IDs or when those nodes have no ID), I am still a fan of XPath via dev tools:
https://adrianroselli.com/2021/04/xpath-for-in-browser-testing.html
For example, getting all nodes…

XPath for In-Browser Testing
Both Chrome and Firefox support XPath searches when in the DOM view of their dev tools. Because the browser cleans whatever HTML it encounters (closing tags, correcting nesting), XPath can operate on the code as XML. Simple checks like finding a unique ID value can result in multiple hits in…

us_air_traffic: U.S. air traffic
Yearly snapshots of flights among all commercial airports in the United States from 1990 to today. Metadata include passengers, distance, carrier, airport located city, state, and month of the flight.
This network has 2278 nodes and 6390340 edges.
Tags: Transportation, Airport, Unweighted, Metadata, Temporal

This https://arxiv.org/abs/2402.14221 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDC_…

Towards singular optimality in the presence of local initial knowledge
The Knowledge Till rho CONGEST model is a variant of the classical CONGEST model of distributed computing in which each vertex v has initial knowledge of the radius-rho ball centered at v. The most commonly studied variants of the CONGEST model are KT0 CONGEST in which nodes initially know nothing about their neighbors and KT1 CONGEST in which nodes initially know the IDs of all their neighbors. It has been shown that having access to neighbors' IDs (as in the KT1 CONGEST model) can substantial…

reuters: Reuters news stories (1987, 2000)
A bipartite network of Reuters news stories and words. Edges connect each story to all the words it contains.
This network has 1065176 nodes and 60569726 edges.
Tags: Informational, Language, Unweighted
https://networks.skewed.de/net/reuters

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

us_roads: United States roads (2000)
The road networks of the 50 US States and the District of Columbia based on UA Census 2000 TIGER/Line Files. Edges are stretches of road and vertices are intersections of roads. The data sets were assembled by Dominik Schultes. The 'merged' network contains all the states merged together.
This network has 300146 nodes and 328858 edges.
Tags: Transportation, Roads, Unweighted

This https://arxiv.org/abs/2311.03326 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Non-convex potential games for finding global solutions to sensor network localization
Sensor network localization (SNL) problems require determining the physical coordinates of all sensors in a network. This process relies on the global coordinates of anchors and the available measurements between non-anchor and anchor nodes. Attributed to the intrinsic non-convexity, obtaining a globally optimal solution to SNL is challenging, as well as implementing corresponding algorithms. In this paper, we formulate a non-convex multi-player potential game for a generic SNL problem to inves…

us_roads: United States roads (2000)
The road networks of the 50 US States and the District of Columbia based on UA Census 2000 TIGER/Line Files. Edges are stretches of road and vertices are intersections of roads. The data sets were assembled by Dominik Schultes. The 'merged' network contains all the states merged together.
This network has 474015 nodes and 607391 edges.
Tags: Transportation, Roads, Unweighted

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph

Did another node cleaning, first time with the fans on all of them. They work great cooling them, but also at getting dust of then. Judging by where the dust settles it was a good call to pull the air through instead of blow it in the nodes. But nothing a (paint)brush can't remove. All nodes where as clean as if they would be new when done.

Strategic Network Creation for Enabling Greedy Routing
Julian Berger, Tobias Friedrich, Pascal Lenzner, Paraskevi Machaira, Janosch Ruff
https://arxiv.org/abs/2403.15307

Strategic Network Creation for Enabling Greedy Routing
In this paper, we present the first game-theoretic network creation model that incorporates greedy routing, i.e., the agents in our model are embedded in some metric space and strive for creating a network where all-pairs greedy routing is enabled. In contrast to graph-theoretic shortest paths, our agents route their traffic along greedy paths, which are sequences of nodes where the distance in the metric space to the respective target node gets strictly smaller by each hop. Besides enabling gr…

Abusive nodes and identities that get leaked private addresses
Content that should be blocked (say "broccoli")
All that sort of just... Minimum viable

Fun #overpass query to show all the mapped murals in Berlin.
(Are there really no murals south of the Landwehrkanal?)
https://overpass-turbo.eu/s/1KbN

This https://arxiv.org/abs/2010.11880 has been replaced.
link: https://scholar.google.com/scholar?q=a

Fast Approximate CoSimRanks via Random Projections
Given a graph $G$ with $n$ nodes and two nodes $u,v\in G$, the {\em CoSimRank} value $s(u,v)$ quantifies the similarity between $u$ and $v$ based on graph topology. Compared to SimRank, CoSimRank is shown to be more accurate and effective in many real-world applications, including synonym expansion, lexicon extraction, and entity relatedness in knowledge graphs. The computation of all pairwise CoSimRanks in $G$ is highly expensive and challenging. Existing solutions all focus on devising approx…

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 23 nodes and 3197 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

Towards singular optimality in the presence of local initial knowledge
Hongyan Ji, Sriram V. Pemmaraju
https://arxiv.org/abs/2402.14221 https://

Towards singular optimality in the presence of local initial knowledge
The Knowledge Till rho CONGEST model is a variant of the classical CONGEST model of distributed computing in which each vertex v has initial knowledge of the radius-rho ball centered at v. The most commonly studied variants of the CONGEST model are KT0 CONGEST in which nodes initially know nothing about their neighbors and KT1 CONGEST in which nodes initially know the IDs of all their neighbors. It has been shown that having access to neighbors' IDs (as in the KT1 CONGEST model) can substantial…

Abusive nodes and identities that get leaked private addresses
Content that should be blocked (say "broccoli")
All that sort of just... Minimum viable

Fun #overpass query to show all the mapped murals in Berlin.
(Are there really no murals south of the Landwehrkanal?)
https://overpass-turbo.eu/s/1KbN

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://

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://

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 23 nodes and 3197 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

un_migrations: UN migration stock (2015)
A network of migration between countries, collected by the United Nations. A directed edge gives the flow of migration, and an edge property gives the number of migrants, for each given year and sex. Estimates are presented for 1990, 1995, 2000, 2005, 2010 and 2015 and are available for all countries and areas of the world. The estimates are based on official statistics on the foreign-born or the foreign population.
This network has 232 no…

un_migrations: UN migration stock (2015)
A network of migration between countries, collected by the United Nations. A directed edge gives the flow of migration, and an edge property gives the number of migrants, for each given year and sex. Estimates are presented for 1990, 1995, 2000, 2005, 2010 and 2015 and are available for all countries and areas of the world. The estimates are based on official statistics on the foreign-born or the foreign population.
This network has 232 no…

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

reuters: Reuters news stories (1987, 2000)
A bipartite network of Reuters news stories and words. Edges connect each story to all the words it contains.
This network has 1065176 nodes and 60569726 edges.
Tags: Informational, Language, Unweighted
https://networks.skewed.de/net/reuters

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

sp_primary_school: Primary school dynamic contacts (2009)
Two temporal networks of contacts among students and teachers at a primary school in Lyon, France, on consecutive days of in October 2009. Each network accumulates all contacts over the course of a single day; contacts were sampled at 20-second intervals.
This network has 242 nodes and 125773 edges.
Tags: Social, Offline, Weighted, Temporal, Metadata

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 105293 edges.
Tags: Biol…

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 105293 edges.
Tags: Biol…

us_air_traffic: U.S. air traffic
Yearly snapshots of flights among all commercial airports in the United States from 1990 to today. Metadata include passengers, distance, carrier, airport located city, state, and month of the flight.
This network has 2278 nodes and 6390340 edges.
Tags: Transportation, Airport, Unweighted, Metadata, Temporal

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 759923 nodes and 20546603 edges.
Tags: Informational, Web graph, Unweighted
https://networks.…

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 349 nodes and 1393 edges.
Tags: Informational, Web gra…

celegans_interactomes: C. elegans interactomes (2009)
Ten networks of protein-protein interactions in Caenorhabditis elegans (nematode), from yeast two-hybrid experiments, biological process maps, literature curation, orthologous interactions, and genetic interactions. The WI8 network combines WI2004, WI2007 and BPmaps, while the Integrated Network combines data from all sources.
This network has 2436 nodes and 136930 edges.
Tags: Biological, Protein interactions, Unweighte…

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 13 nodes and 63095 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

un_migrations: UN migration stock (2015)
A network of migration between countries, collected by the United Nations. A directed edge gives the flow of migration, and an edge property gives the number of migrants, for each given year and sex. Estimates are presented for 1990, 1995, 2000, 2005, 2010 and 2015 and are available for all countries and areas of the world. The estimates are based on official statistics on the foreign-born or the foreign population.
This network has 232 no…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

sp_primary_school: Primary school dynamic contacts (2009)
Two temporal networks of contacts among students and teachers at a primary school in Lyon, France, on consecutive days of in October 2009. Each network accumulates all contacts over the course of a single day; contacts were sampled at 20-second intervals.
This network has 242 nodes and 125773 edges.
Tags: Social, Offline, Weighted, Temporal, Metadata

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph

us_roads: United States roads (2000)
The road networks of the 50 US States and the District of Columbia based on UA Census 2000 TIGER/Line Files. Edges are stretches of road and vertices are intersections of roads. The data sets were assembled by Dominik Schultes. The 'merged' network contains all the states merged together.
This network has 448253 nodes and 539295 edges.
Tags: Transportation, Roads, Unweighted

digg_votes: Digg story votes (2009)
A bipartite network between users and stories on digg.com from 2009. Each user node connects to all story nodes on which that user voted. Edges are timestamped.
This network has 142962 nodes and 3018197 edges.
Tags: Economic, Preferences, Multigraph, Timestamps
https://

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

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://

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

un_migrations: UN migration stock (2015)
A network of migration between countries, collected by the United Nations. A directed edge gives the flow of migration, and an edge property gives the number of migrants, for each given year and sex. Estimates are presented for 1990, 1995, 2000, 2005, 2010 and 2015 and are available for all countries and areas of the world. The estimates are based on official statistics on the foreign-born or the foreign population.
This network has 232 no…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

epinions: Epinions product ratings (2005)
A bipartite network of users and the products they rated on the website Epinions.com. A user connects to all products on which that user entered a rating. Edge weight represents the rating score, and edges are timestamped.
This network has 876252 nodes and 13668320 edges.
Tags: Economic, Preferences, Timestamps, Weighted

budapest_connectome: Budapest Reference Connectome 3.0
A parameterizable consensus brain graph, derived from connectomes of 477 people, each computed from MRI datasets of the Human Connectome Project. Nodes are brain regions, and edges are weighted by the number of "tracks" that run between two nodes, as well as fiber length, fractional anisotropy and the number of occurrences in each of the 477 individuals.
This network has 1015 nodes and 71604 edges.
Tags: Biolo…

dbpedia_all: DBpedia network (v3.6)
A network among all entries in DBpedia, a project that extracts structured information from Wikipedia. Nodes represent entities in DBpedia and an edge connects two entities based on DBpedia's notion of their relatedness. The data is extracted from the version 3.6 of the database.
This network has 3966924 nodes and 13820853 edges.
Tags: Informational, Relatedness, Unweighted, Multigraph

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 13 nodes and 63095 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 300 nodes and 1155 edges.
Tags: Informational, Web gra…

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 433 nodes and 1941 edges.
Tags: Informational, Web gra…

epinions: Epinions product ratings (2005)
A bipartite network of users and the products they rated on the website Epinions.com. A user connects to all products on which that user entered a rating. Edge weight represents the rating score, and edges are timestamped.
This network has 876252 nodes and 13668320 edges.
Tags: Economic, Preferences, Timestamps, Weighted

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 348 nodes and 33250 edges.
Tags: Informational, Web gr…

us_roads: United States roads (2000)
The road networks of the 50 US States and the District of Columbia based on UA Census 2000 TIGER/Line Files. Edges are stretches of road and vertices are intersections of roads. The data sets were assembled by Dominik Schultes. The 'merged' network contains all the states merged together.
This network has 116920 nodes and 133415 edges.
Tags: Transportation, Roads, Unweighted

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 23 nodes and 3197 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

faculty_hiring: Faculty hiring networks (Comp. Sci., Business, History)
Three networks of faculty hiring in Computer Science Departments, Business Schools, and History Departments. Each node is a PhD-granting institution in the respective field, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2013). All data collected from faculty public rosters at the sampled institutions.
Thi…

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

us_air_traffic: U.S. air traffic
Yearly snapshots of flights among all commercial airports in the United States from 1990 to today. Metadata include passengers, distance, carrier, airport located city, state, and month of the flight.
This network has 2278 nodes and 6390340 edges.
Tags: Transportation, Airport, Unweighted, Metadata, Temporal

us_air_traffic: U.S. air traffic
Yearly snapshots of flights among all commercial airports in the United States from 1990 to today. Metadata include passengers, distance, carrier, airport located city, state, and month of the flight.
This network has 2278 nodes and 6390340 edges.
Tags: Transportation, Airport, Unweighted, Metadata, Temporal

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://

sp_primary_school: Primary school dynamic contacts (2009)
Two temporal networks of contacts among students and teachers at a primary school in Lyon, France, on consecutive days of in October 2009. Each network accumulates all contacts over the course of a single day; contacts were sampled at 20-second intervals.
This network has 242 nodes and 125773 edges.
Tags: Social, Offline, Weighted, Temporal, Metadata

tree-of-life: Protein interactomes across the tree of life (2019)
Protein-protein iteraction networks ("interactome") for 1,840 species. An interactome captures all physical protein-protein interactions within one species, from direct biophysical protein-protein interactions to regulatory protein-DNA and metabolic interactions. .
This network has 1124 nodes and 3993 edges.
Tags: Biological, Protein interactions

physics_collab: Multilayer physicist collaborations (2015)
Two multiplex networks of coauthorships among the Pierre Auger Collaboration of physicists (2010-2012) and among researchers who have posted preprints on arXiv.org (all papers up to May 2014). Layers represent different categories of publication, and an edge's weight indicates the number of reports written by the authors. These layers are one-mode projections from the underlying author-paper bipartite network.
This n…

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

un_migrations: UN migration stock (2015)
A network of migration between countries, collected by the United Nations. A directed edge gives the flow of migration, and an edge property gives the number of migrants, for each given year and sex. Estimates are presented for 1990, 1995, 2000, 2005, 2010 and 2015 and are available for all countries and areas of the world. The estimates are based on official statistics on the foreign-born or the foreign population.
This network has 232 no…

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

plant_pol_vazquez: Vazquez & Simberloff plant-pollinator webs
Eight bipartite networks of plants and pollinators, from the Nahuel Huapi National Park and surrounding areas in Rio Negro, Argentina, from September 1999 to Feburary 2000. Edge weights represent the frequency of species interaction, and there is a common set of vertices across all eight webs.
This network has 144 nodes and 36 edges.
Tags: Biological, Food web, Weighted, Multilayer

sp_baboons: Baboons' interactions (2020)
Network of interactions between a group of 20 Guinea baboons living in an enclosure of a Primate Center in France, between June 13th 2019 and July 10th 2019. The data set contains observational and wearable sensors data.
This network has 23 nodes and 3197 edges.
Tags: Social, Animal, Offline, Unweighted, Weighted, Temporal, Metadata

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://

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://

email_enron: Email network (Enron corpus)
The Enron email corpus, containing all the email communication from the Enron corporation, which was made public as a result of legal action. Nodes are email addresses and node i links to node j if i sent at least one email to address j. Non-Enron email addresses are also present, but only their links to/from Enron addresses are observed.
This network has 36692 nodes and 367662 edges.
Tags: Social, Communication, Unweighted, Multigr…

faculty_hiring_us: Faculty hiring networks in the US (2022)
Networks of faculty hiring for all PhD-granting US universities over the decade 2011–2020. Each node is a PhD-granting institution, and a directed edge (i,j) indicates that a person received their PhD from node i and was tenure-track faculty at node j during time of collection (2011-2020). This dataset is divided into separate networks for all 107 fields, as well as aggregate networks for 8 domains, and an overall network for …

us_air_traffic: U.S. air traffic
Yearly snapshots of flights among all commercial airports in the United States from 1990 to today. Metadata include passengers, distance, carrier, airport located city, state, and month of the flight.
This network has 2278 nodes and 6390340 edges.
Tags: Transportation, Airport, Unweighted, Metadata, Temporal

celegans_interactomes: C. elegans interactomes (2009)
Ten networks of protein-protein interactions in Caenorhabditis elegans (nematode), from yeast two-hybrid experiments, biological process maps, literature curation, orthologous interactions, and genetic interactions. The WI8 network combines WI2004, WI2007 and BPmaps, while the Integrated Network combines data from all sources.
This network has 6176 nodes and 178151 edges.
Tags: Biological, Protein interactions, Unweighte…

wikipedia_link: Wikipedia links (2016)
Networks of hyperlinks among articles on Wikipedia, for all available languages. A directed edge (i,j) indicates that article i hyperlinks to j.
This network has 257226 nodes and 15349731 edges.
Tags: Informational, Web graph, Unweighted
https://networks.…

celegans_interactomes: C. elegans interactomes (2009)
Ten networks of protein-protein interactions in Caenorhabditis elegans (nematode), from yeast two-hybrid experiments, biological process maps, literature curation, orthologous interactions, and genetic interactions. The WI8 network combines WI2004, WI2007 and BPmaps, while the Integrated Network combines data from all sources.
This network has 431 nodes and 438 edges.
Tags: Biological, Protein interactions, Unweighted

jester: Jester joke ratings (2001)
Two bipartite networks of users and jokes, extracted from the online joke recommender system Jester. A user connects to all jokes for which that user entered a rating. Edge weights give the rating score, scaled from -10 to 10. The two files differ by how many joke nodes are included, 100 or 150.
This network has 73521 nodes and 4136360 edges.
Tags: Economic, Preferences, Weighted

webkb: WebKB graphs (1998)
Web graphs crawled from four Computer Science departments in 1998, with each page manually classified into one of 7 categories: course, department, faculty, project, staff, student, or other. All graphs included in a single .zip; also included are 'co-citation' graphs, which links i and j if they both point to some k. Edge weights count the number of links from i to j.
This network has 334 nodes and 32988 edges.
Tags: Informational, Web gr…

sp_primary_school: Primary school dynamic contacts (2009)
Two temporal networks of contacts among students and teachers at a primary school in Lyon, France, on consecutive days of in October 2009. Each network accumulates all contacts over the course of a single day; contacts were sampled at 20-second intervals.
This network has 242 nodes and 125773 edges.
Tags: Social, Offline, Weighted, Temporal, Metadata