Tell me more ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.
up vote 0 down vote favorite

I want to find a "communities" in a graph. Recent approaches from literatures are clique-percolation method and Louvain method, they both perform well on a variety of real-world graph, but I can't find a clear algorithmic pseudocode or similar.

Do somebody know more about those methods?

share|improve this question
It would be helpful for some more detail. For example what is a community? How big is the graph you are dealing with? Do you know anything about the distribution of the degrees of vertices? – Alex Jun 19 '12 at 15:00

Know someone who can answer? Share a link to this question via email, Google+, Twitter, or Facebook.

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.