Graphons, graphings, graphops Antoine Poulin Université McGill Résumé On s'intéresse aux théories de limites de graphes. Dans ces théories, on compactifie l'espace des graphes (possiblement venant de modèles aléatoires), par […]
Supervised and unsupervised comparison of 30 community detection algorithms reveal that proximity to globally optimal partitions matters Samin Aref University of Toronto Résumé Network clustering (descriptive community detection) is a […]
Best Current Parallel in Time Methods for Parabolic and Hyperbolic Problems Martin J. Gander Université de Genève, Suisse Résumé Space-time parallel methods, also known more recently under the name PinT (Parallel […]