Tim Hulshof is tenure track assistant professor with the Probability and Statistics group at the department of Mathematics and Computer Science. His research is part of the 'Networks' consortium funded by the Dutch science foundation NWO through its Gravitation program. Networks is a consortium of eleven mathematics and computer science researchers from four institutions who aim to address the pressing challenges posed by large-scale networks. Not just digital networks but also traffic and transport networks and energy networks are often not sufficiently capable of dealing with unexpected situations. The focus is on modelling, understanding, controlling and optimising networks that are complex and highly volatile.
Tim Hulshof studied Physics at the University of Groningen (the Netherlands) where he obtained his MSc in 2009 with the distinction cum laude and. He was awarded the Kamerlingh Onnes Prize for best cum laude student in physics at the University of Groningen in the academic year 2008-2009. He then started his PhD research at Eindhoven University of Technology (TU/e, the Netherlands) under supervision of Prof. Remco van der Hofstad of the Probability and Statistics group (department of Mathematics and Computer Science). In 2013, he obtained his doctorate with the thesis 'The high-dimensional incipient infinite cluster'. In the same year he was awarded the first UBC-PIMS distinguished postdoctoral fellowship from the University of British Columbia and the Pacific Institute of the Mathematical Sciences (Vancouver, Canada). In 2015, he returned to the TU/e Probability and Statistics group where he was appointed as tenure track assistant professor. He is an editor for networkpages.nl, an outreach website about the science of networks aimed at a general audience.
Sharpness for inhomogeneous percolation on quasi-transitive graphsStatistics and Probability Letters (2019)
Higher order corrections for anisotropic bootstrap percolationProbability Theory and Related Fields (2018)
Random walk on barely supercritical branching random walkarXiv (2018)
Structures in supercritical scale-free percolationAnnals of Applied Probability (2017)
Connectivity threshold for random subgraphs of the hamming graphElectronic Communications in Probability (2016)
- Probability and stochastics 2
- Extreme values and other catastrophes
No ancillary activities