You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Create a random temporal graph given `number_nodes` nodes and `number_snapshots` snapshots.
390
+
First, the positions of the nodes are generated with a quasi-uniform distribution (depending on the parameter `α`) in hyperbolic space within a disk of radius `R`. Two nodes are connected if their hyperbolic distance is less than `R`. Each following snapshot is created in order to keep the same initial distribution.
391
+
392
+
# Arguments
393
+
394
+
- `number_nodes`: The number of nodes of each snapshot.
395
+
- `number_snapshots`: The number of snapshots.
396
+
- `α`: The parameter that controls the position of the points. If `α=ζ`, the points are uniformly distributed on the disk of radius `R`. If `α>ζ`, the points are more concentrated in the center of the disk. If `α<ζ`, the points are more concentrated at the boundary of the disk.
397
+
- `R`: The radius of the disk and of connection.
398
+
- `speed`: The speed to update the nodes.
399
+
- `ζ`: The parameter that controls the curvature of the disk.
400
+
- `self_loops`: If `true`, consider the node itself among its neighbors, in which
401
+
case the graph will contain self-loops.
402
+
- `kws`: Further keyword arguments will be passed to the [`GNNGraph`](@ref) constructor of each snapshot.
0 commit comments