igraph

Community detection in bipartite graphs

Asked by Moses Boudourides

I'd like to use M. Barber's algorithm for community detection in bipartite graphs (http://arxiv.org/abs/0707.1616). As I understand, this would necessitate some minor modifications to existing algorithms implemented in graph. For instance, it might be appropriate to add add a boolean bipartite argument to igraph_modularity() that modifies the null calculation, then expose this upwards in any modularity-based detection algorithms like igraph_community_fastgreedy(). Thanks in advance.

--Moses

Question information

Language:
English Edit question
Status:
Answered
For:
igraph Edit question
Assignee:
No assignee Edit question
Last query:
Last reply:
Revision history for this message
Gábor Csárdi (gabor.csardi) said : 		#1

Thanks for the suggestion. There is actuall a bug report for this:
https://bugs.launchpad.net/igraph/+bug/594581

I am not sure that updating fastgreedy is that simple, because it might have some assumptions about the modularity measure. Anyway you can follow that bug to see when we are addressing this...

Can you help with this problem?

Provide an answer of your own, or ask Moses Boudourides for more information if necessary.

To post a message you must log in.