Re: [igraph] Communities in directed networks?

[Stijn van Dongen]

         Hi Uri,

This will not help your cause, but I have always found it hard to see a case
for community detection (I am more used to the term 'graph clustering' by the
way) in directed networks that makes use of directed information. Could you
provide a toy example perhaps?

best,
Stijn


On Fri, May 28, 2010 at 11:29:38AM -0400, Uri Shwed wrote:
> Hi all,
> Does igraph has an implemented algorithm for community detection that makes 
> real use of directed informations? I know there are some that can accept 
> directed graphs, but treat it as undirected...anything that really makes use 
> of the information? I currently am using Leicht and Newman's modularity 
> maximization for directed networks outside of igraph, and am looking for 
> another method for robustness.
> If there's no such thing in igraph, where would you recommend looking? I know 
> there are plenty of good algorithms out there, but am just looking for 
> something that's already well implemented to check my results against.
> Thanks,
> Uri Shwed
> _______________________________________________
> igraph-help mailing list
> address@hidden
> http://lists.nongnu.org/mailman/listinfo/igraph-help

-- 
Stijn van Dongen         >8<        -o)   O<  forename pronunciation: [Stan]
EMBL-EBI                            /\\   Tel: +44-(0)1223-492675
Hinxton, Cambridge, CB10 1SD, UK   _\_/   http://micans.org/stijn