Related papers: Spectral Theory for Discrete Lapacians
Let $\Omega\subset\mathbb{R}^3$ be an open set, we study the spectral properties of the free Dirac operator $\mathcal{H}$ coupled with the singular potential $V_\kappa=(\epsilon I_4 +\mu\beta+\eta(\alpha\cdot N))\delta_{\partial\Omega}$.…
In the past decades, graphs that are determined by their spectrum have received more attention, since they have been applied to several fields, such as randomized algorithms, combinatorial optimization problems and machine learning. An…
We introduce a zeta function of digraphs that determines, and is determined by, the spectra of all linear combinations of the adjacency matrix, its transpose, the out-degree matrix, and the in-degree matrix. In particular, zeta-equivalence…
A propeller graph is obtained from an $\infty$-graph by attaching a path to the vertex of degree four, where an $\infty$-graph consists of two cycles with precisely one common vertex. In this paper, we prove that all propeller graphs are…
We study the symmetry properties of the spectra of normalized Laplacians on signed graphs. We find a new machinery that generates symmetric spectra for signed graphs, which includes bipartiteness of unsigned graphs as a special case.…
In this paper, we develop a two-stage distributed algorithm that enables nodes in a graph to cooperatively estimate the spectrum of a matrix $W$ associated with the graph, which includes the adjacency and Laplacian matrices as special…
We study Harper operators and the closely related discrete magnetic Laplacians (DML) on a graph with a free action of a discrete group, as defined by Sunada. A main result in this paper is that the spectral density function of DMLs…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
The spectral densities of the weighted Laplacian, random walk and weighted adjacency matrices associated with a random complex network are studied using the replica method. The link weights are parametrized by a weight exponent $\beta$.…
For $0\le \alpha\le 1$, Nikiforov proposed to study the spectral properties of the family of matrices $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ of a graph $G$, where $D(G)$ is the degree diagonal matrix and $A(G)$ is the adjacency matrix.…
Random unimodular lattice triangulations have been recently used as an embedded random graph model, which exhibit a crossover behaviour between an ordered, large-world and a disordered, small-world behaviour. Using the ergodic Pachner flips…
We construct C-algebras for a class of surfaces that are inverse images of certain polynomials of arbitrary degree. By using the directed graph associated to a matrix, the representation theory can be understood in terms of ``loop'' and…
Learning a graph with a specific structure is essential for interpretability and identification of the relationships among data. It is well known that structured graph learning from observed samples is an NP-hard combinatorial problem. In…
Recent experiments revealed that the dielectric dispersion spectrum of fission yeast cells in a suspension was mainly composed of two sub-dispersions. The low-frequency sub-dispersion depended on the cell length, while the high-frequency…
For the pair $\{-\Delta, -\Delta-\alpha\delta_\mathcal{C}\}$ of self-adjoint Schr\"{o}dinger operators in $L^2(\mathbb{R}^n)$ a spectral shift function is determined in an explicit form with the help of (energy parameter dependent)…
We describe the structure of those graphs that have largest spectral radius in the class of all connected graphs with a given degree sequence. We show that in such a graph the degree sequence is non-increasing with respect to an ordering of…
Two graphs are co-spectral if their respective adjacency matrices have the same multi-set of eigenvalues. A graph is said to be determined by its spectrum if all graphs that are co-spectral with it are isomorphic to it. We consider these…
The joint spectral theory of a system of pairwise commuting self-adjoint left-invariant differential operators L_1,...,L_n on a connected Lie group G is studied, under the hypothesis that the algebra generated by them contains a "weighted…
This paper studies the spectral behavior of large dimensional Chatterjee's rank correlation matrix when observations are independent draws from a high-dimensional random vector with independent continuous components. We show that the…
Given a graph Laplacian with positively and negatively weighted edges we are interested in characterizing the set of weights that give a particular spectral index, i.e.~give a prescribed number of positive, zero, and negative eigenvalues.…