Partitioning graphs at scale is a key challenge for any application that involves distributing a graph across disks, machines, or data centers. Graph partitioning is a very well studied problem with a rich literature, but existing algorithms typically can not scale to billions of edges, or can not provide guarantees about partition sizes.
No takes yet. Share an insight, caveat, or question.
Ugander et al. (2013) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: