donnate

Hi! Thank you for pointing this out! I'm currently working on fixing a few bugs and will update that one as well. Best regards, Claire

The nodes are sorted according to their initial labelling in the graph (small to large node index).

Hi, If the similarity is too small, then you might want to try another more discriminative distance(such as e^{-S_{ij}/s^2}, and choose an appropriate bandwidth). You might have to play around...

Hi, Thank you for picking up this mistake. This is due to an update in the pygsp Library. I have fixed this and made the code independent from pygsp (all...

Hi, For the list of time points, I typically used 25 evenly spaced points in 0:100 (np.linspace(0,100,25)). In order to "guide" the choice of the range and number of samples,...

Hi, No, the embedding size varies: each node structural embedding is of size equal to: 2 x nb_timepoints x nb_scales where: - the 2 comes from the fact that we...

Hi, Thank you for your interest in GraphWave! Indeed, the code has to be adapted to handle very large graphs (in particular, using adapted libraries such as snap.py instead of...