Related papers: Weighted shifts on directed forests and hyponormal…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…
In recent years, there have been intense research efforts to develop efficient methods for probabilistic inference in probabilistic influence diagrams or belief networks. Many people have concluded that the best methods are those based on…
The discrete Green's functions are the pseudoinverse (or the inverse) of the Laplacian (or its variations) of a graph. In this paper, we will give combinatorial interpretations of Green's functions in terms of enumerating trees and forests…
We study jointly quasinormal and spherically quasinormal pairs of commuting operators on Hilbert space, as well as their powers. We first prove that, up to a constant multiple, the only jointly quasinormal $2$-variable weighted shift is the…
Let $\mathscr T$ be a rooted directed tree with finite branching index $k_{\mathscr T}$ and let $S_{\lambda} \in B(l^2(V))$ be a left-invertible weighted shift on ${\mathscr T}$. We show that $S_{\lambda}$ can be modelled as a…
This paper is devoted to the study of propagation phenomena for $2$--hyponormal, quadratically hyponormal, and cubically hyponormal operator-valued weighted shifts. \ First, we show that every {\it quadratically} hyponormal matrix-valued…
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…
To most mathematicians and computer scientists the word ``tree'' conjures up, in addition to the usual image, the image of a connected graph with no circuits. In the last few years various types of trees have been the subject of much…
The subnormal completion problem on a directed tree is to determine, given a collection of weights on a subtree, whether the weights may be completed to the weights of a subnormal weighted shift on the directed tree. We study this problem…
For a graph G, the generating function of rooted forests, counted by the number of connected components, can be expressed in terms of the eigenvalues of the graph Laplacian. We generalize this result from graphs to cell complexes of…
In this paper we initiate the study of the forward and backward shifts on the Hardy space of a tree and the little Hardy space of a tree. In particular, we investigate when these shifts are bounded, find the norm of the shifts if they are…
This dissertation summarizes my investigations in operator theory during my PhD studies. The first chapter is an introduction to that field of operator theory which was developed by B. Sz.-Nagy and C. Foias, the theory of power-bounded…
We introduce the notion of directed diagrammatic reducibility which is a relative version of diagrammatic reducibility. Directed diagrammatic reducibility has strong group theoretic and topological consequences. A multi-relator version of…
Given a simple graph $G$, a weight function $w:E(G)\rightarrow \mathbb{N} \setminus \{0\}$, and an orientation $D$ of $G$, we define $\mu^-(D) = \max_{v \in V(G)} w_D^-(v)$, where $w^-_D(v) = \sum_{u\in N_D^{-}(v)}w(uv)$. We say that $D$ is…
This paper provides an overview of the current landscape of signal processing (SP) on directed graphs (digraphs). Directionality is inherent to many real-world (information, transportation, biological) networks and it should play an…
A weighted random survival forest is presented in the paper. It can be regarded as a modification of the random forest improving its performance. The main idea underlying the proposed model is to replace the standard procedure of averaging…
We study a graph-theoretic approach to the $\mathcal{H}_{\infty}$ performance of leader following consensus dynamics on directed and undirected graphs. We first provide graph-theoretic bounds on the system $\mathcal{H}_{\infty}$ norm of the…
We analyze variational inference for highly symmetric graphical models such as those arising from first-order probabilistic models. We first show that for these graphical models, the tree-reweighted variational objective lends itself to a…
The notion of directed treewidth was introduced by Johnson, Robertson, Seymour and Thomas [Journal of Combinatorial Theory, Series B, Vol 82, 2001] as a first step towards an algorithmic metatheory for digraphs. They showed that some…