Is there a Community Detection algorithm that has low time complexity such as Louvain, but that penalizes TOO large of communities

Question

I am building a massive network, that is filled with isolated nodes, but also rather large clusters as well. I have used Louvain\'s algorithm to achieve the best partition - how