About me: I received a PhD in Applied Mathematics from the Polytechnic University of Catalonia, in Barcelona. A big part of my research was conducted in Pompeu Fabra University. During my PhD studies, I also spent some time visiting at the Sorbonne University. Prior to this, I completed a master degree in Logic, Algorithms, and Theory of Computation, through a collaborative program between the Technical University of Athens and the National and Kapodistrian University of Athens, where I also earned my undergraduate degree in Mathematics.
Most recently, I was a postdoctoral researcher at the Einstein Institute of Mathematics, at the Hebrew University of Jerusalem. I am currently living in the US. I am seeking to transition to industry, where I can leverage my research experience and my excitement for current breakthroughs in machine learning and AI. Check out my linkedin page and Github.
I defended my PhD thesis on September 17, 2021, supervised by Gábor Lugosi and Juanjo Rué. Title: A study on structure recovery and the broadcasting problem. ( link )
'Inference in balanced community modulated recursive trees', with Anna Ben-Hamou. Bernoulli. 31.1 (2025): 457-483. (link, arxiv)
'Broadcasting on random recursive trees', with Louigi Addario-Berry, Gábor Lugosi, and Luc Devroye. Annals of Applied Probability. Volume: 32, Number: 1, 2022. ( link , arXiv )
An extension for the case q>1/2 in the preferential attachment model can be found in my PhD thesis .
'Learning partial correlation graphs and graphical models by covariance queries', with Gábor Lugosi, Jakub Truszkowski, and Piotr Zwiernik. Journal of Machine Learning research, Volume: 22, Number: 203, 2021. ( link , arXiv )
'Structure and enumeration of K4-free links and link diagrams', with Juanjo Rué and Dimitrios M. Thilikos. European Journal of Combinatorics, Volume 89, 2020. ( link , arXiv , maple )
'Minor-Obstructions for Apex Sub-unicyclic Graphs', with Alexandros Leivaditis, Alexandros Singh, Giannos Stamoulis, Dimitrios M. Thilikos, and Konstantinos Tsatsanis. Discrete Applied Mathematics, Volume 284, 2020. ( link , arXiv , maple )
'Encoding and avoiding 2-connected patterns in polygon dissections and outerplanar graphs'. Discrete Mathematics, Volume 341, Issue 12, December 2018. ( link , arXiv , maple)