RepRandomWalk: Repetitive Fixed-length (weighted) random walk algorithm

In mnda: Multiplex Network Differential Analysis (MNDA)

Repetitive Fixed-length (weighted) random walk algorithm

Description

Repetitive Fixed-length (weighted) random walk algorithm

Usage

RepRandomWalk(
  graph,
  Nrep = 100,
  Nstep = 5,
  weighted_walk = TRUE,
  verbose = TRUE
)

Arguments

graph	an igraph object
Nrep	number of repeats (default:100)
Nstep	maximum number steps (default:5)
weighted_walk	choose the weighted walk algorithm if TRUE and simple random walk if FALSE. (default: TRUE)
verbose	if TRUE a progress bar is shown.

Value

Steps (S): The total number of times a node is visited starting from the corresponding node in the row. Probabilities (P): The node visit probabilities starting from the corresponding node in the row.

Examples

data = example_data()
RW = RepRandomWalk(graph = data[["igraph_example"]])
Steps = RW[["Steps"]]
Probabilities = RW[["Probabilities"]]

mnda documentation built on Feb. 16, 2023, 5:32 p.m.