?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=https%3A%2F%2Fpublications.ut-capitole.fr%2Fid%2Feprint%2F21992%2F&rft.title=How+to+calculate+the+barycenter+of+a+weighted+graph&rft.creator=Gadat%2C+S%C3%A9bastien&rft.creator=Gavra%2C+Ioana&rft.creator=Risser%2C+Laurent&rft.subject=B-+ECONOMIE+ET+FINANCE&rft.description=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%2C+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%2C+translating+a+structural+specification+of+the+data.+Yet%2C+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%2C+we+develop+a+stochastic+algorithm+for+finding+the+Fr%C3%A9chet+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).&rft.publisher=TSE+Working+Paper&rft.date=2016-05&rft.type=Monograph&rft.type=NonPeerReviewed&rft.format=text&rft.language=fr&rft.identifier=https%3A%2F%2Fpublications.ut-capitole.fr%2Fid%2Feprint%2F21992%2F1%2FGadat_21992.pdf&rft.identifier=++Gadat%2C+S%C3%A9bastien+%3Chttps%3A%2F%2Fwww.idref.fr%2F080889433%3E%2C+Gavra%2C+Ioana+and+Risser%2C+Laurent++(2016)+How+to+calculate+the+barycenter+of+a+weighted+graph.++TSE+Working+Paper%2C+n.+16-652%2C+Toulouse+++++&rft.relation=http%3A%2F%2Ftse-fr.eu%2Fpub%2F30480&rft.language=en