Fast Effective Resistances 

An implementation of the Spielman-Srivastava algorithm for the quick computation of many effective resistances in an electrical resistive network. Effective resistances are equivalent to commute times of the random walk in the corresponding graph.

The code runs in MATLAB. Authored by Richard Garcia Lebron.

Download   Dependence: CMG solver