Related papers: Trace Formulae and Spectral Statistics for Discret…
The Guillemin-Uribe trace formula is a semiclassical version of the Selberg trace formula and more general Duistermaat-Guillemin formula for elliptic operators on compact manifolds, which reflects the dynamics of magnetic geodesic flows in…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We study the average probability that a discrete-time quantum walk finds a marked vertex on a graph. We first show that, for a regular graph, the spectrum of the transition matrix is determined by the weighted adjacency matrix of an…
We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…
The walk matrix associated to an $n\times n$ integer matrix $X$ and an integer vector $b$ is defined by $W := (b,X b, . . . ,X^{n-1} b)$. We study limiting laws for the cokernel of $W$ in the scenario where $X$ is a random matrix with…
The main goal of the paper is to characterize new classes of multicone graphs which are determined by both adjacency and Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. A wheel graph obtained…
Understanding how a vertex relates to a set of vertices is a fundamental task in graph analysis. Given a graph $G$ and a vertex set $X \subseteq V(G)$, consider the collection of subsets of the form $N(u) \cap X$ where $u$ ranges over all…
The spectral excess theorem states that, in a regular graph G, the average excess, which is the mean of the numbers of vertices at maximum distance from a vertex, is bounded above by the spectral excess (a number that is computed by using…
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 spectrum of this operator captures several structural…
Periodic orbits (equivalence classes of closed paths up to cyclic shifts) play an important role in applications of graph theory. For example, they appear in the definition of the Ihara zeta function and exact trace formulae for the spectra…
A parallel $d$-stable trace is a closed walk which traverses every edge of a graph exactly twice in the same direction and for every vertex $v$, there is no subset $X \subseteq N(v)$ with $1 \leq |N| \leq d$ such that every time the walk…
In this paper, we study dual quaternion and dual complex unit gain graphs and their spectral properties in a unified frame of dual unit gain graphs. Unit dual quaternions represent rigid movements in the 3D space, and have wide applications…
Two-dimensional dielectric microcavities are of widespread use in microoptics applications. Recently, a trace formula has been established for dielectric cavities which relates their resonance spectrum to the periodic rays inside the…
Discrete Green's functions are the inverses or pseudo-inverses of combinatorial Laplacians. We present compact formulas for discrete Green's functions, in terms of the eigensystems of corresponding Laplacians, for products of regular graphs…
We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…
In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time…
We evaluate the Gutzwiller trace formula for the level density of classically chaotic systems by considering the level density in a bounded energy range and truncating its Fourier integral. This results in a limiting procedure which…
We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…
We develop the theory of modulated operators in general principal ideals of compact operators. For Laplacian modulated operators we establish Connes' trace formula in its local Euclidean model and a global version thereof. It expresses…
We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…