Discusses challenges in comparing non-Euclidean data, proposing a Laplacian-based solution for graph alignment and exploring optimal transport for graph distance computation.
Explores epidemics spread models and Bootstrap Percolation in square lattice networks, focusing on the Kolmogorov equation and probability generating functions.
