On 27.07.2016 17:35, Philipp Singer wrote: > Thanks for the hint, I tried that but it is the same runtime as on the > filtered graph.
The time difference is because of the convergence of the algorithm. As mentioned in the documentation, the convergence speed of eigenvector() is a function of the spectral gap of the graph. By sub-sampling the network, and thus removing most of the edges, the spectral gap changes significantly. Best, Tiago -- Tiago de Paula Peixoto <[email protected]>
signature.asc
Description: OpenPGP digital signature
_______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
