Tootfinder

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://

A nice graph from a Finnish report published today showing what #SmartCharging means: shifting the actual charging of an #EV to cheaper times - on average four hours later. It's stress-free for the user, good for the wallet and good for the grid, thanks to the automation provided by smart charg…

From data at hand, a rough estimate of Total Period Fertility Rate for Ireland. Broad outlines chime with the historical patterns seen in the cohort size data I looked at a couple of days ago: https://mastodon.social/@bthalpin/112002934060045318
A sustained decline…

"Britain's economy is highly London-centric. Without the capital, the UK would be poorer per head than Mississippi"
I wonder what these stats look like if you separate out Scotland. It's our energy they're using.

Here are the slides from my #knowledgegraphs lecture "Knowledge Graphs - Data, Information, Knowledge" from last week's Studium Generale "Vernetzte Kultur" at Philipps-Universität Marburg.
Slides: https://

Gephi Graph Viz is slow and clunky, you can't remove edges easily and it's, at least to me, an absolute pain to work in.
Is it Java's fault?

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

I've been investigating the decline of @… 's IRC channel. It's been in operation since late 2006 but has been getting pretty quiet of late.
I thought I'd analyse my logs to see what we're talking about. Here's my first attempt.
I think I should probably make it per day not per hour. A point per hour may be excessive for 17 years of data!
<…

More on female population estimates: a line graph of cohort vs a Lexis diagram (heatmap). The same info but curious how each makes the patterns partially clear in a different way. The linegraph gives a somewhat better picture by time, good by cohort when the patterns is clear but gets lost when they cross a lot. Lexis diagram makes cohort picture clearer: follow each row. But a little harder to see calendar time effects.
See

Heat pumps are a smart choice today. Smartness helps them deliver even greater comfort for homes, user budgets and the energy system over time.
https://www.linkedin.com/posts/jaapburger_clear-graph-shared-by-ja…

