Related papers: Discrete trace formulas and holomorphic functional…
Trace formulae for d-regular graphs are derived and used to express the spectral density in terms of the periodic walks on the graphs under consideration. The trace formulae depend on a parameter w which can be tuned continuously to assign…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
A non-backtracking walk on a graph, $H$, is a directed path of directed edges of $H$ such that no edge is the inverse of its preceding edge. Non-backtracking walks of a given length can be counted using the non-backtracking adjacency…
We give some graph theoretical formulas for the trace $Tr_k(\mathbb {T})$ of a tensor $\mathbb {T}$ which do not involve the differential operators and auxiliary matrix. As applications of these trace formulas in the study of the spectra of…
We establish some relations between the spectra of simple and non-backtracking random walks on non-regular graphs, generalizing some well-known facts for regular graphs. Our two main results are 1) a quantitative relation between the mixing…
We study a general class of recurrence relations that appear in the application of a matrix diagonalization procedure. We find general closed formula and determine analytical properties of the solutions. We finally apply these findings in…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
We consider compact metric graphs with an arbitrary self adjoint realisation of the differential Laplacian. After discussing spectral properties of Laplacians, we prove several versions of trace formulae, relating Laplace spectra to sums…
Two trace formulas for the spectra of arbitrary Hermitian matrices are derived by transforming the given Hermitian matrix $H$ to a unitary analogue. In the first type the unitary matrix is $e^{i(\lambda\II - H)}$ where $\lambda$ is the…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
We derive an explicit formula for the fundamental solution $K_{T_{q+1}}(x,x_{0};t)$ to the discrete-time diffusion equation on the $(q+1)$-regular tree $T_{q+1}$ in terms of the discrete $I$-Bessel function. We then use the formula to…
We give a new proof of the trace formula for regular graphs. Our approach is inspired by path integral approach in quantum mechanics, and calculations are mostly combinatorial.
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…
The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…
Given a smooth manifold $M$ (with or without boundary), in this paper we study the regularisation of traces for the global pseudo-differential calculus in the context of non-harmonic analysis. Indeed, using the global pseudo-differential…
We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that determines the spectra of graphs up to a high…
Differential calculus on discrete sets is developed in the spirit of noncommutative geometry. Any differential algebra on a discrete set can be regarded as a `reduction' of the `universal differential algebra' and this allows a systematic…
We prove an analogue of Alon's spectral gap conjecture for random bipartite, biregular graphs. We use the Ihara-Bass formula to connect the non-backtracking spectrum to that of the adjacency matrix, employing the moment method to show there…
We compute explicitly (modulo solutions of certain algebraic equations) the spectra of infinite graphs obtained by attaching one or several infinite paths to some vertices of certain finite graphs. The main result concerns a canonical form…
Partially commutative monoids provide a powerful tool to study graphs, viewingwalks as words whose letters, the edges of the graph, obey a specific commutation rule. A particularclass of traces emerges from this framework, the hikes, whose…