Other approaches to community detection

All of these algorithms that we have explored were ideas that people had on how to identify communities in networks, either based on nearness to other nodes or found by cutting edges. However, these are not the only approaches. I came up with an approach before learning about the Girvan-Newman algorithm that cut nodes rather than edges. However, when I learned about the Girvan-Newman approach, I found that to be more ideal and gave up on my implementation. But that makes me think, what other approaches might there be for identifying communities in networks?

As you learn more and become more comfortable working with networks, try to discover other ways of identifying communities.