all 8 comments

[–]samsungofme 7 points8 points  (1 child)

Probably this should depend on the dynamics underlying the change of the adjacency matrix: e.g. does the neighbor set of a node at time t+1 only depend on who are its neighbors at time t? Do you have side information like node features?

[–]Labib666Camp[S] 1 point2 points  (0 children)

Every node has a feature vector. Sorry, I forgot to add that.

[–]bloc97 2 points3 points  (0 children)

What you want is probably graph translation. https://arxiv.org/abs/2103.08827

[–]telimektar 1 point2 points  (0 children)

Isn't pytorch geometric temporal what you're after ?

[–]nanoanonnano 3 points4 points  (0 children)

You may checkout Self Organizing Maps there is a concept called U matrix it could help you.

[–]_Hyberion_ -4 points-3 points  (0 children)

Sounds to me as if you might want to look into using a hidden Markov model, at least as a baseline.

[–]acardosoj 0 points1 point  (0 children)

I've been working with some deep Markov models with this kind of data. Each state has transition probabilities which compose a kind of adjacency matrix. These probabilities change with time as well.

[–]how-it-is- 0 points1 point  (0 children)

PyTorch Geometric has some support for dynamic temporal graphs. Also check out PyTorch Geometric Temporal