0
$\begingroup$

My question is related to the following posts, but doesn't quite answer my question:

Effect of weights on the Louvain communities detected

https://stackoverflow.com/questions/49151996/meaning-of-weights-in-community-detection-algorithms/49311269#49311269

If weights are not considered (or provided in original graph creation), is community detection using the Louvain algorithm simply detecting communities based on the connections that form between nodes (in other words, k-number of communities) without considering the distance between them (edge weights, as there are no weights to determine how strong connections are)?

Thank you.

Improve this question
$\endgroup$
2
  • $\begingroup$ Values of an adjacency matrix of an unweighted graph are usually defined to be 1 (edge) or 0 (no edge), if this is what you are asking. $\endgroup$ – Valentas Feb 26 at 10:55
  • $\begingroup$ Thank you... Sort of... My question was more, can communities be detected when the values of edges are only 1's and 0's? $\endgroup$ – user9317212 Feb 27 at 9:52

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.