How to reconstruct a graph
If I give you a set of nodes, plus a way to find the distance between two nodes, how can you find all connections between these nodes as efficiently as possible?
No more detention: how to arrive on time with math
Getting to class on time isn't hard, if you leave on time and know the fastest route. But what’s the fastest route when the hallways are crowded? For their final high school project, Dylan and Tobias worked on finding the most efficient ways to navigate school during peak hours.
Brain under construction: what Inside Out gets right about your brain?
During our teenage years, everything changes. It’s no surprise that our brain does too. But how do we make sense of this transformation? Is there a way to quantify it? Networks might just be the answer.
What if the nodes in a network have feelings?
How can fairness be incorporated in algorithms that make decisions about people?
Martijn Gösgens wins Van Zwet Award for outstanding thesis
We are proud to share that Martijn Gösgens won the Van Zwet Award for his excellent research on community detection in random graphs. We had the pleasure of interviewing Martijn!
The puzzle of creating a puzzle
How to create curved Nonogram puzzles and why it may be harder than you think!
The friendship paradox - and how it might produce a biased world
Have you ever found yourself less popular when compared to your friends? Interestingly, in any group of individuals, on average, people have fewer friends than their friends do, or at the very most, an equal number. Not more!
Ding-Dong! Finally, your delivery driver is at your door
Elisabeth already has an idea in mind: she would like to find the fastest possible route that goes to each address exactly once before finally returning to the station. This task is a well-known mathematical problem, namely the Traveling Salesman Problem (TSP)! How can she solve it?
The path from a puzzle to a great theorem
In this article Maya continues her journey from Rotterdam to Brussels. She starts thinking about a puzzle from her childhood, the three utilities problem. At the end of the jouney she has reached a very important theorem from graph theory!
No five countries can all boarder each other
Looking on the world map you can easily spot four countries that border each other. But can you find five?