DeepAI AI Chat
Log In Sign Up

Spectral embedding for dynamic networks with stability guarantees

by   Ian Gallagher, et al.

We consider the problem of embedding a dynamic network, to obtain time-evolving vector representations of each node, which can then be used to describe the changes in behaviour of a single node, one or more communities, or the entire graph. Given this open-ended remit, we wish to guarantee stability in the spatio-temporal positioning of the nodes: assigning the same position, up to noise, to nodes behaving similarly at a given time (cross-sectional stability) and a constant position, up to noise, to a single node behaving similarly across different times (longitudinal stability). These properties are defined formally within a generic dynamic latent position model. By showing how this model can be recast as a multilayer random dot product graph, we demonstrate that unfolded adjacency spectral embedding satisfies both stability conditions, allowing, for example, spatio-temporal clustering under the dynamic stochastic block model. We also show how alternative methods, such as omnibus, independent or time-averaged spectral embedding, lack one or the other form of stability.


A consistent adjacency spectral embedding for stochastic blockmodel graphs

We present a method to estimate block membership of nodes in a random gr...

The multilayer random dot product graph

We present an extension of the latent position network model known as th...

Perfect Clustering for Stochastic Blockmodel Graphs via Adjacency Spectral Embedding

Vertex clustering in a stochastic blockmodel graph has wide applicabilit...

Latent structure blockmodels for Bayesian spectral graph clustering

Spectral embedding of network adjacency matrices often produces node rep...

Spectral embedding and the latent geometry of multipartite networks

Spectral embedding finds vector representations of the nodes of a networ...

Spectral embedding of regularized block models

Spectral embedding is a popular technique for the representation of grap...

Dynamic Task Allocation for Robotic Network Cloud Systems

Every robotic network cloud system can be seen as a graph with nodes as ...