Re: [igraph] random walk betweenness

[Tamás Nepusz]

> any suggestion for calculating random walk betweenness centrality using 
> igraph 0.6?

randok walk betweenness centrality is not implemented directly in igraph, so 
you have to code it yourself. A formula is provided in the original publication 
of Newman and an algorithm (in pseudocode) is to be found in the paper of 
Brandes & Fleischer:

http://www.inf.uni-konstanz.de/algo/publications/bf-cmbcf-05.pdf

Since it involves the inversion of the Laplacian matrix (which can potentially 
be very large), I think it only makes sense up to a few thousand vertices at 
most. You can get the Laplacian in a sparse matrix form from igraph using 
graph.laplacian(g, sparse=T), but you are on your own from there. You will also 
need the Matrix package from R to use sparse matrices.

Best,
T.