Prefer a chat interface with context about you and your work?
Non-backtracking Spectrum of Random Graphs: Community Detection and Non-regular Ramanujan Graphs
A non-backtracking walk on a graph is a directed path such that no edge is the inverse of its preceding edge. The non-backtracking matrix of a graph is indexed by its directed edges and can be used to count on-backtracking walks of a given length. It has been used recently …