DeepAI AI Chat
Log In Sign Up

Dynamic Graph Echo State Networks

by   Domenico Tortorella, et al.

Dynamic temporal graphs represent evolving relations between entities, e.g. interactions between social network users or infection spreading. We propose an extension of graph echo state networks for the efficient processing of dynamic temporal graphs, with a sufficient condition for their echo state property, and an experimental analysis of reservoir layout impact. Compared to temporal graph kernels that need to hold the entire history of vertex interactions, our model provides a vector encoding for the dynamic graph that is updated at each time-step without requiring training. Experiments show accuracy comparable to approximate temporal graph kernels on twelve dissemination process classification tasks.


page 1

page 2

page 3

page 4


On Exploring Temporal Graphs of Small Pathwidth

We show that the Temporal Graph Exploration Problem is NP-complete, even...

Graph Kernels: State-of-the-Art and Future Challenges

Graph-structured data are an integral part of many application domains, ...

Dynamical Graph Echo State Networks with Snapshot Merging for Dissemination Process Classification

The Dissemination Process Classification (DPC) is a popular application ...

Modeling and Analysis of Time-Varying Graphs

We live in a world increasingly dominated by networks -- communications,...

Just-in-Time Dynamic-Batching

Batching is an essential technique to improve computation efficiency in ...

On Time and Space: An Experimental Study on Graph Structural and Temporal Encodings

Dynamic networks reflect temporal changes occurring to the graph's struc...

A Temporal Graphlet Kernel for Classifying Dissemination in Evolving Networks

We introduce the temporal graphlet kernel for classifying dissemination ...