Clique identification within larger network

[Andrew Pierce]

I am interested in identifying cliques of entities (think of groups of common friends within a social media network) within a network. This is a task that typically falls within the domain of network research, which I have no experience with. An approach for doing this is the Lovain algorithm (see Blondel et al. 2008 [https://doi.org/10.1088/1742-5468/2008/10/P10008]).

Can anyone with network research experience tell me if using the Lovain algorithm is possible within Stata given the computational demands? Or would I be best suited to pursue this task with python?

Thank you!
Andrew

[Mike Lacy]

I'd take a look at https://nwcommands.wordpress.com/. I made a quick search there for "clique" and "Lovain," but didn't find anything. However, there are likely other clique detection procedures, and you might also post your question on the nwcommands forum.

[Andrew Pierce]

Thank you Mike! I will check out the helps for nwcommands.

[Mike Lacy]

Just noticed the spelling of "Lovain" for "Louvain," which would affect searching.