Related papers: The adjacency matrix and the discrete Laplacian ac…
We extend Latimer and MacDuffee's theorem to a general commutative domain and apply this result to study similarity of matrices over integral rings of number fields. We also conjecture similarity over discrete valuation rings can be descent…
We study the set of all determinants of adjacency matrices of graphs with a given number of vertices.
We consider the Laplacian and its fractional powers of order less than one on the complement $\mathbb{R}^d\setminus\Sigma$ of a given compact set $\Sigma\subset \mathbb{R}^d$ of zero Lebesgue measure. Depending on the size of $\Sigma$, the…
We study Laplacians on graphs and networks via regular Dirichlet forms. We give a sufficient geometric condition for essential selfadjointness and explicitly determine the generators of the associated semigroups on all $\ell^p$, $1\leq p <…
We investigate self-adjoint matrices $A\in\mathbb{R}^{n,n}$ with respect to their equivariance properties. We show in particular that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group…
We introduce the notion of discrete cusp for a weighted graph. In this context, we provethat the form-domain of the magnetic Laplacian and that of thenon-magnetic Laplacian can be different. We establish the emptiness of the essential…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We investigate the problem of completing partial matrices to rank-one matrices in the standard simplex. The motivation for studying this problem comes from statistics: A lack of eligible completion can provide a falsification test for…
Symmetric Jacobi matrices on one sided homogeneous trees are studied. Essential selfadjointness of these matrices turns out to depend on the structure of the tree. If a tree has one end and infinitely many origin points the matrix is always…
We find an infinite set of eigenfunctions for the Laplacian with respect to a flat metric with conical singularities and acting on degree zero bundles over special Riemann surfaces of genus greater than one. These special surfaces…
This paper deals with adjacency matrices of signed cycle graphs and chemical descriptors based on them. The eigenvalues and eigenvectors of the matrices are calculated and their efficacy in classifying different signed cycles is determined.…
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 discuss Laplacians on graphs in a framework of regular Dirichlet forms. We focus on phenomena related to unboundedness of the Laplacians. This includes (failure of) essential selfadjointness, absence of essential spectrum and stochastic…
In this paper, we discuss the adjacency matrices of finite undirected simple graphs over a finite prime field $\mathbb{F}_p$. We apply symmetric (row and column) elementary transformations to the adjacency matrix over $\mathbb{F}_p$ in…
This paper develops the exact linear relationship between the leading eigenvector of the unnormalized modularity matrix and the eigenvectors of the adjacency matrix. We propose a method for approximating the leading eigenvector of the…
Inspired by the notion of action convergence in graph limit theory, we introduce a measure-theoretic representation of matrices, and we use it to define a new notion of pseudo-metric on the space of matrices. Moreover, we show that such…
We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.
The goal of this note is to present some arguments leading to the conjecture that a formally self-adjoint differential operator on a closed manifold is essentially self-adjoint if and only if the Hamiltonian flow of its symbol is complete.…
In this paper, we define the adjacency matrix of a semigraph. We give the conditions for a matrix to be semigraphical and give an algorithm to construct a semigraph from the semigraphical matrices. We derive lower and upper bounds for…
We study the essential self-adjointness for real principal type differential operators. Unlike the elliptic case, we need geometric conditions even for operators on the Euclidean space with asymptotically constant coefficients, and we prove…