Gadat, Sébastien, Gavra, Ioana and Risser, Laurent (2018) How to calculate the barycenter of a weighted graph. Mathematics of Operations Research, 43 (4). pp. 1051-1404.

This is the latest version of this item.

[thumbnail of wp_tse_652.pdf]
Download (1MB) | Preview


Discrete structures like graphs make it possible to naturally and exibly model complex phenomena. Since graphs that represent various types of information are increasingly available today, their analysis has become a popular subject of research. The graphs studied in the field of data science at this time generally have a large number of nodes that are not fairly weighted and connected to each other, translating a structural specification of the data. Yet, even an algorithm for locating the average position in graphs is lacking although this knowledge would be of primary interest for statistical or representation problems. In this work, we develop a stochastic algorithm for finding the Fréchet mean of weighted undirected metric graphs. This method relies on a noisy simulated annealing algorithm dealt with using homogenization. We then illustrate our algorithm with two examples (subgraphs of a social network and of a collaboration and citation network).

Item Type: Article
Language: English
Date: November 2018
Refereed: Yes
Uncontrolled Keywords: metric graphs, Markov process, simulated annealing, homogeneization
Divisions: TSE-R (Toulouse)
Site: UT1
Date Deposited: 15 Jun 2017 07:57
Last Modified: 02 Apr 2021 15:55
OAI Identifier:

Available Versions of this Item

View Item


Downloads per month over past year