How to define similarity between nodes in original graph?

While there has been a lot of talk in how to define the similarity between nodes in the embedding space, but I don't seem to come across any talking about defining the similarity between nodes in the original, non-embedded graph. Any suggestions as of how to define such?

Topic graph-neural-network gnn deep-learning machine-learning

Category Data Science

About

Geeks Mental is a community that publishes articles and tutorials about Web, Android, Data Science, new techniques and Linux security.