graph.diffuseP1: Diffuse Probability P1 from a starting node.

Description Usage Arguments Examples

View source: R/graph.diffuseP1.r

Description

Recursively diffuse probability from a starting node based on the connectivity of the background knowledge graph, representing the likelihood that a variable will be most influenced by a perturbation in the starting node.

Usage

1
2
graph.diffuseP1(p1, startNode, G, visitedNodes, graphNumber = 1,
  verbose = FALSE)

Arguments

p1

- The probability being dispersed from the starting node, startNode.

startNode

- The first variable drawn in the adaptive permutation node sequence, from which p1 gets dispersed.

G

- The igraph object associated with the background knowledge graph.

visitedNodes

- The history of previous draws in the permutation sequence.

graphNumber

- If testing against multiple background knowledge graphs, this is the index associated with the adjacency matrix that codes for G. Default value is 1.

verbose

- If debugging or tracking a diffusion event, verbose=TRUE will activate print statements. Default is FALSE.

Examples

1
graph.diffuseP1(p1, startNode, G, visitedNodes, 1)

lashmore/MolEndoMatch documentation built on May 5, 2019, 8:02 p.m.