How to calculate the barycenter of a weighted graph

Gadat, Sébastien, Gavra, Ioana and Risser, Laurent (2016) How to calculate the barycenter of a weighted graph. TSE Working Paper, n. 16-652, Toulouse

WarningThere is a more recent version of this item available.
[img]
Preview
Text
Download (1MB) | Preview
Official URL: http://tse-fr.eu/pub/30480

Abstract

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: Monograph (Working Paper)
Language: English
Date: May 2016
Place of Publication: Toulouse
Uncontrolled Keywords: metric graphs, Markov process, simulated annealing, homogeneization
Subjects: B- ECONOMIE ET FINANCE
Divisions: TSE-R (Toulouse)
Institution: Université Toulouse 1 Capitole
Site: UT1
Date Deposited: 30 May 2016 10:54
Last Modified: 07 Mar 2018 13:23
OAI ID: oai:tse-fr.eu:30480
URI: http://publications.ut-capitole.fr/id/eprint/21992

Available Versions of this Item

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year