In applied graph analytics, the first cluster is often not the real unit you care about.

In a family-detection project, I started from precomputed communication communities (SAS CLA results). The algorithm found groups of people who call each other.
A communication community is not necessarily a household. A single community can contain extended family spread across the city, multiple separate households, and close friends who call frequently.
I needed to separate two distinct levels of social structure:
The broader connected social unit (20-30 people)
The smaller co-living unit (4-6 people)
Not just 'how many calls?' but who ranks highest. Top 5 outgoing + top 5 incoming contacts, weighted by position (1st = 5 points, 2nd = 4, etc.). Household members consistently appear in each other's top tier.
Which cell tower shows up most in your evening CDR? The dominant evening tower = home location. People spend ~8 hours a night in the same place. Two people in the same household share a dominant evening tower with very high probability.
Same community + top-ranked contact + shared evening tower = household tie.
The algorithm found the network. The refinement found the household.
Design insight: In applied graph analytics, the first cluster is often not the real unit you care about. Graph membership alone is not enough — combine it with behavioral signals to find the real structure.