singleNode.getNodeRanksN: Generate the fixed , single-node diffusion node rankings,...

Description Usage Arguments Value Examples

View source: R/singleNode.getNodeRanksN.r

Description

This function calculates the node rankings starting from a given perturbed variable in a subset of variables in the background knowledge graph.

Usage

1
2
singleNode.getNodeRanksN(n, G, S = NULL, num.misses = NULL,
  verbose = FALSE)

Arguments

n

- The index (out of a vector of node names) of the node ranking you want to calculate.

G

- A list of probabilities with list names being the node names of the background graph.

S

- A character vector of node names in the subset you want the network walker to find.

num.misses

- The number of "misses" the network walker will tolerate before switching to fixed length codes for remaining nodes to be found.

verbose

- If TRUE, print statements will execute as progress is made. Default is FALSE.

Value

current_node_set - A character vector of node names in the order they were drawn by the probability diffusion algorithm.

Examples

1
2
3
4
5
6
7
# Get node rankings for graph
ranks = list()
for (n in 1:length(G)) {
  print(sprintf("Generating node rankings starting with node %s", names(G)[n]))
  ranks[[n]] = singleNode.getNodeRanksN(n, G)
}
names(ranks) = names(G)

BRL-BCM/CTD documentation built on March 21, 2020, 8:39 a.m.