Graph burning is a discrete-time process devised to model the spread of information, contagion or influence across the vertices of a network. At each time step, a single vertex is chosen as a new fire ...

A wide range of tasks in network analysis, such as clustering network populations or identifying anomalies in temporal graph streams, require a measure of the similarity between two graphs. To provide ...