about the dendrogram in the paper

[jiaweiwangwang]

Hello,
I am very honored to read this paper.The idea of this article has deeply attracted me.But I don’t understand the hierarchical community built in the article.After removing the edge with the highest betweenness centrality, how are the new two communities connected?Can you draw a picture for me?

[wisaaco]

Hello, Thanks for your kindness words. I will try to explain the idea with this simple example. I hope to clarify your doubts. We have the next simple graph with 6 nodes and different edges (Ni—> Nj) Also, we have one app, deployed N1 and N6, with two connected services in both nodes (s1 on N1 and s2 on N6) s1-N1 —> N2 —> N3 |—> N4—> N5 |—> N6-s2 When we compute the centrality degree values, the edge N2-N4 could be one with the highest value. Thus, we remove it and we obtain the next graph (really, two graphs/two communities) s1-N1—> N2 —> N3 N4—> N5 |—> N6-s2 In this new situation, the app doesn’t work, it means, both services are not connected. If you have more doubts please don’t hesitate to contact us. Best, Isaac

…

El 1 sept 2019, a las 14:36, jiaweiwangwang ***@***.***> escribió: Hello, I am very honored to read this paper.The idea of this article has deeply attracted me.But I don’t understand the hierarchical community built in the article.After removing the edge with the highest betweenness centrality, how are the new two communities connected?Can you draw a picture for me? — You are receiving this because you are subscribed to this thread. Reply to this email directly, view it on GitHub <#1?email_source=notifications&email_token=AAZCMQBEM3I6QP6O4MMRXDLQHOZODA5CNFSM4ISWVKG2YY3PNVWWK3TUL52HS4DFUVEXG43VMWVGG33NNVSW45C7NFSM4HIUPE6A>, or mute the thread <https://github.com/notifications/unsubscribe-auth/AAZCMQAOI44C4QRAQ7CPN7TQHOZODANCNFSM4ISWVKGQ>.