Re: [igraph] random walks with directed edges

[Simone Gabbriellini]

Tamas,

thanks, in fact edge.betweenness.community was my first choice... but
when I try:

edge.betweenness.community(g, weights=E(g)$myweights, directed=TRUE)

I have:
Graph community structure calculated with the edge betweenness algorithm
Number of communities (best split): 1
Modularity (best split): 0

with igraph 0.6, and a network of 56 nodes and 813 edges... should I
fine-tune something? looks like just one community exists...

best,
Simone



2012/5/21 Tamás Nepusz <address@hidden>:
> Hello Simone,
>
> The walktrap algorithm is not suitable for directed graphs (despite its 
> reliance on random walks). The authors of the walktrap algorithm conclude 
> this in their original paper:
>
> "For directed ones (like the important case of the web graph), on the 
> contrary, the proofs we provided are not valid anymore, and random walks 
> behave significantly differently. Therefore, we also consider the directed case 
> as an interesting direction for further research."
> http://arxiv.org/pdf/physics/0512106v1.pdf
>
> Best,--
> T.
>
>
> On Monday, 21 May 2012 at 09:56, Simone Gabbriellini wrote:
>
>> Hello list,
>>
>> is there the possibility to tell walktrap.community to take into
>> account my network is directed?
>>
>> igraph 0.5.4
>>
>> best,
>> Simone
>>
>> --
>> Dr. Simone Gabbriellini
>>
>> DigitalBrains srl
>> Amministratore
>> Head R&D
>>
>> mobile: +39 3403975626
>> mail: address@hidden (mailto:address@hidden)
>>
>> _______________________________________________
>> igraph-help mailing list
>> address@hidden (mailto:address@hidden)
>> https://lists.nongnu.org/mailman/listinfo/igraph-help
>
>
>
>
> _______________________________________________
> igraph-help mailing list
> address@hidden
> https://lists.nongnu.org/mailman/listinfo/igraph-help



-- 
Dr. Simone Gabbriellini

DigitalBrains srl
Amministratore
Head R&D

mobile: +39 3403975626
mail: address@hidden