Jaap Burger on LinkedIn: Clear graph shared by Jan Rosenow (from his excellent Carbon Brief article…
Clear graph shared by Jan Rosenow (from his excellent Carbon Brief article debunking 18 heat pump myths: https://lnkd.in/eUJWupMX) showing the savings from…

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

Aligning Large Language Models to a Domain-specific Graph Database
Graph Databases (Graph DB) are widely applied in various fields, including finance, social networks, and medicine. However, translating Natural Language (NL) into the Graph Query Language (GQL), commonly known as NL2GQL, proves to be challenging due to its inherent complexity and specialized nature. Some approaches have sought to utilize Large Language Models (LLMs) to address analogous tasks like text2SQL. Nevertheless, when it comes to NL2GQL taskson a particular domain, the absence of domain…

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

Watched Gamers Nexus' benchmark review of #DragonsDogma2 and damn. No wonder the game is getting destroyed in reviews. Literally every CPU ends up being a bottleneck as soon as you hit any cluster of NPCs, which explains why the 1% and .1% FPS lows are so consistent down the chart. If you look at most performance HUDs, they wouldn't show a CPU bind, but PresentMon has added new …

Today I learned how to use #Octave to represent polynomials, find roots and produce its graph.

"Knowledge Graph Visualization Interface for Digital Heritage Collections: Design Issues and Recommendations" #KnowledgeGraphs

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewe…

Solving the Graph Burning Problem for Large Graphs
Felipe de Carvalho Pereira, Pedro Jussieu de Rezende, Tallys Yunes, Luiz Fernando Batista Morato
https://arxiv.org/abs/2404.17080

Solving the Graph Burning Problem for Large Graphs
We propose an exact algorithm for the Graph Burning Problem ($\texttt{GBP}$), an NP-hard optimization problem that models the spread of influence on social networks. Given a graph $G$ with vertex set $V$, the objective is to find a sequence of $k$ vertices in $V$, namely, $v_1, v_2, \dots, v_k$, such that $k$ is minimum and $\bigcup_{i = 1}^{k} \{u\! \in\! V\! : d(u, v_i) \leq k - i\} = V$, where $d(u,v)$ denotes the distance between $u$ and $v$. We formulate the problem as a set covering integ…

I'm looking at Irish population estimates (for a project on fertility) and this popped out. How female cohort size changes between 15-45, for cohorts from 1961. It tells quite a story.
#mastodaoine #demography

@… A usability issue I have with the app is that when I click the open graph image to a post, I expect it to open the link. Instead, it opens the graph image as a preview. I find this a frustrating experience in an otherwise great app.

#RustLang is doing great!
You've probably heard that #uv is the future of #Python packaging. Unfortunately, it indirectly depends on "ring" crate. Ring uses a lot of non-portable C/Assembly, effectively meaning that uv only runs on a handful of architectures (much fewer than Rust itself, and I've been complaining about Rust…).
Well, there are some good news. Rustls 0.23 no longer uses ring by default, so there's hope. But to realize that hope, first all dependency graph must switch to the new Rustls version, people need to make releases, update their locks…
Yes, it's a great design!
#Gentoo

Interesting overview from the German Automobile Association on the location of the #EV charging port on cars.
(Note that petrol cars have similar differences in the inlet nozzle)
https…

Enhancing Graph Representation Learning with Attention-Driven Spiking Neural Networks
Huifeng Yin, Mingkun Xu, Jing Pei, Lei Deng
https://arxiv.org/abs/2403.17040

Enhancing Graph Representation Learning with Attention-Driven Spiking Neural Networks
Graph representation learning has become a crucial task in machine learning and data mining due to its potential for modeling complex structures such as social networks, chemical compounds, and biological systems. Spiking neural networks (SNNs) have recently emerged as a promising alternative to traditional neural networks for graph learning tasks, benefiting from their ability to efficiently encode and process temporal and spatial information. In this paper, we propose a novel approach that in…

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
Halvard Hummel, Ayumi Igarashi
https://arXiv.org/abs/2401.14825 https://

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
We study the problem of allocating indivisible resources under the connectivity constraints of a graph $G$. This model, initially introduced by Bouveret et al. (published in IJCAI, 2017), effectively encompasses a diverse array of scenarios characterized by spatial or temporal limitations, including the division of land plots and the allocation of time plots. In this paper, we introduce a novel fairness concept that integrates local comparisons within the social network formed by a connected al…

Gotten a little curious ever since my last post https://mastodon.social/@cheeaun/112291603392332206 and… here's top 20 (Mastodon-API-compatible) servers with highest number of custom emojis.
List of servers from @…

If, and this is a big if, your job actually lets you take the time to understand problems and solve them well, you'll use them often.
So far in my job (Which is admittedly science-related, but remember I'm a UI engineer) I have used:
- graph traversal and layout algorithms
- search algorithms
- a ton of geometry
- non-linear scaling
- deferred update lists
- tree traversal algorithms
- data compression algorithms
- string search algorithms

edit_wikinews: Wikipedia news edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about news events. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 61822 nodes and 686017 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

Interessant artikel over ongelijkheid in Nature.
#nature

Why the world cannot afford the rich
Equality is essential for sustainability. The science is clear — people in more-equal societies are more trusting and more likely to protect the environment than are those in unequal, consumer-driven ones.

Graph Bayesian Optimization for Multiplex Influence Maximization
Zirui Yuan, Minglai Shao, Zhiqian Chen
https://arxiv.org/abs/2403.18866 https://

Graph Bayesian Optimization for Multiplex Influence Maximization
Influence maximization (IM) is the problem of identifying a limited number of initial influential users within a social network to maximize the number of influenced users. However, previous research has mostly focused on individual information propagation, neglecting the simultaneous and interactive dissemination of multiple information items. In reality, when users encounter a piece of information, such as a smartphone product, they often associate it with related products in their minds, such…

#SeniorFitness
I did 107 neutral-grip #pull-ups today in seven sets. Four sets were with 5 lbs. of ankle weights. I'm 68; I've been doing #calisthenics four years.
Yesterday …

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

Polyamorous Scheduling
Finding schedules for pairwise meetings between the members of a complex social group without creating interpersonal conflict is challenging, especially when different relationships have different needs. We formally define and study the underlying optimisation problem: Polyamorous Scheduling. In Polyamorous Scheduling, we are given an edge-weighted graph and try to find a periodic schedule of matchings in this graph such that the maximal weighted waiting time between consecutive occurrences o…

Challenges in Pre-Training Graph Neural Networks for Context-Based Fake News Detection: An Evaluation of Current Strategies and Resource Limitations
Gregor Donabauer, Udo Kruschwitz
https://arxiv.org/abs/2402.18179

Challenges in Pre-Training Graph Neural Networks for Context-Based Fake News Detection: An Evaluation of Current Strategies and Resource Limitations
Pre-training of neural networks has recently revolutionized the field of Natural Language Processing (NLP) and has before demonstrated its effectiveness in computer vision. At the same time, advances around the detection of fake news were mainly driven by the context-based paradigm, where different types of signals (e.g. from social media) form graph-like structures that hold contextual information apart from the news article to classify. We propose to merge these two developments by applying p…

Phrase of the Day
Tilting at Windmills – To contribute to #OpenSource projects that too few care about, and too many depend upon.
https://

Neuer Gastbeitrag in den #OMR Reviews über den Google Knowledge Graph und das Knowledge Panel von mir.
#knowledgepanel #knowledgegraph

Special issue of #tgdk Transactions on Graph Data & Knowledge with a focus on
Resources (benchmarks, datasets, engines, models, tools, etc.)
Deadline: June 3rd, 2024.
https://mastodon.social/@tgdk…

What a nice graph. I had not seen that kind of time-in-two-dimensions chart before.
https://blogs.esa.int/rocketscience/2024/02/05/ers-2-reentry-live-updates/

Graph Machine Learning in the Era of Large Language Models (LLMs)
Wenqi Fan, Shijie Wang, Jiani Huang, Zhikai Chen, Yu Song, Wenzhuo Tang, Haitao Mao, Hui Liu, Xiaorui Liu, Dawei Yin, Qing Li
https://arxiv.org/abs/2404.14928

Graph Machine Learning in the Era of Large Language Models (LLMs)
Graphs play an important role in representing complex relationships in various domains like social networks, knowledge graphs, and molecular discovery. With the advent of deep learning, Graph Neural Networks (GNNs) have emerged as a cornerstone in Graph Machine Learning (Graph ML), facilitating the representation and processing of graph structures. Recently, LLMs have demonstrated unprecedented capabilities in language tasks and are widely adopted in a variety of applications such as computer v…

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
Halvard Hummel, Ayumi Igarashi
https://arXiv.org/abs/2401.14825 https://

Keeping the Harmony Between Neighbors: Local Fairness in Graph Fair Division
We study the problem of allocating indivisible resources under the connectivity constraints of a graph $G$. This model, initially introduced by Bouveret et al. (published in IJCAI, 2017), effectively encompasses a diverse array of scenarios characterized by spatial or temporal limitations, including the division of land plots and the allocation of time plots. In this paper, we introduce a novel fairness concept that integrates local comparisons within the social network formed by a connected al…

Ooooops.

notre_dame_web: Webgraph (Notre Dame)
The web graph of Notre Dame University (nd.edu), as collected in 1999.
This network has 325729 nodes and 1497134 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/notre_dame_web

Special issue of #tgdk Transactions on Graph Data & Knowledge with a focus on
Resources (benchmarks, datasets, engines, models, tools, etc.)
Deadline: June 3rd, 2024.
https://mastodon.social/@tgdk…

Excellent graph showing the savings from running a heat pump versus a gas boiler (in this case for the UK); time-of-use, dynamic and smart tariffs increase these savings - and help the grid (lower peak demand), integrate more renewables (and therefore all system users).
From: @…

Jan Rosenow (@janrosenow@mastodon.energy)
Attached: 1 image Heat pumps can save people a lot of money. For that to happen the installation needs to be of high quality achieving a good efficiency. With a time of use or heat pump tariff the savings can be greater still. More in my heat pump myth buster Carbon Brief. https://www.carbonbrief.org/factcheck-18-misleading-myths-about-heat-pumps/

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…

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

On the Feasibility of Simple Transformer for Dynamic Graph Modeling
Dynamic graph modeling is crucial for understanding complex structures in web graphs, spanning applications in social networks, recommender systems, and more. Most existing methods primarily emphasize structural dependencies and their temporal changes. However, these approaches often overlook detailed temporal aspects or struggle with long-term dependencies. Furthermore, many solutions overly complicate the process by emphasizing intricate module designs to capture dynamic evolutions. In this w…

Synthetic Multimodal Dataset for Empowering Safety and Well-being in Home Environments
Takanori Ugai, Shusaku Egami, Swe Nwe Nwe Htun, Kouji Kozaki, Takahiro Kawamura, Ken Fukuda
https://arXiv.org/abs/2401.14743

Synthetic Multimodal Dataset for Empowering Safety and Well-being in Home Environments
This paper presents a synthetic multimodal dataset of daily activities that fuses video data from a 3D virtual space simulator with knowledge graphs depicting the spatiotemporal context of the activities. The dataset is developed for the Knowledge Graph Reasoning Challenge for Social Issues (KGRC4SI), which focuses on identifying and addressing hazardous situations in the home environment. The dataset is available to the public as a valuable resource for researchers and practitioners developing…

Ooooops.

netscience: Scientific collaborations in network science (2006)
A coauthorship network among scientists working on network science, from 2006. This network is a one-mode projection from the bipartite graph of authors and their scientific publications.
This network has 1589 nodes and 2742 edges.
Tags: Social, Collaboration, Weighted, Projection

What a nice graph. I had not seen that kind of time-in-two-dimensions chart before.
https://blogs.esa.int/rocketscience/2024/02/05/ers-2-reentry-live-updates/

google: Google internal webpages (2007)
A directed network of webpages from Google's own sites, and the hyperlinks among them. Edge direction indicates that i hyperlinks to j.
This network has 15763 nodes and 171206 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google

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

Enhancing Worker Recruitment in Collaborative Mobile Crowdsourcing: A Graph Neural Network Trust Evaluation Approach
Collaborative Mobile Crowdsourcing (CMCS) allows platforms to recruit worker teams to collaboratively execute complex sensing tasks. The efficiency of such collaborations could be influenced by trust relationships among workers. To obtain the asymmetric trust values among all workers in the social network, the Trust Reinforcement Evaluation Framework (TREF) based on Graph Convolutional Neural Networks (GCNs) is proposed in this paper. The task completion effect is comprehensively calculated by …

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.d…

Transactions on Graph Data & Knowledge (TGDK) is indexed now in the
Directory of Open Access Journals (DOAJ)
#knowledgegraphs

Transactions on Graph Data and Knowledge – DOAJ
A peer-reviewed, open access journal in graph algorithms, graph databases, graph representation learning, knowledge graphs, knowledge representation & linked data.

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.

Signed Graph Representation Learning: A Survey
Zeyu Zhang, Peiyao Zhao, Xin Li, Jiamou Liu, Xinrui Zhang, Junjie Huang, Xiaofeng Zhu
https://arxiv.org/abs/2402.15980

Signed Graph Representation Learning: A Survey
With the prevalence of social media, the connectedness between people has been greatly enhanced. Real-world relations between users on social media are often not limited to expressing positive ties such as friendship, trust, and agreement, but they also reflect negative ties such as enmity, mistrust, and disagreement, which can be well modelled by signed graphs. Signed Graph Representation Learning (SGRL) is an effective approach to analyze the complex patterns in real-world signed graphs with …

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://

Model, Analyze, and Comprehend User Interactions and Various Attributes within a Social Media Platform
Md Kaykobad Reza, S M Maksudul Alam, Yiran Luo, Youzhe Liu
https://arxiv.org/abs/2403.15937

Model, Analyze, and Comprehend User Interactions and Various Attributes within a Social Media Platform
How can we effectively model, analyze, and comprehend user interactions and various attributes within a social media platform based on post-comment relationship? In this study, we propose a novel graph-based approach to model and analyze user interactions within a social media platform based on post-comment relationship. We construct a user interaction graph from social media data and analyze it to gain insights into community dynamics, user behavior, and content preferences. Our investigation …

flickr_aminer: Flickr social graph
This network contains the social graph of flickr, a popular photo sharing network for users to upload photos and share photos, where a directed edge (i,j) means that user i follows user j.
This network has 214626 nodes and 9114557 edges.
Tags: Social, Online, Unweighted
https://

foldoc: FOLDOC entries (2002)
A network of hyperlinks among entries in the Free On-line Dictionary of Computing (FOLDOC, www.foldoc.org), an online dictionary of acronyms and technical terms for computers. An edge points from i to j if the term j is referred to in the entry for term i. Edge weight denotes number of uses of the same term.
This network has 13356 nodes and 120238 edges.
Tags: Informational, Web graph, Weighted

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
…

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewe…

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…

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://<…

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 68746 nodes and 51971 edges.

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.…

google: Google internal webpages (2007)
A directed network of webpages from Google's own sites, and the hyperlinks among them. Edge direction indicates that i hyperlinks to j.
This network has 15763 nodes and 171206 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google

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…

internet_as: Internet AS graph (2006)
A symmetrized snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from BGP tables posted by the University of Oregon Route Views Project. This snapshot was created on 22 July 2006.
This network has 22963 nodes and 48436 edges.
Tags: Technological, Communication, Unweighted

internet_top_pop: Internet topology (PoP level) (1969-2012)
Assorted snapshots of internet graph at the Point of Presence (PoP) level (which lies between the IP and AS levels), collected from around the world and at various times. The earliest snapshots are for ARPANET (1969-1972), with a few more from pre-2000. Most are from 2006 onward. Metadata include link type or speed, longitudes, and latitudes of nodes, URL, and date of record.
This network has 25 nodes and 24 edges.

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 4197 nodes and 18841 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

edit_wikinews: Wikipedia news edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about news events. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 6031 nodes and 125544 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 14166 nodes and 79460 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

edit_wikinews: Wikipedia news edits (2010)
Two bipartite user-page networks extracted from Wikipedia, about news events. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 4946 nodes and 23441 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

foldoc: FOLDOC entries (2002)
A network of hyperlinks among entries in the Free On-line Dictionary of Computing (FOLDOC, www.foldoc.org), an online dictionary of acronyms and technical terms for computers. An edge points from i to j if the term j is referred to in the entry for term i. Edge weight denotes number of uses of the same term.
This network has 13356 nodes and 120238 edges.
Tags: Informational, Web graph, Weighted

student_cooperation: Student cooperation (2012)
Network of cooperation among students in the "Computer and Network Security" course at Ben-Gurion University, in 2012. Nodes are students, and edges denote cooperation between students while doing their homework. The graph contains three types of links: Time, Computer, Partners.
This network has 185 nodes and 360 edges.
Tags: Social, Offline, Multigraph, Unweighted

netscience: Scientific collaborations in network science (2006)
A coauthorship network among scientists working on network science, from 2006. This network is a one-mode projection from the bipartite graph of authors and their scientific publications.
This network has 1589 nodes and 2742 edges.
Tags: Social, Collaboration, Weighted, Projection

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…

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://<…

google: Google internal webpages (2007)
A directed network of webpages from Google's own sites, and the hyperlinks among them. Edge direction indicates that i hyperlinks to j.
This network has 15763 nodes and 171206 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.d…

as_skitter: Skitter IP graph (2005)
An aggregate snapshot of the Internet Protocol (IP) graph, as measured by the traceroute tool on CAIDA's skitter infrastructure, in 2005.
This network has 1696415 nodes and 11095298 edges.
Tags: Technological, Communication, Unweighted
https://networks.skewed.d…

football_tsevans: NCAA college football 2000 (corrected metadata)
A network of American football games between Division IA colleges during regular season Fall 2000. This version contains some corrections made by T. S. Evans, in particular:.
This network has 115 nodes and 613 edges.
Tags: Social, Sports, Unweighted
https://<…

berkstan_web: Webgraph (Berkeley-Stanford)
The web graph of Berkeley and Stanford Universities (berkeley.edu and stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 685231 nodes and 7600595 edges.
Tags: Informational, Web graph, Unweighted
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…

myspace_aminer: MySpace social graph
This network contains the social graph of MySpace, a social networking website which also has a strong music emphasis. A directed edge (i,j) means that user i follows user j.
This network has 854498 nodes and 6489736 edges.
Tags: Social, Online, Unweighted
https://

edit_wikiquote: Wikiquote edits (2010)
A bipartite user-page network extracted from Wikiquotes. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 19818 nodes and 100424 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

google: Google internal webpages (2007)
A directed network of webpages from Google's own sites, and the hyperlinks among them. Edge direction indicates that i hyperlinks to j.
This network has 15763 nodes and 171206 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewed.de/net/google

wikipedia_growth: en-Wikipedia links (2007)
The network of hyperlinks among English wikipedia pages, in 2007. An edge (i,j) indicates that article i hyperlinks to article j, and each edge is timestamped with its creation.
This network has 1870709 nodes and 39953145 edges.
Tags: Informational, Web graph, Unweighted, Timestamps

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

topology: Internet AS graph (2004)
An integrated snapshot of the structure of the Internet at the level of Autonomous Systems (ASs), reconstructed from multiple sources, including the RouteViews and RIPE BGP trace collectors, route servers, looking glasses, and the Internet Routing Registry databases. This snapshot was created around October 2004.
This network has 34761 nodes and 171403 edges.
Tags: Technological, Communication, Unweighted, Multigraph, Timestamps

lastfm_aminer: Last.fm social graph
This network contains the social graph of last.fm, a site that provides a streaming radio service, where users can search music and get personalized recommendation. A directed edge (i,j) means that user i follows user j.
This network has 136409 nodes and 1685524 edges.
Tags: Social, Online, Unweighted

edit_wiktionary: Wiktionary edits (2010)
Three bipartite user-page networks extracted from Wiktionary, for French, German, and English. A user connects to a page if that user edited that page. Edits (edges) are timestamped. Edge weights represent counts of the number of edits.
This network has 46386 nodes and 182251 edges.
Tags: Informational, Web graph, Multigraph, Timestamps

foldoc: FOLDOC entries (2002)
A network of hyperlinks among entries in the Free On-line Dictionary of Computing (FOLDOC, www.foldoc.org), an online dictionary of acronyms and technical terms for computers. An edge points from i to j if the term j is referred to in the entry for term i. Edge weight denotes number of uses of the same term.
This network has 13356 nodes and 120238 edges.
Tags: Informational, Web graph, Weighted

livejournal_aminer: Livejournal social graph
This network contains the social graph of Livejournal, a free on-line social network where users can keep a blog, journal or diary, where a directed edge (i,j) means that user i follows user j.
This network has 3017286 nodes and 87037567 edges.
Tags: Social, Online, Unweighted
…

stanford_web: Webgraph (Stanford)
The web graph of Stanford University (stanford.edu), as collected in 2002. Nodes represent pages and directed edges represent hyperlinks between them.
This network has 281904 nodes and 2312497 edges.
Tags: Informational, Web graph, Unweighted
https://networks.skewe…