Related papers: Discrete trace formulas and holomorphic functional…
We introduce a novel formulation for geometry on discrete points. It is based on a universal differential calculus, which gives a geometric description of a discrete set by the algebra of functions. We expand this mathematical framework so…
We introduce a transfer matrix method for the spectral analysis of discrete Hermitian operators with locally finite hopping. Such operators can be associated with a locally finite graph structure and the method works in principle on any…
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. It is known that verifying vertex non-adjacency in the 1-skeleton of the symmetric and asymmetric traveling salesperson…
We derive exact equations that determine the spectra of undirected and directed sparsely connected regular graphs containing loops of arbitrary length. The implications of our results to the structural and dynamical properties of networks…
We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…
In this paper, we mainly study the trace norm of the adjacency matrix of a graph, also known as the energy of graph. We give the maximum trace norms for the graph and its complement. In fact, the above problem is stated and solved in a more…
Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of a graph also known as the communicability. The walk…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For every real $\alpha\in\left[ 0,1\right] $, write $A_{\alpha}\left( G\right) $ for the matrix \[ A_{\alpha}\left( G\right)…
Sampling algorithms, hypergraph degree sequences, and polytopes play a crucial role in statistical analysis of network data. This article offers a brief overview of open problems in this area of discrete mathematics from the point of view…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
In the past decades, one of the most fruitful approaches to the study of algebraic $K$-theory has been trace methods, which construct and study trace maps from algebraic $K$-theory to topological Hochschild homology and related invariants.…
Following our joint work arXiv:1003.4578 with Robert Langlands, we make the first steps toward developing geometric methods for analyzing trace formulas in the case of the function field of a curve defined over a finite field. We also…
The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…
We introduce a general approach to traces that we consider as linear continuous functionals on some function space where we focus on some special choices for that space. This leads to an integral calculus for the computation of the precise…
We study a dynamic version of the implicit trace estimation problem. Given access to an oracle for computing matrix-vector multiplications with a dynamically changing matrix A, our goal is to maintain an accurate approximation to A's trace…
We present a matrix technique to obtain the spectrum and the analytical index of some elliptic operators defined on compact Riemannian manifolds. The method uses matrix representations of the derivative which yield exact values for the…
In case of sparse graphs, relation between the real eigenvalues of the non-backtracking matrix and those of the non-backtracking transition probability matrix is considered with respect to vertex clustering. For this purpose, the random…