JOB DESCRIPTION

Join our ambitious research team as a postdoctoral researcher in the prestigious NWO VICI project on geometric approaches to shortest paths in complex networks!

WHO ARE WE LOOKING FOR?

We’re looking for a curious and motivated researcher with the following profile:

• A Ph.D. (or near completion) in network science, mathematics, theoretical computer science, or a related field.
• A strong background in graph theory and complex networks.
• Ideally, familiarity with geometric graph models and non-Euclidean geometry.
• Programming experience in Python, C, or C++.
• A track record of peer-reviewed publications.
• Enthusiasm for presenting at conferences and workshops.
• A collaborative mindset and interest in co-supervising Ph.D. and M.Sc. students.
• Excitement for working on high-risk, high-reward research with real-world impact.

You will develop theoretical insights into shortest paths in geometric network models, including but not limited to:

• (Soft) Random Geometric Graphs
• Geometric Inhomogeneous Random Graphs
• Random Hyperbolic Graphs

You will explore problems such as:

• Establishing geometric bounds on shortest-path alignment
• Reconstructing shortest paths from partial or noisy data
• Predicting deviations in perturbed or evolving networks

You will work closely with a second postdoc focused on inference, as well as with Ph.D. students in the team. Opportunities for co-supervision, application-focused collaborations (e.g., in Telecom and Bioinformatics), and international conference participation are embedded in the project.