Discusses challenges in comparing non-Euclidean data, proposing a Laplacian-based solution for graph alignment and exploring optimal transport for graph distance computation.
Explores convergence results for periodic case reversibility in Markov chains, covering irreducible chains, positive recurrence, reversible processes, and random walks on finite graphs.
Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.
