Local2Global: a distributed approach for scaling representation learning on graphs

We propose a decentralised “local2global” approach to graph representation learning, that one can a-priori use to scale any embedding technique. Our local2global approach proceeds by first dividing the input graph into overlapping subgraphs (or “patches”) and training local representations for each patch independently. In a second step, we combine the local representations into a globally consistent representation by estimating the set of rigid motions that best align the local representations using information from the patch overlaps, via group synchronization. A key distinguishing feature of local2global relative to existing work is that patches are trained independently without the need for the often costly parameter synchronization during distributed training. This allows local2global to scale to large-scale industrial applications, where the input graph may not even fit into memory and may be stored in a distributed manner. We apply local2global on data sets of different sizes and show that our approach achieves a good trade-off between scale and accuracy on edge reconstruction and semi-supervised classification. We also consider the downstream task of anomaly detection and show how one can use local2global to highlight anomalies in cybersecurity networks

Raphtory: The temporal graph engine for Rust and Python

Raphtory is a platform for building and analysing temporal networks. The library includes methods for creating networks from a variety of data sources; algorithms to explore their structure and evolution; and an extensible GraphQL server for deployment of applications built on top. Raphtory’s core engine is built in Rust, for efficiency, with Python interfaces, for ease of use. Raphtory is developed by network scientists, with a background in Physics, Applied Mathematics, Engineering and Computer Science, for use across academia and industry

Resting state network modularity along the prodromal late onset Alzheimer's disease continuum

Alzheimer's disease is considered a disconnection syndrome, motivating the use of brain network measures to detect changes in whole-brain resting state functional connectivity (FC). We investigated changes in FC within and among resting state networks (RSN) across four different stages in the Alzheimer's disease continuum. FC changes were examined in two independent cohorts of individuals (84 and 58 individuals, respectively) each comprising control, subjective cognitive decline, mild cognitive impairment and Alzheimer's dementia groups. For each participant, FC was computed as a matrix of Pearson correlations between pairs of time series from 278 gray matter brain regions. We determined significant differences in FC modular organization with two distinct approaches, network contingency analysis and multiresolution consensus clustering. Network contingency analysis identified RSN sub-blocks that differed significantly across clinical groups. Multiresolution consensus clustering identified differences in the stability of modules across multiple spatial scales. Significant modules were further tested for statistical association with memory and executive function cognitive domain scores. Across both analytic approaches and in both participant cohorts, the findings converged on a pattern of FC that varied systematically with diagnosis within the frontoparietal network (FP) and between the FP network and default mode network (DMN). Disturbances of modular organization were manifest as greater internal coherence of the FP network and stronger coupling between FP and DMN, resulting in less segregation of these two networks. Our findings suggest that the pattern of interactions within and between specific RSNs offers new insight into the functional disruption that occurs across the Alzheimer's disease spectrum

Think locally, act locally: Detection of small, medium-sized, and large communities in large networks

It is common in the study of networks to investigate intermediate-sized (or “meso-scale”) features to try to gain an understanding of network structure and function. For example, numerous algorithms have been developed to try to identify “communities,” which are typically construed as sets of nodes with denser connections internally than with the remainder of a network. In this paper, we adopt a complementary perspective that “communities” are associated with bottlenecks of locally-biased dynamical processes that begin at seed sets of nodes, and we employ several different community-identification procedures (using diffusion-based and geodesic-based dynamics) to investigate community quality as a function of community size. Using several empirical and synthetic networks, we identify several distinct scenarios for “size-resolved community structure” that can arise in real (and realistic) networks: (i) the best small groups of nodes can be better than the best large groups (for a given formulation of the idea of a good community); (ii) the best small groups can have a quality that is comparable to the best medium-sized and large groups; and (iii) the best small groups of nodes can be worse than the best large groups. As we discuss in detail, which of these three cases holds for a given network can make an enormous difference when investigating and making claims about network community structure, and it is important to take this into account to obtain reliable downstream conclusions. Depending on which scenario holds, one may or may not be able to successfully identify “good” communities in a given network (and good communities might not even exist for a given community quality measure), the manner in which different small communities fit together to form meso-scale network structures can be very different, and processes such as viral propagation and information diffusion can exhibit very different dynamics. In addition, our results suggest that, for many large realistic networks, the output of locally-biased methods that focus on communities that are centered around a given seed node might have better conceptual grounding and greater practical utility than the output of global community-detection methods. They also illustrate subtler structural properties that are important to consider in the development of better benchmark networks to test methods for community detection