Dynamic graphs, community detection, and Riemannian geometry.

ABSTRACT: A community is a subset of a wider network where the members of that subset are more strongly connected to each other than they are to the rest of the network. In this paper, we consider the problem of identifying and tracking communities in graphs that change over time - dynamic community detection - and present a framework based on Riemannian geometry to aid in this task. Our framework currently supports several important operations such as interpolating between and averaging over graph snapshots. We compare these Riemannian methods with entry-wise linear interpolation and find that the Riemannian methods are generally better suited to dynamic community detection. Next steps with the Riemannian framework include producing a Riemannian least-squares regression method for working with nois

SUBMITTER: Bakker C 

PROVIDER: S-EPMC6214282 | biostudies-literature | 2018

REPOSITORIES: biostudies-literature