42 citations · 105 across the 9 of their papers we have counts for
10 papers
A Critical Pair Enumeration Algorithm for String Diagram Rewriting
Anna Matsui, Innocent Obi, Guillaume Sabbagh +4
Critical pair analysis provides a convenient and computable criterion of confluence, which is a fundamental property in rewriting theory, for a wide variety of rewriting systems. B…
Geometric multiplicity of unitary non-backtracking eigenvalues
Leo Torres
We completely characterize the conditions under which a complex unitary number is an eigenvalue of the non-backtracking matrix of an undirected graph. Further, we provide a closed…
Spectral theory of the non-backtracking Laplacian for graphs
Jürgen Jost, Raffaella Mulas, Leo Torres
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that…
The Perron non-backtracking eigenvalue after node addition
Leo Torres
Consider a finite undirected unweighted graph G and add a new node to it arbitrarily connecting it to pre-existing nodes. We study the behavior of the Perron eigenvalue of the non-…
netrd: A library for network reconstruction and graph distances
Stefan McCabe, Leo Torres, Timothy LaRock +4
Over the last two decades, alongside the increased availability of large network datasets, we have witnessed the rapid rise of network science. For many systems, however, the data…
Non-backtracking Spectrum: Unitary Eigenvalues and Diagonalizability
Leo Torres
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second…