multiStart: Multiple Restart SGM

Description Usage Arguments Value Author(s)

Description

Runs SGM algorithm with random starting point generated by rsp R times and generates an average probability matrix for matched vertex over the R restarts

Usage

1
multiStart(A, B, R, s, gamma, 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; assumed to be first s vertices in both G_1 and G_2

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 (cases where two graphs have different number of vertices); defaulted to 0

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


neurodata/graphstats documentation built on May 14, 2019, 5:19 p.m.