Related papers: Spectral Analysis of Certain Spherically Homogeneo…
The spectral properties of the Laplacian on a class of quantum graphs with random metric structure are studied. Namely, we consider quantum graphs spanned by the simple $\ZZ^d$-lattice with $\delta$-type boundary conditions at the vertices,…
Here we study the spectral properties of an underlying weighted graph of a non-uniform hypergraph by introducing different connectivity matrices, such as adjacency, Laplacian and normalized Laplacian matrices. We show that different…
We compare the spectral properties of two kinds of linear operators characterizing the (classical) geodesic flow and its quantization on connected locally finite graphs without dead ends. The first kind are transfer operators acting on…
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…
It is basic question in biology and other fields to identify the char- acteristic properties that on one hand are shared by structures from a particular realm, like gene regulation, protein-protein interaction or neu- ral networks or…
For a two-parameter family of Jacobi matrices exhibiting first-order spectral phase transitions, we prove discreteness of the spectrum in the positive real axis when the parameters are in one of the transition boundaries. To this end we…
In this paper we establish some spectral conditions for a graph to be Hamilton-connected in terms of the spectral radius of the adjacency matrix or the signless Laplacian of the graph or its complement. For the existence of Hamiltonian…
Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…
In this paper, we study the Hamiltonicity of graphs with large minimum degree. Firstly, we present some conditions for a simple graph to be Hamilton-connected and traceable from every vertex in terms of the spectral radius of the graph or…
Problems related to graph matching and isomorphisms are very important both from a theoretical and practical perspective, with applications ranging from image and video analysis to biological and biomedical problems. The graph matching…
In this paper, we investigate the spectral properties of the adjacency and the Laplacian matrices of random graphs. We prove that: (i) the law of large numbers for the spectral norms and the largest eigenvalues of the adjacency and the…
We study basic spectral features of graph Laplacians associated with a class of rooted trees which contains all regular trees. Trees in this class can be generated by substitution processes. Their spectra are shown to be purely absolutely…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
By definition, a Jacobi field $J=(J(\phi))_{\phi\in H_+}$ is a family of commuting selfadjoint three-diagonal operators in the Fock space $\mathcal F(H)$. The operators $J(\phi)$ are indexed by the vectors of a real Hilbert space $H_+$. The…
A system made up of N interacting species is considered. Self-reaction terms are assumed of the logistic type. Pairwise interactions take place among species according to different modalities, thus yielding a complex asymmetric disordered…
A Jacobi matrix with matrix entries is a self-adjoint block tridiagonal matrix with invertible blocks on the off-diagonals. Averaging over boundary conditions leads to explicit formulas for the averaged spectral measure which can…
There is a wealth of applied problems that can be posed as a dynamical system defined on a network with both attractive and repulsive interactions. Some examples include: understanding synchronization properties of nonlinear oscillator;,…
The Helmholtzian matrix of a graph $G=(V(G),E(G))$ is a graph-theoretic analogue of the vector Laplacian (or Helmholtz operator) [S. Li, L. Lu, J.F. Wang, A graph discretization of vector Laplacian, 379 (2026) 446--460]. Motivated by the…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…