I am trying to find a community detection algorithm that given one or more nodes that are known to belong to the same community will return a collection of other nodes that are likely from the same community. I am familiar with Louvain and have used it experimentally, but it labels all the communities at once in advance. This problem only requires that one community be identified at a time. Is this even possible because a community can only be defined by its connectivity relative to whole graph?

Edit: I found this article "Searching for a Single Community in a Graph" https://arxiv.org/abs/1806.07944. If you know of anything similar to this, particularly if it has been implemented already in neo4j please let me know.