vnsgm: Finds the seeds in an h-hop induced nbd of G_1 around the...
In youngser/VN: Vertex Nomination via Seeded Graph Matching

Description Usage Arguments Value Author(s)

View source: R/localnbd2.r View source: R/localnbd.r

Finds the seeds in an h-hop induced nbd of G_1 around the VOI, x, that is, finds induced subgraph generated by vertices that are within a path of length h the VOI, and then finds an ell-hop induced nbd of G_1 around the seeds within the h-hop nbd of x, and an ell-hop induced nbd of G_2 around the corresponding seeds. Then, matches these induced subgraphs via multiStart.

vnsgm(
  x,
  seeds,
  g1,
  g2,
  h,
  ell,
  R,
  g,
  pad = 0,
  sim = FALSE,
  verb = FALSE,
  plotF = FALSE
)

`x`	vector of indices for vertices of interest (voi) in G_1
`g1`	G_1 in `igraph` object where voi is known
`g2`	G_2 in `igraph`
`h`	h-hop for distance from voi to other vertices to create h-hop induced subgraph of G_1
`ell`	ell-hop for distance from seeds to other vertices to create ell-hop induced subgraph of G_1
`R`	number of restarts for `multiStart`
`g`	gamma to be used with `multiStart`, 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
`sim`	boolean: default TRUE (yes, this is a simulation) – assumes x = x' (i.e. indices for VOI in G_1 are the same as the indices for the corresponding matches in G_2)
`verb`	verbose outputs
`plotF`	boolean to plot the probability matrix
`S`	vector of a set of seeds

seed s seeds

cand labels for the candidates in G_2

ind1 labels for the vertices in G_1

ind2 labels for the vertices in G_2

P matrix P(i,j) is the proportion of times that vertex j in the induced subgraph of G_2 was mapped to vertex i in the induced subgraph of G_1. Then the i-th and j-th elements of the labels vector tells you which vertices these actually were in G_1 and G_2, respectively.