Populations of Unlabelled Networks: Graph Space Geometry and Generalized Geodesic Principal Components

Abstract

Statistical analysis for populations of networks is widely applicable but challenging as networks have strongly non-Euclidean behaviour. Graph space is an exhaustive framework for studying populations of unlabelled networks which are weighted or unweighted, uni- or multi-layered, directed or undirected. Viewing graph space as the quotient of a Euclidean space with respect to a finite group action, we show that it is not a manifold, and that its curvature is unbounded from above. Within this geometrical framework we define generalized geodesic principal components, and we introduce the align all and compute algorithms, all of which allow for the computation of statistics on graph space. The statistics and algorithms are compared with existing methods and empirically validated on three real datasets, showcasing the framework potential utility. The whole framework is implemented within the geomstats Python package.