I started learning how to read and write Chinese recently. In that time, I have often wanted to strangle the language by its metaphorical throat. In this blog post, I will explore the reasons behind my metaphysical hatred, and how I learned to redirect that hatred to thinking about linguistics.

Fascinating structure!

via: https://slimemoldtimemold.com/2026/04/30/links-for-april-2026/

When considering how things connect together in a network, time can be an extremely important factor. Dr Richard G Clegg of Queen Mary University London takes us through networks using Page rank and Lord of the Rings. nb. this film contains two fellas getting the facts of Lord of the Rings wrong on multiple occasions, we look forward to the inevitable comments.

This software looks cool as hell.

see: https://github.com/richardclegg/computerphile_demos/tree/906c01284e28bd33b83b60f51596045cf3a85b21/raphtory_lotr_demo

see: https://www.raphtory.com/

Navigate a repository using topic modeling

AI app design done right.

In mathematics, especially in the fields of universal algebra and graph theory, a graph algebra is a way of giving a directed graph an algebraic structure. It was introduced by McNulty and Shallon, and has seen many uses in the field of universal algebra since then.

!!

The modeling of polycule dynamics is an open question, but it can be best approximated from the Erdős–Rényi model of the random graph.

Following the first hyperlink in the main text of an English Wikipedia article, and then repeating the process for subsequent articles, usually leads to the Philosophy article. In February 2016, this was true for 97% of all articles on Wikipedia, an increase from 94.52% in 2011. The remaining articles lead to an article without any outgoing wikilinks, to pages that do not exist, or get stuck in loops.

see: https://en.wikipedia.org/wiki/Wikipedia_philosophy_phenomenon

I think this is the first highly technical Topos Institute blog post where I walked away and felt like I understood everything I was meant to understand. Heck yeah.

We study the following problem: given a collection H=(Hi‖1≤i≤n) of n graphs, each on n-1 vertices, when does there exist a graph G whose vertex-deleted subgraphs are the members of H?

Complementary back pocket problem.

via: https://www.youtube.com/watch?v=dWVCl4p-Zyc

Nice back pocket problem.

Exploring a new layout algorithm for control flow graphs.

via: https://folk.computer/newsletters/2025-08