Related papers: Undirected graphs: is the shift-enabled condition …
We expand on some invariants used for classifying nonselfadjoint operator algebras. Specifically to nonselfadjoint operator algebras which have a conditional expectation onto a commutative diagonal we construct an edge-colored directed…
The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positively and negatively pseudo-inverse matrices and graphs. We…
Let $D$ be an oriented graph with skew adjacency matrix $S(D)$. Two oriented graphs $D$ and $C$ are said to share the same generalized skew spectrum if $S(D)$ and $S(C)$ have the same eigenvalues, and $J-S(D)$ and $J-S(C)$ also have the…
This paper addresses questions regarding controllability for `generic parameter' dynamical systems, i.e. the question whether a dynamical system is `structurally controllable'. Unlike conventional methods that deal with structural…
In the past years, many signal processing operations have been successfully adapted to the graph setting. One elegant and effective approach is to exploit the eigendecomposition of a graph shift operator (GSO), such as the adjacency or…
We introduce the notion of balanced strong shift equivalence between square nonnegative integer matrices, and show that two finite graphs with no sinks are one-sided eventually conjugate if and only if their adjacency matrices are conjugate…
Graph embedding algorithms are used to efficiently represent (encode) a graph in a low-dimensional continuous vector space that preserves the most important properties of the graph. One aspect that is often overlooked is whether the graph…
The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information.
Shift-invariant spaces (SISs) on the real line provide a natural framework for representing, analyzing and processing signals with inherent shift-invariant structure. In this paper, we extend this framework to the finite undirected graph…
This paper deals with stability of discrete-time switched linear systems whose all subsystems are unstable and the set of admissible switching signals obeys pre-specified restrictions on switches between the subsystems and dwell times on…
We discuss ways in which momentum operators can be introduced on an oriented metric graph. A necessary condition appears to the balanced property, or a matching between the numbers of incoming and outgoing edges; we show that a graph…
A number of inference problems with sensor networks involve projecting a measured signal onto a given subspace. In existing decentralized approaches, sensors communicate with their local neighbors to obtain a sequence of iterates that…
The spectral properties of signed directed graphs, which may be naturally obtained by assigning a sign to each edge of a directed graph, have received substantially less attention than those of their undirected and/or unsigned counterparts.…
It is shown that an undirected graph $G$ is cospectral with the Hermitian adjacency matrix of a mixed graph $D$ obtained from a subgraph $H$ of $G$ by orienting some of its edges if and only if $H=G$ and $D$ is obtained from $G$ by a…
Randomising networks using a naive `accept-all' edge-swap algorithm is generally biased. Building on recent results for nondirected graphs, we construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities for…
An emerging way of tackling the dimensionality issues arising in the modeling of a multivariate process is to assume that the inherent data structure can be captured by a graph. Nevertheless, though state-of-the-art graph-based methods have…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Let $S$ be a set of transpositions generating the symmetric group $S_n$. The transposition graph of $S$ is defined to be the graph with vertex set $\{1,\ldots,n\}$, and with vertices $i$ and $j$ being adjacent in $T(S)$ whenever $(i,j) \in…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
Flip graphs of non-crossing configurations in the plane are widely studied objects, e.g., flip graph of triangulations, spanning trees, Hamiltonian cycles, and perfect matchings. Typically, it is an easy exercise to prove connectivity of a…