Related papers: From Laplacian-to-Adjacency Matrix for Continuous …
We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…
Let $R$ be a Hermitian matrix. The energy of $R$, $\mathcal{E}(R)$, corresponds to the sum of the absolute values of its eigenvalues. In this work it is obtained two lower bounds for $\mathcal{E}(R).$ The first one generalizes a lower bound…
We study a new class of matrix models, formulated on a lattice. On each site are $N$ states with random energies governed by a Gaussian random matrix Hamiltonian. The states on different sites are coupled randomly. We calculate the density…
We discuss spectral properties of the Laplacian with multiple ($N$) point interactions in two-dimensional bounded regions. A mathematically sound formulation for the problem is given within the framework of the self-adjoint extension of a…
Graph Laplacians on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of either $\delta$ or $\delta'$ type. In either case, an infinite series of trace formulae which…
Automata networks, and in particular Boolean networks, are used to model diverse networks of interacting entities. The interaction graph of an automata network is its most important parameter, as it represents the overall architecture of…
Using the transfer matrix method for Axial Next-Nearest Neighbor Ising model without an external field on a closed chain of spins of width 2 in the direction of interaction of only nearest neighbors and length L in the direction of…
We evaluate the high temperature limit of the free energy of spin glasses on the hypercube with Hamiltonian $H_N(\sigma) = \sigma^T J \sigma$, where the coupling matrix $J$ is drawn from certain symmetric orthogonally invariant ensembles.…
We study space and time efficient quantum algorithms for two graph problems -- deciding whether an $n$-vertex graph is a forest, and whether it is bipartite. Via a reduction to the s-t connectivity problem, we describe quantum algorithms…
We propose representation of configurational physical quantities and microscopic structures for multicomponent system on lattice, by extending a concept of generalized Ising model (GIM) to graph theory. We construct graph Laplacian (and…
We consider a one-dimensional lattice system of unbounded, real-valued spins. We allow arbitrary strong, attractive, nearest-neighbor interaction. We show that the free energy of the canonical ensemble converges uniformly in $C^2$ to the…
Effective graph resistance is a fundamental structural metric in network science, widely used to quantify global connectivity, compare network architectures, and assess robustness in flow-based systems. Despite its importance, current…
A complex unit gain graph ($ \mathbb{T} $-gain graph), $ \Phi=(G, \varphi) $ is a graph where the function $ \varphi $ assigns a unit complex number to each orientation of an edge of $ G $, and its inverse is assigned to the opposite…
We address the presence of bound entanglement in strongly-interacting spin systems at thermal equilibrium. In particular, we consider thermal graph states composed of an arbitrary number of particles. We show that for a certain range of…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…
This paper presents estimates of the convergence rate and complexity of an algebraic multilevel preconditioner based on piecewise constant coarse vector spaces applied to the graph Laplacian. A bound is derived on the energy norm of the…
The aim of this paper is to propose a novel framework to infer the sheaf Laplacian, including the topology of a graph and the restriction maps, from a set of data observed over the nodes of a graph. The proposed method is based on sheaf…
Quantum magnets with a large SU($N$) symmetry are a promising playground for the discovery of new forms of exotic quantum matter. Motivated by recent experimental efforts to study SU($N$) quantum magnetism in samples of ultracold fermionic…
The extended adjacency matrix of a graph with $n$ vertices is a real symmetric matrix of order $n\times n$ whose $(i,j)$-th entry is the average of the ratio of the degree of the vertex $i$ to that of the vertex $j$ and its reciprocal when…
For a graph with largest normalized Laplacian eigenvalue $\lambda_N$ and (vertex) coloring number $\chi$, it is known that $\lambda_N\geq \chi/(\chi-1)$. Here we prove properties of graphs for which this bound is sharp, and we study the…