multiStart: Runs SGM algorithm starting with rsp (rand start point) 'R'...

Description Usage Arguments Value Author(s)

View source: R/multiStart.r

Description

Runs SGM algorithm starting with rsp (rand start point) R times and generates an average probability matrix over the R restarts

Usage

1
multiStart(A, B, R, s, g, pad = 0, iter = 20)

Arguments

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 sgm on any given iteration

pad

a scalar value for padding for sgm

iter

number of iterations allowed to be used in sgm step

Value

n \times n average probability matrix over all restarts.

Author(s)

Heather Gaddy Patsolic <hgaddy1@jhu.edu>


youngser/VN documentation built on July 18, 2020, 12:48 p.m.