Non-backtracking cycles and the length spectrum of graphs
- Leo Torres (MPI MiS, Leipzig)
This talk will explore the relationship between the fundamental group, the length spectrum, and the non-backtracking cycles of a graph. A rigidity theorem says that the length spectrum determines the graph up to isomorphism. Based on this result, we develop a spectral algorithm to compare two graphs. We apply this algorithm to complex networks built from real-life data.