Online Barycenter Estimation of Large Weighted Graphs
Ioana Gavra, Laurent Risser

TL;DR
This paper introduces a scalable, real-time method for estimating the barycenter of large weighted graphs using observed node events, enabling applications like transportation and social network analysis.
Contribution
It presents a multiscale, divide-and-conquer approach for barycenter estimation that is efficient for large graphs and does not require explicit knowledge of node probabilities.
Findings
Effective on graphs with up to 1 million nodes
Comparable accuracy and stability to existing methods on small graphs
Operable on standard laptops for large-scale graphs
Abstract
In this paper, we propose a new method to compute the barycenter of large weighted graphs endowed with probability measures on their nodes. We suppose that the edge weights are distances between the nodes and that the probability measure on the nodes is related to events observed there. For instance, a graph can represent a subway network: its edge weights are the distance between two stations, and the observed events at each node are the subway users getting in or leaving the subway network at this station. The probability measure on the nodes does not need to be explicitly known. Our strategy only uses observed node related events to give more or less emphasis to the different nodes. Furthermore, the barycenter estimation can be updated in real time with each new event. We propose a multiscale extension of \cite{arXiv:1605.04148} where the decribed strategy is valid only for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Topological and Geometric Data Analysis · Advanced Clustering Algorithms Research
