相关论文: Trace Formulae and Spectral Statistics for Discret…

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…

Resonance spectra of two-dimensional dielectric microwave resonators of circular and square shapes have been measured. The deduced length spectra of periodic orbits were analyzed and a trace formula for dielectric resonators recently…

This paper presents some relations for orthonormal bases in the Minkowski space and isotropic tetrads constructed from the vectors of these bases. As an example of an application of the obtained formulae, in particular recursion relations,…

We generalize the scattering approach to quantum graphs to quantum graphs with with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and…

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…

Statistical field theory methods have been very successful with a number of random graph and random matrix problems, but it is challenging to apply these methods to graphs with prescribed degree sequences due to the extensive number of…

The number of walks from one vertex to another in a finite graph can be counted by the adjacency matrix. In this paper, we prove two theorems that connect the graph Laplacian with two types of walks in a graph. By defining two types of…

This paper gives combinatorial formulas for discrete series constants, both stable and unstable, on real reductive groups. It also carries out one step of the comparison of the topological trace formula for Hecke operators with Arthur's…

We consider the Dyson hierarchical graph $\mathcal{G}$, that is a weighted fully-connected graph, where the pattern of weights is ruled by the parameter $\sigma \in (1/2, 1]$. Exploiting the deterministic recursivity through which…

In this work we introduce a concept of complexity for undirected graphs in terms of the spectral analysis of the Laplacian operator defined by the incidence matrix of the graph. Precisely, we compute the norm of the vector of eigenvalues of…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We give a new, simple proof of the trace formula for Hecke operators on modular forms for finite index subgroups of the modular group. The proof uses algebraic properties of certain universal Hecke operators acting on period polynomials of…

Complex numbers define the relationship between entities in many situations. A canonical example would be the off-diagonal terms in a Hamiltonian matrix in quantum physics. Recent years have seen an increasing interest to extend the tools…

The main purpose of these lectures is to discuss briefly recent methods of calculation of statistical properties of quantum eigenvalues for chaotic systems based on semi-classical trace formulas. Under the assumption that periodic orbit…

We give the first specific conjectures on how frequently graphs satisfy sufficient conditions for being uniquely characterized by spectral information. These conjectures arise from a theoretical framework that we developed based on…

For a simple connected graph $G$, let $D(G)$, $Tr(G)$, $D^{L}(G)$ and $D^{Q}(G)$, respectively be the distance matrix, the diagonal matrix of the vertex transmissions, distance Laplacian matrix and the distance signless Laplacian matrix of…

We give the spectral representation for a class of selfadjoint discrete graph Laplacians $\Delta$, with $\Delta$ depending on a chosen graph $G$ and a conductance function $c$ defined on the edges of $G$. We show that the spectral…

Kemeny's constant measures how fast a random walker moves around in a graph. Expressions for Kemeny's constant can be quite involved, and for this reason, many lines of research focus on graphs with structure that makes them amenable to…

We establish the invariant trace formula (\`a la Arthur) for the ad\'elic covers of connected reductive groups over a number field, under the hypothesis that the trace Paley-Wiener theorem is verified for all Levi subgroups at the real…

Periodic orbit theory allows calculations of long time properties of chaotic systems from traces, dynamical zeta functions and spectral determinants of deterministic evolution operators, which are in turn evaluated in terms of periodic…