Tool for estimate probabilities of vertices being in active module using its likelihoods and it proposes methods for ranking vertices in order of importance. Estimating probabilities based on Markov chain Monte Carlo (MCMC) methods.
You can install mcmcRanking from github with:
# install.packages("devtools")
devtools::install_github("ctlab/mcmcRanking")
An animation of the MCMC algorithm performing. Vertices are colored depending on its likelihood, burgundy and gray colors corresponds to high and low likelihoods respectively. Yellow subgraph is an active module.