Description Usage Arguments Value Author(s)
Runs SGM algorithm starting with rsp (rand start point)
R
times and generates an average probability matrix over the R
restarts
1 | multiStart(A, B, R, s, g, pad = 0, iter = 20)
|
A |
adjacency matrix for G_1 |
B |
adjacency for correlated matrix G_2 |
R |
number of restarts |
s |
number of seeds |
g |
gamma (upper bound on alpha) should be in (0,1), max tolerance for alpha, how far away from the barycenter user is willing to go for
the initialization of |
pad |
a scalar value for padding for sgm |
iter |
number of iterations allowed to be used in sgm step |
n \times n average probability matrix over all restarts.
Heather Gaddy Patsolic <hgaddy1@jhu.edu>
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.