definition
Graph similarity is task-dependent and ill-defined
Similarity between graphs is in the eye of the beholder and ill-defined, depending on the task; rather than solving hard isomorphism/alignment problems, one can compare networks of different sizes by running the same diffusion process (e.g., a rumor) and checking whether the stationary distribution of a random walker becomes the same, declaring the networks similar if the process behaves alike.
definitionpending
Speaker
Tina Eliassi-RadEvidence Quote
“similarity is in the eye of the beholder. And it depends on the task itself. So similarity is an ill-defined problem.”
Created: 6/13/2026, 12:26:13 AM
Your notes
Loading notes...