
Tag: mathematics


Revision of and reading aids for Clustering in Block Markov Chains
We have revised

INFORMS-APS 2019
Last week I travelled to Brisbane, Australia to attend two workshops, and to present our work on Clustering in Block Markov Chains at a conference called INFORMS-APS 2019. While the fourty-eight hours of travel were excruciatingly tiring (and don't get me started on the jetlag), attending these events was definitely worth it from an academic point of view.

ML Seminars: Clustering in Block Markov Chains
After presenting my poster at Stochastic Networks 2018 on our manuscript Optimal Clustering Algorithms in Block Markov Chains, I received invitations to present at the machine learning seminars of the Centrum Wiskunde & Informatica (CWI) in Amsterdam, as well as locally here at TU Delft. This post also provides you with our revised manuscript, which contains substantially extended results, as well asmy presentation.

Optimal clustering algorithms in Block Markov Chains
We have submitted Optimal Clustering Algorithms in Block Markov Chains, and it is currently under review. This is joint work between myself and Alexandre Proutiere. A preprint is available on arXiv.

Scaling limits and generic bounds for exploration processes
We have submitted Scaling limits and generic bounds for exploration processes, and it is currently under review. It is joint work between Paola Bermolen, Matthieu Jonckheere, and Jaron Sanders. A preprint is available on arXiv.

Stochastic Optimization of Large-Scale Complex Systems
I defended my thesis Stochastic Optimization of Large-Scale Complex Systems on January 28th, 2016 at the Eindhoven University of Technology. The defense was a great experience, and I have thoroughly enjoyed my time as a PhD student. The colleagues at the Stochastics Operations Research group and EURandom were great, and I’m also especially grateful to my supervisors Johan van Leeuwaarden and Sem Borst for all the unique opportunities.

Optimality gaps in asymptotic dimensioning of many-server systems
We have submitted Optimality gaps in asymptotic dimensioning of many-server systems, and it is currently under review. This is joint work between Jaron Sanders, Sem Borst, Johan van Leeuwaarden, and Guido Janssen. The arXiv preprint can be obtained via this link.

Online network optimization using product-form Markov processes
We have submitted Online Network Optimization Using Product-Form Markov Processes, and it is currently under review. It is joint work between Jaron Sanders, Sem Borst, and Johan van Leeuwaarden.

Optimal admission control for many-server systems with QED-driven revenues
We have submitted Optimal admission control for many-server systems with QED-driven revenues, and it is currently under review. It is joint work between Jaron Sanders, Sem Borst, Johan van Leeuwaarden, and Guido Janssen.