Date - Heure / Date - Hour
Date(s) - 23/02/2017
11h00 - 12h00
Emplacement / Location
ENAC, Building Breguet, Amphi Breguet
How to calculate the barycenter of a (large) graph?.
This talk aims to describe an algorithm for locating the barycenter of discrete structures like weighted graphs. Such structures are commonly used for database description, or for modeling internet communication modeling, road or airline traffic, etc. The computation of this kind of structure, for a possibly very large graph, induces some important difficulties that come from the optimization of non convex functions. We describe in this talk a new algorithm to compute the barycenter of a weighted graph (nodes and edges), through an homogenized simulated annealing process. Then, we prove the convergence of this method. Finally, we elucidate the very important question ;): <>, through an application on a citation graph of more than 13 000 nodes. This is a joint work with I. Gavra (PhD Student), L. Miclo (DR CNRS) and L. Risser (IR CNRS) .
Sébastien Gadat, TSE, Toulouse.