View source: R/bigNetworkSearch.R
bigNetworkSearch | R Documentation |
For a big network where we can apply treatments to a subset of them, find the optimal design using a Fedorov exchange type algorithm.
bigNetworkSearch(A, treatments, sampleSize, restartProb = 0, numIterations)
A |
adjacency Matrix of the network |
treatments |
number of treatments to search over |
sampleSize |
Number of nodes given a treatment, as opposed to null treatment |
restartProb |
The probability of starting from a random restart. Set to 1 to evaluate random balanced designs. |
numIterations |
How many iterations to use in the exchange algorithm |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.