Algorithm first samples n_key_nodes according the the requested key_nodes_sampler
criterion. For each key node, the requested number or fraction of neighbors is
then sampled according to the neighbors_sampler
criterion. Optionally, a list of
modules can be designated as "hidden" and will be excluded from sampling.
if n_neighbors is greater than 1, assumes this is the number to sample. If
n_neighborsis between 0 and 1, assumes this is the fration of neighbors to sample. (To sample 1 neighbor, use an explicit integer,
1L (or as.
integer(1)`)
to sample 100
Provide module_sizes
list to improve performance. If not provided, this will
will be calculated based on igraph::cluster_edge_betweeness
. Be sure to
provide a module_sizes
vector whenever calling netsampler
repeatedly on the
same network to avoid unnecessary performance hit from recalculating modules every
time. See examples.