Related papers: Trace Formulae and Spectral Statistics for Discret…
We compute the spectral density for ensembles of of sparse symmetric random matrices using replica, managing to circumvent difficulties that have been encountered in earlier approaches along the lines first suggested in a seminal paper by…
Wave propagation and acoustic scattering problems require vast computational resources to be solved accurately at high frequencies. Asymptotic methods can make this cost potentially frequency independent by explicitly extracting the…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
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…
In the recent years, the trace norm of graphs has been extensively studied under the name of graph energy. The trace norm is just one of the Ky Fan k-norms, given by the sum of the k largest singular values, which are studied more generally…
In this article we study spectral properties of the family of Schreier graphs associated to the action of the Thompson group $F$ on the interval [0,1]. In particular, we describe spectra of Laplace type operators associated to these…
We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…
In this paper, we provide faster algorithms for computing various fundamental quantities associated with random walks on a directed graph, including the stationary distribution, personalized PageRank vectors, hitting times, and escape…
Hypergraphs are used in machine learning to model higher-order relationships in data. While spectral methods for graphs are well-established, spectral theory for hypergraphs remains an active area of research. In this paper, we use random…
We investigate the structure of conformally rigid graphs. Graphs are conformally rigid if introducing edge weights cannot increase (decrease) the second (last) eigenvalue of the Graph Laplacian. Edge-transitive graphs and distance-regular…
Let F be a number field and $\widetilde{\mathrm{Sp}}(2n)$ be the metaplectic covering of Weil of $\mathrm{Sp}(2n, \mathbb{A}_F)$. We stabilize the elliptic semi-simple terms of the genuine part of trace formula for…
We investigate trace formulas for one-dimensional Schroedinger operators which are trace class perturbations of quasi-periodic finite-gap operators using Krein's spectral shift theory. In particular, we establish the conserved quantities…
We review the problem of how to compute the spectral density of sparse symmetric random matrices, i.e. weighted adjacency matrices of undirected graphs. Starting from the Edwards-Jones formula, we illustrate the milestones of this line of…
We prove a unified trace-average formula for the $k$-th higher trace $\lambda_k(A)=\operatorname{tr}(\Lambda^k A)$ of a linear operator $A$ on a finite-dimensional normed space. The formula averages the matrix coefficient…
It has been alleged in several papers that the so called delayed continuous-time random walks (DCTRWs) provide a model for the one-dimensional telegraph equation at microscopic level. This conclusion, being widespread now, is strange, since…
We consider the Schroedinger operator on graphs and study the spectral statistics of a unitary operator which represents the quantum evolution, or a quantum map on the graph. This operator is the quantum analogue of the classical evolution…
Dielectric resonators are open systems particularly interesting due to their wide range of applications in optics and photonics. In a recent paper [PRE, vol. 78, 056202 (2008)] the trace formula for both the smooth and the oscillating parts…
We address the Laplacian on a perturbed periodic graph which might not be a periodic graph. We present a class of perturbed graphs for which the essential spectra of the Laplacians are stable even when the graphs are perturbed by adding and…
The paper establishes the Krein and Koplienko trace formulas for multivariable operator functions on symmetrically normed ideals of bounded operators. Results are proved for self-adjoint and maximal dissipative operators. They cover both…
We pursue Arthur's invariant trace formula for certain coverings of connected reductive groups by deducing explicit formulas for its spectral side. This is based on some results in local harmonic analysis from an earlier preprint. The…