[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [igraph] label propagation community
From: |
Tamas Nepusz |
Subject: |
Re: [igraph] label propagation community |
Date: |
Tue, 9 Nov 2010 20:01:52 +0000 |
Dear Prof. Freeman,
> The manual reports, "This version extends the original method by the ability
> to take edge weights into consideration . . ." But it doesn't tell exactly
> how the weights are taken into account. Where can I find that information?
Nowhere yet, but I'll add it to the documentation soon. Basically, when the
method decides the new label of a node, it calculates the total weights of
edges leading to other nodes of label 1, 2, ..., k (where k is the number of
labels) and then chooses the one with the highest total weight. The original
method does exactly the same thing while assuming that all edges have equal
weight.
--
Tamas