Bachelor of Science in Mathematics: Technical University of Munich
Master of Science in Statistics and Probability: Ecole Polytechnique (M1) and Université Paris Saclay (M2)
Efficient algorithms for information extraction on graphs.
We examine algorithms that extract information from a given graph which can be issued from an application or from random sampling. The information is typically obtained in the form of statistical, algebraic, or combinatorial invariants and serves in several applications: detection of a latent geometric structure, alignment of two graphs, or community identification. The main objective is to obtain theoretical guarantees for the functioning of the algorithms while assuring that they can be efficiently executed.