This function will simulate N simple random graphs with the same clustering
and degree sequence as the input. Essentially a wrapper for
sim.rand.graph.clust
and set_brainGraph_attr
. It
uses foreach
to speed it up. If you do not want to
match by clustering, then it will do a simple rewiring of the given graph
(the number of rewire's equaling the larger of 1e4 and 10 * number of edges).
1  sim.rand.graph.par(g, N, clustering = TRUE, ...)

g 
An 
N 
Integer; the number of random graphs to simulate 
clustering 
Logical; whether or not to control for clustering (default:

... 
Other parameters (passed to 
A list of N random graphs with vertex and graph attributes
sim.rand.graph.clust, rewire,
sample_degseq, keeping_degseq
1 2 3 4 5  ## Not run:
rand1 < sim.rand.graph.par(g[[1]][[N]], N=1e3, clustering=F)
rand1.cl < sim.rand.graph.par(g[[1]][[N]], N=1e2, max.iters=1e3)
## End(Not run)

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.
Please suggest features or report bugs with the GitHub issue tracker.
All documentation is copyright its authors; we didn't write any of that.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.