Hi All,
I have recently been working a lot with large graphs where it is infeasible to do global community detection with the compute resources I have available. I have therefore been using local community detection algorithms to investigate the communities around nodes of interest. I thought it could be worth adding some of these LCD algorithms to networkX. To start I have opened a PR adding Clausets original LCD algorithm.
https://github.com/networkx/networkx/pull/7691/commits
This is my first time contributing to NetworkX so it would be great to get any feedback, and I am unsure on what the naming conventions of the algorithms should be so fell free to suggest any changes.
It would be great to hear if anyone else has been using LCD algorithms.
The original paper can be found here: https://arxiv.org/pdf/physics/0503036
And a good summary of LCD can be found here: https://ieeexplore.ieee.org/document/9916271
Many thanks,
Matt