相关论文: Weighted Join Operators on Directed Trees

A network's assortativity is the tendency of vertices to bond with others based on similarities, usually excess vertex degree. In this paper we consider assortativity in weighted networks, both directed and undirected. To this end, we…

For a given directed tree and weights associated with vertices from a subtree the completion problem is to determine if these weights may be completed in a way to obtain a bounded weighted shift on the whole tree, which possibly satisfies…

We present a version of the weighted cellular matrix-tree theorem that is suitable for calculating explicit generating functions for spanning trees of highly structured families of simplicial and cell complexes. We apply the result to give…

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…

Let $T$ be a tree rooted at $r$. Two vertices of $T$ are related if one is a descendant of the other; otherwise, they are unrelated. Two subsets $A$ and $B$ of $V(T)$ are unrelated if, for any $a\in A$ and $b\in B$, $a$ and $b$ are…

We study a conductance-weighted arboricity for a finite simple undirected graph $G=(V,E,c)$ with a conductance assignment $c:E\to[0,\infty)$: \[ A_c(G):=\max\bigl\{ D_c(H): H\subseteq G\text{ connected}, |V(H)|\ge 2 \bigr\},\qquad…

We study the evolution of a positive operator under weighted residual maps determined by a finite family of orthogonal projections. Iterating these maps along the rooted tree of multi-indices produces a "weighted residual energy tree",…

We associate root polytopes to directed graphs and study them by using ribbon structures. Most attention is paid to what we call the semi-balanced case, i.e., when each cycle has the same number of edges pointing in the two directions.…

A rooted arborescence of a directed graph is a spanning tree directed towards a particular vertex. A recent work of Chepuri et al. showed that the arborescences of a covering graph of a directed graph G are closely related to the…

We study the weighted composition operators between the Lipschitz space and the space of bounded functions on the set of vertices of an infinite tree. We characterized the boundedness, the compactness, and the boundedness from below of…

Quasi-trees generalize trees in that the unique "path" between two nodes may be infinite and have any countable order type. They are used to define the rank-width of a countable graph in such a way that it is equal to the least upper-bound…

In this paper, we study the weighted composition operator on the Fock space $\mf$ of slice regular functions. First, we characterize the boundedness and compactness of the weighted composition operator. Subsequently, we describe all the…

Using {\it weighted traces} which are linear functionals of the type $$A\to tr^Q(A):=(tr(A Q^{-z})-z^{-1} tr(A Q^{-z}))_{z=0}$$ defined on the whole algebra of (classical) pseudo-differential operators (P.D.O.s) and where $Q$ is some…

Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…

Let $\omega$ be a weight on a right cancellative semigroup $S$. Let $\|\cdot\|_{\omega}$ be the weighted norm on the weighted discrete semigroup algebra $\ell^1(S, \omega)$. In this paper, we prove that the weight $\omega$ satisfies…

For a digraph $D=(V(D), A(D))$, and a set $S\subseteq V(D)$ with $r\in S$ and $|S|\geq 2$, an $(S, r)$-tree is an out-tree $T$ rooted at $r$ with $S\subseteq V(T)$. Two $(S, r)$-trees $T_1$ and $T_2$ are said to be arc-disjoint if…

For $p\in[1,\infty]$, the $\ell^p$ directed spanning forest (DSF) of dimension $d\geq 2$ is an oriented random geometric graph whose vertex set is given by a homogeneous Poisson point process $\mathcal N$ on $\mathbb R^d$ and whose edges…

In the context of a weighted graph with vertex set $V$ and bounded vertex degree, we give a sufficient condition for the essential self-adjointness of the operator $\Delta_{\sigma}+W$, where $\Delta_{\sigma}$ is the magnetic Laplacian and…

Let $G$ be a simple strongly connected weighted directed graph. Let $\mathcal{G}$ denote the spanning tree graph of $G$. That is, the vertices of $\mathcal{G}$ consist of the directed rooted spanning trees on $G$, and the edges of…

Phylogenetic networks are used to represent the evolutionary history of species. They are versatile when compared to traditional phylogenetic trees, as they capture more complex evolutionary events such as hybridization and horizontal gene…