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

Trace formula is an important method to study the Langlands program. Arthur obtains the existence of stable trace formula for connected reductive group. In this paper, we will give the explicit coarse trace formula of GL(4). In general…

We extend the noncommutative residue of M. Wodzicki on compactly supported classical pseudo-differential operators of order $-d$ and generalise A. Connes' trace theorem, which states that the residue can be calculated using a singular trace…

We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in $n=1,2,3,..$ dimensions. The fractional random walk dynamics is governed by a master equation…

Using quantum maps we study the accuracy of semiclassical trace formulas. The role of chaos in improving the semiclassical accuracy, in some systems, is demonstrated quantitatively. However, our study of the standard map cautions that this…

In this paper we consider the concept of preintersection numbers of a graph. These numbers are determined by the spectrum of the adjacency matrix of the graph, and generalize the intersection numbers of a distance-regular graph. By using…

In this article, we introduce a geometric and a spectral preorder relation on the class of weighted graphs with a magnetic potential. The first preorder is expressed through the existence of a graph homomorphism respecting the magnetic…

In this article we give a geometrical description of the (in general non-selfadjoint) in/out Laplacian $\mathcal{L}^{+/-} = (d^{+/-})^* d$ and adjacency matrix on digraphs with arbitrary weights, where $(d^{+/-})^*$ is the adjoint of the…

We stabilize the full Arthur-Selberg trace formula for the metaplectic covering of symplectic groups over a number field. This provides a decomposition of the invariant trace formula for metaplectic groups, which encodes information about…

We develop a general theory of random walks on hypergraphs which includes, as special cases, the different models that are found in literature. In particular, we introduce and analyze general random walk Laplacians for hypergraphs, and we…

We develop a theory of ultrametric graphons as limiting objects for random networks with nested hierarchical community structure. A graphon $W:[0,1]^2\to[0,1]$ is called ultrametric if $W(x,y)=w(d(x,y))$, where $d$ is an ultrametric on…

Let $H=(V,E)$ be an $r$-uniform hypergraph with the vertex set $V$ and the edge set $E$. For $1\leq s \leq r/2$, we define a weighted graph $G^{(s)}$ on the vertex set ${V\choose s}$ as follows. Every pair of $s$-sets $I$ and $J$ is…

This thesis provides an explicit, general trace formula for the Hecke and Casimir eigenvalues of GL(2)-automorphic representations over a global field. In special cases, we obtain Selberg's original trace formula. Computations for the…

Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…

We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…

We use a random walk in the ensemble of impurity configurations to generate a Brownian motion model for energy levels in disordered conductors. Treating arc-length along the random walk as fictitous time, the resulting Langevin equation…

We generalise the formula expressing the matrix trace of a given square matrix as the integral of the numerical values of $A$ over the Euclidean sphere to the unit spheres of finite-dimensional normed spaces that have a 1-symmetric basis.…

We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…

We construct a family of self-adjoint operators on the prime numbers whose entries depend on pairwise arithmetic divergences, replacing geometric distance with number-theoretic dissimilarity. The resulting spectra encode how coherence…

By varying a parameter of a one-dimensional piecewise smooth map, stable periodic orbits are observed. In this paper, complete analytic characterization of these stable periodic orbits is obtained. An interesting relationship between the…

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…