Related papers: Weighted shifts on directed forests and hyponormal…
We classify weighted forests up to the blowing-up and blowing-down operations which are relevant for the study of algebraic surfaces.
In this paper we describe a randomized algorithm which returns a maximal spanning forest of an unknown {\em weighted} undirected graph making $O(n)$ $\mathsf{CUT}$ queries in expectation. For weighted graphs, this is optimal due to a result…
In this paper we attempt to lay the foundations for a theory encompassing some natural extensions of the class of subnormal operators, namely the $n$--subnormal operators and the sub-$n$--normal operators. We discuss inclusion relations…
We study the class of hyponormal 2-variable weighted shifts with two consecutive equal weights in the weight sequence of one of the coordinate operators. We show that under natural assumptions on the coordinate operators, the presence of…
We recently introduced a formalism for the modeling of temporal networks, that we call stream graphs. It emphasizes the streaming nature of data and allows rigorous definitions of many important concepts generalizing classical graphs. This…
We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…
We systematically study various aspects of operator-valued multishifts. Beginning with basic properties, we show that the class of multishifts on the directed Cartesian product of rooted directed trees is contained in that of…
We completely characterize non-periodic balanced weighted shifts $S_{\lambdab}$ on rooted directed trees under a very mild assumption that $S_{\lambdab}^{*n}S_{\lambdab}^n|_{\ker S_{\lambdab}^*}$ is invertible operator on $\ker…
It is proved that each bounded injective bilateral weighted shift $W$ satisfying the equality $W^{*n}W^{n}=(W^{*}W)^{n}$ for some integer $n\geq 2$ is quasinormal. For any integer $n\geq 2$, an example of a bounded non-quasinormal weighted…
We introduce the notion of balance for directed graphs: a weighted directed graph is $\alpha$-balanced if for every cut $S \subseteq V$, the total weight of edges going from $S$ to $V\setminus S$ is within factor $\alpha$ of the total…
Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…
D. Wilson~\cite{[Wi]} in the 1990's described a simple and efficient algorithm based on loop-erased random walks to sample uniform spanning trees and more generally weighted trees or forests spanning a given graph. This algorithm provides a…
Gurski and Wanke showed that a graph class C has bounded tree-width if and only if its associated class of directed line graphs has bounded clique-width. Inevitably -- asking whether this relationship lifts to directed graphs -- we…
Transit functions were introduced as models of betweenness on undirected structures. Here we introduce directed transit function as the directed analogue on directed structures such as posets and directed graphs. We first show that…
In some applications of matching, the structural or hierarchical properties of the two graphs being aligned must be maintained. The hierarchical properties are induced by the direction of the edges in the two directed graphs. These…
Tree data are ubiquitous because they model a large variety of situations, e.g., the architecture of plants, the secondary structure of RNA, or the hierarchy of XML files. Nevertheless, the analysis of these non-Euclidean data is difficult…
We consider non-selfadjoint operator algebras $\mathfrak{L}(G,\lambda)$ generated by weighted creation operators on the Fock-Hilbert spaces of countable directed graphs $G$. These algebras may be viewed as noncommutative generalizations of…
The dynamics of the left translation semigroup $\{T_t\}_{t \geq 0}$ on weighted $L^p$ spaces over a directed metric tree $L(G)$ is investigated. Necessary and sufficient conditions on the weight family $\rho$ for the strong continuity of…
An algorithm on weighted graphs is called universally optimal if it is optimal for every input graph, in the worst case taken over all weight assignments. Informally, this means the algorithm is competitive even with algorithms that are…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…