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

In this paper, we define and study the concept of traceable regressions. These are sequences of regressions in joint or single responses for which a corresponding regression graph captures not only an independence structure but represents,…

The main object considered in this paper is the trace function, defined as a suitably normalized trace of a product of intertwining operators for the Drinfeld-Jimbo quantum group, multiplied by the exponential of an element of the Cartan…

By assigning a probability measure via the spectrum of the normalized Laplacian to each graph and using L^p Wasserstein distances between probability measures, we define the corresponding spectral distances d_p on the set of all graphs.…

Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…

Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…

Let $G$ be a connected quasi-split reductive group over $\mathbb{R}$, and more generally, a quasi-split $K$-group over $\mathbb{R}$. Arthur had obtained the formal formula for the spectral side of the stable local trace formula, by using…

This paper investigates spectral properties of the deformed Laplacian matrix, which merges the Laplacian and signless Laplacian matrices of a graph through a one-parameter family of matrices. We present general results on the eigenvalues of…

Low-dimensional periodic arrays of scatterers with a moving point particle are ideal models for studying deterministic diffusion. For such systems the diffusion coefficient is typically an irregular function under variation of a control…

We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…

As an indicator of the stability of spectral clustering of an undirected weighted graph into $k$ clusters, the $k$th spectral gap of the graph Laplacian is often considered. The $k$th spectral gap is characterized in this paper as an…

Using path-integral methods, a formula is deduced for the noise-induced escape rate from an attracting fixed point across an unstable fixed point in one-dimensional maps. The calculation starts from the trace formula for the eigenvalues of…

We study structure, eigenvalue spectra and diffusion dynamics in a wide class of networks with subgraphs (modules) at mesoscopic scale. The networks are grown within the model with three parameters controlling the number of modules, their…

Graphs possess exotic features like variable size and absence of natural ordering of the nodes that make them difficult to analyze and compare. To circumvent this problem and learn on graphs, graph feature representation is required. A good…

The spectral theory of the Laplace differential operator for biregular quantum graphs is developed. Trees are studied in detail. Generating functions for closed non backtracking walks appear when resolvents for trees are related to…

We consider Schr\"odinger operators with periodic magnetic and electric potentials on periodic discrete graphs. The spectrum of such operators consists of a finite number of bands. We determine trace formulas for the magnetic Schr\"odinger…

We consider random walks in the form of nearest-neighbor hopping on Erdos-Renyi random graphs of finite fixed mean degree c as the number of vertices N tends to infinity. In this regime, using statistical field theory methods, we develop an…

In this paper, we give a short proof of the weak convergence to the Kesten-McKay distribution for the normalized spectral measures of random $N$-lifts. This result is derived by generalizing a formula of Friedman involving Chebyshev…

The distance matrix $\mathcal{D}(G)$ of a graph $G$ is the matrix containing the pairwise distances between vertices, and the distance Laplacian matrix is $\mathcal{D}^L(G)=T(G)-\mathcal{D}(G)$, where $T(G)$ is the diagonal matrix of row…

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

We propose a new class of traces motivated by a trace/trace class property discovered by Laurie, Nordgren, Radjavi and Rosenthal concerning products of operators outside the trace class. Spectral traces, traces that depend only on the…