The main subject of my PhD research is community detection, a subfield of network science that is interested in identifying groups of nodes that are more densely connected internally than externally. Such communities could, for example, correspond to groups of friends on social media or fields of study in citation networks.
As the start of my PhD happened to coincide with the start of the Corona pandemic, I am also modeling the effect of mobility measures against the spread of COVID-19. An interview about this project can be found in this article by the Cursor.
For the Network Pages, a project by the Networks Center, I develop interactive visualizations that help explain network theory in a way that can be understood by non-mathematicians. An example of such a visualization is given below, taken from this blogpost about bottleneck detection algorithms.
As a student assistent, I assisted lecturers with various teaching tasks such as reviewing programming assignments, answering student questions during instructions and even giving a few lectures.
ViNotion is a specialist in the field of automated video content analysis that uses image recognition to analyze traffic. For ViNotion I used a game engine to generate synthetic datasets with ground truth. This data can be used to validate the performance of the products and to experiment with training on synthetic data.
The Web committee manages the website, app and administration database of Fellenoord, Eindhoven’s student tennis association.
Wolfpack is a software company based on the TU/e campus.Projects:
For AthenaStudies, I gave exam trainings to help a group of first year Industrial Engineering students prepare for their mathematics resit.
In the spring of 2019, I did a 3-month internship at Yandex and MIPT in Moscow. In this internship, we analysed various cluster similarity indices that are used for validating clusterings to a known ground truth. In particular, we gave special attention to properties that are relevant to the application of community detection, where the vertices of a graph are clustered based on their connectivity. A preprint of the resulting paper is available on arXiv.
For the completion of the Bachelor Applied Mathematics, I analysed a stochastic degradation model and created an algorithm to obtain the optimal maintenance policy. This work has been rewarded with a 9.5/10. The thesis can be found here.
With a specialization in Statistics, Probability and Operations Research.
Together with a friend, we have been occasionally brewing beer in the last few years. Unfortunately, the beer is not commercially available.
Since living in Moscow, I have been studying the Russian language. I follow classes in the Netherlands and practice by chatting with cab drivers whenever I'm in Russia.