相关论文: Weighted Join Operators on Directed Trees

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

The operation of transforming one spanning tree into another by replacing an edge has been considered widely, both for general and planar straight-line graphs. For the latter, several variants have been studied (e.g., edge slides and edge…

A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…

The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…

We consider how a vertex operator algebra can be extended to an abelian intertwining algebra by a family of weak twisted modules which are {\em simple currents} associated with semisimple weight one primary vectors. In the case that the…

Treewidth and Hadwiger number are two of the most important parameters in structural graph theory. This paper studies graph classes in which large treewidth implies the existence of a large complete graph minor. To formalise this, we say…

The correspondence between weighted undirected graphs and reversible Markov chains via vertex random walks is simple and well known. Leveraging this correspondence and ideas from the theory of dynamical systems, we study the structural…

We study weighted composition operators on Hilbert spaces of analytic functions on the unit ball with kernels of the form $(1-<z,w>)^{-\gamma}$ for $\gamma>0$. We find necessary and sufficient conditions for the adjoint of a weighted…

Given a graph $G=(V,E)$ with a weight $w_v$ associated with each vertex $v\in V$, the maximum weighted induced forest problem (MWIF) consists of encountering a maximum weighted subset $V'\subseteq V$ of the vertices such that $V'$ induces a…

In this article, we develop tools for computing $G$-crossed extensions of braided tensor categories. Their equivariantisations appear as categories of modules of fixed-point subalgebras (or orbifolds) of vertex operator algebras and are…

We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that…

Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…

We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…

Treewidth is a measure of how tree-like a graph is. It has many important algorithmic applications because many NP-hard problems on general graphs become tractable when restricted to graphs of bounded treewidth. Algorithms for problems on…

We study the statistics of growing networks in which each link carries a weight (k_i k_j)^theta, where k_i and k_j are the node degrees at the endpoints of link ij. Network growth is governed by preferential attachment in which a…

Given an undirected graph $G = (V, E)$ and a weight function $w:E \to \mathbb{R}$, the \textsc{Minimum Dominating Tree} problem asks to find a minimum weight sub-tree of $G$, $T = (U, F)$, such that every $v \in V \setminus U$ is adjacent…

In this paper, we systematically study weighted jump and variational inequalities for rough operators. More precisely, we show some weighted jump and variational inequalities for the families $\mathcal T:=\{T_\varepsilon\}_{\varepsilon>0}$…

In this paper, we study vector--valued elliptic operators of the form $\mathcal{L}f:=\mathrm{div}(Q\nabla f)-F\cdot\nabla f+\mathrm{div}(Cf)-Vf$ acting on vector-valued functions $f:\mathbb{R}^d\to\mathbb{R}^m$ and involving coupling at…

Dense networks with weighted connections often exhibit a community like structure, where although most nodes are connected to each other, different patterns of edge weights may emerge depending on each node's community membership. We…

We study the dynamical behaviour of weighted shifts defined on sequence spaces of a directed tree. In particular, we characterize their boundedness as well as when they are hypercyclic, weakly mixing and mixing.