Related papers: Spectral properties of weighted line digraphs
The operator-theoretic dichotomy underlying diffusion on directed networks is \emph{symmetry versus non-self-adjointness} of the Markov transition operator. In the reversible (detailed-balance) regime, a directed random walk $P$ is…
Using Hankel operators and shift-invariant subspaces on Hilbert space, this paper develops the theory of the operators associated with soft and hard edges of eigenvalue distributions of random matrices. Tracy and Widom introduced a…
Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound.…
Let $G$ be an $n$-vertex graph with adjacency matrix $A$, and $W=[e,Ae,\ldots,A^{n-1}e]$ be the walk matrix of $G$, where $e$ is the all-one vector. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author showed that any graph…
In this note we present some properties of the Dirac operator on noncompact metric graphs with Kirchoff-type vertex conditions. In particular, we discuss the specific features of the spectrum of the operator and, finally, we give some…
In this paper we introduce and study generally non-self-adjoint realizations of the Dirac operator on an arbitrary finite metric graph. Employing the robust boundary triple framework, we derive, in particular, a variant of the Birman…
With the advance of complex large-scale networks, it is becoming increasingly important to understand how selfish and spatially distributed individuals will share network resources without centralized coordinations. In this paper, we…
In the first part of this manuscript a relationship between the spectrum of self-adjoint operator matrices and the spectra of their diagonal entries is found. This leads to enclosures for spectral points and in particular, enclosures for…
It is well known that the edge vector space of an oriented graph can be decomposed in terms of cycles and cocycles (alias cuts, or bonds), and that a basis for the cycle and the cocycle spaces can be generated by adding and removing edges…
The \emph{resistance matrix} of a simple connected graph $G$ is denoted by $R$, and is defined by $R =(r_{ij})$, where $r_{ij}$ is the resistance distance between the vertices $i$ and $j$ of $G$. In this paper, we consider the resistance…
As an outgrowth of our investigation of non-regular spaces within the context of quantum gravity and non-commutative geometry, we develop a graph Hilbert space framework on arbitrary (infinite) graphs and use it to study spectral properties…
We study the properties of several proximity measures for the vertices of weighted multigraphs and multidigraphs. Unlike the classical distance for the vertices of connected graphs, these proximity measures are applicable to weighted…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
Let $(G,w)$ be an undirected weighted graph. The group inverse of $(G,w)$ is the weighted graph with the adjacency matrix $A^{\#}$, where $A$ is the adjacency matrix of $(G,w)$. We study the group inverse of singular weighted trees. It is…
A signed graph is one that features two types of edges: positive and negative. Balanced signed graphs are those in which all cycles contain an even number of positive edges. In the adjacency matrix of a signed graph, entries can be $0$,…
A powerful framework for studying graphs is to consider them as geometric graphs: nodes are randomly sampled from an underlying metric space, and any pair of nodes is connected if their distance is less than a specified neighborhood radius.…
Originating from spectral graph theory, cospectrality is a powerful generalization of exchange symmetry and can be applied to all real-valued symmetric matrices. Two vertices of an undirected graph with real edge weights are cospectral iff…
In this paper we propose a model for describing advection dynamics on distance-weighted directed graphs. To this end we establish a set of key properties, or axioms, that a discrete advection operator should satisfy, and prove that there…
We show that certain representations of graphs by operators on Hilbert space have uses in signal processing and in symbolic dynamics. Our main result is that graphs built on automata have fractal characteristics. We make this precise with…
We study a model of random graphs where each edge is drawn independently (but not necessarily identically distributed) from the others, and then assigned a random weight. When the mean degree of such a graph is low, it is known that the…