Community detection and graph partitioning

@article{Newman2013CommunityDA,
  title={Community detection and graph partitioning},
  author={Mark E. J. Newman},
  journal={CoRR},
  year={2013},
  volume={abs/1305.4974}
}
Many methods have been proposed for community detection in networks. Some of the most promising are methods based on statistical inference, which rest on solid mathematical foundations and return excellent results in practice. In this paper we show that two of the most widely used inference methods can be mapped directly onto versions of the standard minimum-cut graph partitioning problem, which allows us to apply any of the many well-understood partitioning algorithms to the solution of… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 24 times over the past 90 days. VIEW TWEETS

Citations

Publications citing this paper.
Showing 1-10 of 25 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

An information flow model for conflict and fission in small groups

  • J. Neeman E. Mossel, A. Sly
  • Phys . Rev . Lett .
  • 2012

Phase transitions in random Potts systems and the community detection problem : Spin - glass type and dynamic perspectives

  • P. Ronhovde, Z. Nussinov
  • Phys . Rev . Lett .
  • 2008

Similar Papers

Loading similar papers…