, Remerciements : Ce travail aété réalisé dans le cadre du projet ACADEMICS soutenu par le Projet IDEXLYON de l'Université de Lyon dans le cadre du Programme Investissements d'Avenir

. Références,

E. Abbe, Community detection and stochastic block models. Foundations and Trends in Communications and Information Theory, vol.14, pp.1-162, 2018.
DOI : 10.1561/0100000067

N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy, Optimal transport for domain adaptation, IEEE Trans. Pattern Anal. Mach. Intell, vol.39, issue.9, pp.1853-1865, 2017.
DOI : 10.1109/tpami.2016.2615921
URL : https://hal.archives-ouvertes.fr/hal-01170705

M. Cuturi, Sinkhorn distances: Lightspeed computation of optimal transport, NIPS 2013, pp.2292-2300, 2013.

M. Defferrard, L. Martin, R. Pena, and N. Perraudin, Pygsp: Graph signal processing in python, 2017.

Y. Deshpande, S. Sen, A. Montanari, and E. Mossel, Contextual stochastic block models, NeurIPS, pp.8590-8602, 2018.

R. Flamary and N. Courty, Pot python optimal transport library, 2017.

M. J. Thomas, E. M. Fruchterman, and . Reingold, Graph drawing by force-directed placement, Softw., Pract. Exper, vol.21, issue.11, pp.1129-1164, 1991.

T. Vayer, L. Chapel, R. Flamary, R. Tavenard, and N. Courty, Optimal transport for structured data, 2018.