Graphon estimation beyond binary edges: inference for decorated graphs with applications to multiplex and weighted networks
Inference for decorated graphons: beyond binary relationships.
Download Paper | Download Slides | Code
Inference for decorated graphons: beyond binary relationships.
Published in NeurIPS 2026, 2026
Graphon estimation as a continuous optimal-transport problem with a provable discrete limit.
Extending decorated graphon estimation to networks that evolve over time.
Published:
Published:
Published:
Poster with Sofia C. Olhede on inference for decorated graphs and its application to multiplex networks.
Published:
Published:
I also co-organised the session Using Julia: fast, reproducible, composable at the same conference.
Undergraduate course, EPFL, Section of Mathematics, 2019
Teaching assistant for Emeric Thibaud
Graduate course, EPFL, Section of Mathematics, 2021
Teaching assistant for Guillaume Obozinski.
Undergraduate course, EPFL, Section of Mathematics, 2023
Teaching assistant for Tomas Masák.
Graduate course, EPFL, Section of Mathematics, 2023
Teaching assistant for Mhalla Ep Marchand Linda. Course website: here
Undergraduate course, EPFL, Section of Mathematics, 2024
Teaching assistant for Prof. Sofia Olhede.
Graduate course, EPFL, Section of Mathematics, 2024
Teaching assistant for Mhalla Ep Marchand Linda. Course website: here