Birds of a feather? Opposite attract?
In graph language, the first philosophy is called homophily while the second heterophily.
When you’re building a graph, or teaching a model to do so, you can use one of these principles to your advantage. In practice this amounts to penalizing nodes with similar or dissimilar embeddings to connect.