Description Usage Arguments Value
View source: R/single-unbiased-random-walker.R
Simulate voter-model-style dynamics on a network. Nodes are randomly assigned a state in (-1,1) at each time step all nodes asynchronously update by choosing their new state uniformly from their neighbors. Generates an N*L time series. The results dictionary also stores the time series as TS and ground truth adjacency matrix as ground_truth.
1 | single_unbiased_random_walker(input_matrix, L, initial_node = NULL)
|
input_matrix |
the input (ground-truth) graph with N nodes. Must be valid square adjacency matrix. |
L |
the length of the desired time series. |
initial_node |
starting node for walk |
results a list with TS matrix an N*L array of synthetic time series data.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.