Captain Pleasure, Andrés Gómez Emilsson@algekalipso• over 1 year ago

I think that this is for sparse random graphs. Romance isn't quite random, not sparse, nor restricted to a subset of all humans (except for, say, boarding schools). In real world settings, we need the graph clustering techniques developed by Lescovec et al. which show there is a massive core in the entire graph and that clustering of nodes stops making sense above a certainly threshold of cluster sizes (usually around 1,000 to 10,000 nodes).

QC@QiaochuYuan• over 1 year ago

fun fact: there's a technical term for the ~polycule in the top left, it's called the "giant component" https://t.co/sqCOh0BoS9 https://t.co/6XhYCUnPKy

754 59