centralityInformation() is slow when network N>100

Bug #1365582 reported by Dimitris Kalamaras on 2014-09-04
6
This bug affects 1 person
Affects Status Importance Assigned to Milestone
SocNetV
Critical
Dimitris Kalamaras

Bug Description

the calculation of IC is slow when the graph order is large (say N > 100) because the centralityInformation() method still uses the Naive Gauss elimination algorithm to find the inverse of the pseudo-adjacency B
B is a matrix derived from 1-A where the diagonal is substituted with 1 plus each actor's degree.

Solution: We need to use LU-decomposition instead of Gauss elimination.

Changed in socnetv:
milestone: 1.5 → 1.6
Changed in socnetv:
milestone: 1.6 → 1.7
Changed in socnetv:
milestone: 1.7 → 1.8
Changed in socnetv:
milestone: 1.8 → 1.9
Changed in socnetv:
status: Triaged → Fix Committed
Changed in socnetv:
status: Fix Committed → Fix Released
To post a comment you must log in.
This report contains Public information  Edit
Everyone can see this information.

Other bug subscribers