Network Diffusion Algorithms

Implementation of network diffusion algorithms such as insulated heat propagation or Markov random walks. Network diffusion algorithms generally spread information in the form of node weights along the edges of a graph to other nodes. These weights can for example be interpreted as temperature, an initial amount of water, the activation of neurons in the brain, or the location of a random surfer in the internet. The information (node weights) is iteratively propagated to other nodes until a equilibrium state or stop criterion occurs.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.0 by Simon Dirmeier, 3 months ago

Report a bug at

Browse source code at

Authors: Simon Dirmeier [aut, cre]

Documentation:   PDF Manual  

GPL (>= 3) license

Imports Rcpp

Suggests knitr, rmarkdown, testthat, lintr, igraph

Linking to Rcpp, RcppEigen

System requirements: C++11

See at CRAN