Research Article
Modeling Spatial Social Complex Networks for Dynamical Processes
Algorithm 1
Network generation using the SSCN model.
Input: (number of nodes), | (asymptotic redirection probability), | (additional parameter for redirection), | (min number of spatial nearest neighbors per node), | (relocation probability) | Output: (network adjacency matrix) | and (nodes spatial coordinates) | and | for do | | Choose at random from | (5) Choose at random from the interval | (6) Choose at random from the interval | (7) if then | (8) and | (9) Choose | (10) | (11) else | (12) Choose at random from the set | (13) and | (14) | (15) end if | (16) end for | (17) if then | (18) for do | (19) | (20) | (21) end for | (22) end if | (23) Choose a random permutation on the set | (24) for do | (25) Choose at random from the interval | (26) if then | (27) Choose at random from | (28) Choose at random from the interval | (29) | (30) if then | (31) | | (32) | (33) end if | (34) end if | (35) end for | (36) for do | (37) for every do | (38) | (39) end for | (40) end for |
|