Using with directed graph

taynaud / python-louvain

Louvain Community Detection

BSD 3-Clause "New" or "Revised" License

965 stars 200 forks source link

Using with directed graph #28

Open jb110 opened 6 years ago

jb110 commented 6 years ago

Do you know how I would go about adapting this algorithm to directed networks? Or can it only be used on undirected networks?

taynaud commented 6 years ago

Hello,

For the moment I have no plan to adapt to directed graphs.

Modularity meaning is not very clear for a directed graph and I do not know a "standard" implementation of Louvain algorithms on such graph. The usual way is to consider directed graph as undirected.

Best

deemeetree commented 5 years ago

Hello @taynaud — could you please elaborate on why modularity meaning is not very clear for directed graphs? What is the controversy here?

Do you know of any methods for reliable community detection and modularity calculation on directed graphs?

wilmeragsgh commented 5 years ago

There's a way presented here: https://github.com/nicolasdugue/DirectedLouvain but they do not provide python implementation/interface to its solution.

They also made a few changes on the modularity function the algorithm use, and they have a paper about it: https://hal.archives-ouvertes.fr/hal-01231784

DonaldTsang commented 4 years ago

would like to see more on this

taynaud commented 4 years ago