I did my degree in Mathematics and a master in Applied Mathematics at Universitat Politècnica de Catalunya (UPC). In 2013 I defended my PhD Thesis at UPC under the supervision of Oriol Serra. From 2013 to 2015 I had the opportunity to be a CARP Postdoc Fellow at McGill University, working with Bruce Reed and Louigi Addario-Berry. From 2016 to 2019 I was a Lecturer in the Combinatorics, Probability and Algorithms group at the University of Birmingham. Since 2019 I am an Associate Professor in GAPCOMB at UPC.
Probabilistic and Extremal Combinatorics, Random Combinatorial Structures, Stochastic Processes on Graphs and Randomized Algorithms.
S. Chen, M. Delcourt, A. Moitra, G. Perarnau, L. Postle, Improved bounds for sampling col- orings via linear programming. Proceedings of the Thirstiest Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 2216-2234.
G. Chapuy and G. Perarnau. Connectivity in bridge-addable graph classes: the McDiarmid- Steger-Welsh conjecture. J. of Comb. Theory, Series B 136(C):44-71, 2019. (Extended abstract appeared in SODA 2016.)
F. Joos and G. Perarnau. Critical percolation on random regular graphs. Proceedings of the American Mathematical Society, 146,3321-3332, 2018.
F. Joos, G. Perarnau, D. Rautenbach and B. Reed. How to determine if a random graphwith a fixed degree sequence has a giant component. Probability Theory and Related Fields 170 (1-2):263–310, 2018. (Extended abstract appeared in FOCS 2016.)
G. Perarnau. A probabilistic approach to consecutive pattern avoiding in permutations, Journal of Combinatorial Theory, Series A, 120(5):998-1011, 2013.