[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

[igraph] Weights in community detection

From: ivogt
Subject: [igraph] Weights in community detection
Date: Wed, 01 Sep 2010 18:36:41 +0200
User-agent: Mozilla/5.0 (X11; U; Linux i686 (x86_64); en-US; rv: Gecko/20100802 Lightning/1.0b2 Thunderbird/3.1.2

Dear all,
I have got two questions concerning the use of weights for the two
community detection functions fastgreedy.community and walktrap.community.

1) How do these functions treat edge weights? Are weights considered to
as some sort of similarity (low values -> bad, high values -> good) or
dissimilarity/distance (low values -> good, high values -> bad). 'Good'
would mean that connected vertices with a 'good' value should have a
higher likeliness to be put into the same community.

2) These are the only community detection function accepting weights,

I hope my questions are clear enough.

Thank you a lot, I like igraph a lot!

Ingo Vogt

Attachment: ivogt.vcf
Description: Vcard

reply via email to

[Prev in Thread] Current Thread [Next in Thread]