相关论文: Spectral properties of weighted line digraphs
We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…
In this paper we consider the problem of defining transforms for signals on directed graphs, with a specific focus on defective graphs where the corresponding graph operator cannot be diagonalized. Our proposed method is based on the Schur…
A connected dominating set in a graph is a dominating set of vertices that induces a connected subgraph. Following analogous studies in the literature related to independent sets, dominating sets, and total dominating sets, we study in this…
Graphs are a central tool in machine learning and information processing as they allow to conveniently capture the structure of complex datasets. In this context, it is of high importance to develop flexible models of signals defined over…
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 consider a Gibbs distribution over all spanning trees of an undirected, edge weighted finite graph, where, up to normalization, the probability of each tree is given by the product of its edge weights. Defining the weighted degree of a…
The distance matrix of a connected graph is the symmetric matrix with columns and rows indexed by the vertices and entries that are the pairwise distances between the corresponding vertices. We give a construction for graphs which differ in…
Arrangement graphs were introduced for their connection to computational networks and have since generated considerable interest in the literature. In a pair of recent articles by Chen, Ghorbani and Wong, the eigenvalues for the adjacency…
A mixed graph is obtained from a graph by orienting some of its edges. The Hermitian adjacency matrix of a mixed graph with the vertex set $ \{v_{1}, \ldots , v_{n}\} $, is the matrix $ H=[h_{ij}]_{n \times n} $, where $ h_{ij}=-h_{ji}=i $…
In this paper, we study spectral properties of generalized weighted Hilbert matrices. In particular, we establish results on the spectral norm, determinant, as well as various relations between the eigenvalues and eigenvectors of such…
Graph Neural Networks (GNNs) have established themselves as the leading models for learning on graph-structured data, generally categorized into spatial and spectral approaches. Central to these architectures is the Graph Shift Operator…
Parameter-dependent statistical properties of spectra of totally connected irregular quantum graphs with Neumann boundary conditions are studied. The autocorrelation functions of level velocities c(x) and c(w,x) as well as the distributions…
It is well-known that, in Linear Dynamics, the most studied class of linear operators is certainly that of weighted shifts, on the separable Banach spaces $c_0$ and $\ell^p$, $1 \leq p< \infty$. Over the last decades, the intensive study of…
A weighted digraph is a digraph such that every arc is assigned a nonnegative number, called the weight of the arc. The weighted outdegree of a vertex $v$ in a weighted digraph $D$ is the sum of the weights of the arcs with $v$ as their…
This paper studies graph-based active learning, where the goal is to reconstruct a binary signal defined on the nodes of a weighted graph, by sampling it on a small subset of the nodes. A new sampling algorithm is proposed, which…
We investigate the relationship between the structure of a discrete graphical model and the support of the inverse of a generalized covariance matrix. We show that for certain graph structures, the support of the inverse covariance matrix…
Let $(X,E_X)$ and $(V,E_V)$ be finite connected graphs without loops. We assume that $V$ has two distinguished vertices $a,b$ and an automorphism $\gamma$ which exchanges $a$ and~$b$. The $V$-edge substitution of $X$ is the graph $X[V]$…
Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…
In the field of graph signal processing (GSP), directed graphs present a particular challenge for the "standard approaches" of GSP to due to their asymmetric nature. The presence of negative- or complex-weight directed edges, a graphical…
The spectral properties of a class of non-selfadjoint second order elliptic operators with indefinite weight functions on unbounded domains $\Omega$ are investigated. It is shown that under an abstract regularity assumption the nonreal…