Related papers: Eigenvalues of the normalized complex Laplacian on…
We study the spectra and eigenvectors of the adjacency matrices of scale-free networks when bi-directional interaction is allowed, so that the adjacency matrix is real and symmetric. The spectral density shows an exponential decay around…
In this paper, we study eigenvalues of the poly-Laplacian with arbitrary order on a bounded domain in an n-dimensional Euclidean space and obtain a lower bound for eigenvalues, which generalizes the results due to Cheng-Wei [5] and gives an…
We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…
In this paper, we investigate critical points of the Laplacian's eigenvalues considered as functionals on the space of Riemmannian metrics or a conformal class of metrics on a compact manifold. We obtain necessary and sufficient conditions…
Much effort has been spent on characterizing the spectrum of the non-backtracking matrix of certain classes of graphs, with special emphasis on the leading eigenvalue or the second eigenvector. Much less attention has been paid to the…
Using our previously published algorithm, we analyze the eigenvectors of the generalized Laplacian for two metric graphs occurring in practical applications. As expected, localization of an eigenvector is rare and the network should be…
We describe the spectrum of a non-self-adjoint elliptic system on a finite interval. Under certain conditions we find that the eigenvalues form a discrete set and converge asymptotically at infinity to one of several straight lines. The…
In this paper, we study the first eigenvalue of a nonlinear elliptic system involving $p$-Laplacian as the differential operator. The principal eigenvalue of the system and the corresponding eigenfunction are investigated both analytically…
In this paper, we obtain the bounds of the extreme eigenvalues of a normalized and signless Laplacian matrices using by their traces. In addition, we determine the bounds for k-th eigenvalues of normalized and signless Laplacian matrices.
In this note we consider a pair of particles moving on the positive half-line with the pairing generated by a hard-wall potential. This model was first introduced in [arXiv:1604.06693] and later applied to investigate condensation of pairs…
Discrete amorphous materials are best described in terms of arbitrary networks which can be embedded in three dimensional space. Investigating the thermodynamic equilibrium as well as non-equilibrium behavior of such materials around second…
We compute spectra of symmetric random matrices describing graphs with general modular structure and arbitrary inter- and intra-module degree distributions, subject only to the constraint of finite mean connectivities. We also evaluate…
We provide eigenvalue asymptotics for a Dirac-type operator on $\mathbb Z^n$, $n\geq 2$, perturbed by multiplication operators that decay as $|\mu|^{-\gamma}$ with $\gamma<n$. We show that the eigenvalues accumulate near the value of the…
We study the spectral zeta functions of the Laplacian on fractal sets which are locally self-similar fractafolds, in the sense of Strichartz. These functions are known to meromorphically extend to the entire complex plane, and the locations…
For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…
Intertwining analysis, algebra, numerical analysis and optimization, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of…
We study the graphs associated with Vicsek sets in higher dimensional settings. First, we study the eigenvalues of the Laplacians on the approximating graphs of the Vicsek sets, finding a general spectral decimation function. This is an…