Related papers: Weighted shifts on directed trees
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
Disordered materials are often out of equilibrium and evolve very slowly. This allows a memory of the imposed strains or preparation conditions to be encoded in the material. Here we consider "directed aging", where the elastic properties…
Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen at random with probability proportional to its weight. In the case where the total…
Finite metric trees are known to have strict 1-negative type. In this paper we introduce a new family of inequalities that quantify the extent of the "strictness" of the 1-negative type inequalities for finite metric trees. These…
Let $\mathcal{T}_{+}(E)$ be the tensor algebra of a $W^{*}$-correspondence $E$ over a $W^{*}$-algebra $M$. In earlier work, we showed that the completely contractive representations of $\mathcal{T}_{+}(E)$, whose restrictions to $M$ are…
We consider random binary trees that appear as the output of certain standard algorithms for sorting and searching if the input is random. We introduce the subtree size metric on search trees and show that the resulting metric spaces…
Tree-based networks are a class of phylogenetic networks that attempt to formally capture what is meant by "tree-like" evolution. A given non-tree-based phylogenetic network, however, might appear to be very close to being tree-based, or…
We present a general model for the growth of weighted networks in which the structural growth is coupled with the edges' weight dynamical evolution. The model is based on a simple weight-driven dynamics and a weights' reinforcement…
In this paper we provide some exact formulas for projective dimension and the regularity of powers of edge ideals of vertex-weighted rooted forests. These formulas are functions of the weight of the vertices and the number of edges. We also…
Many networks describing complex systems are directed: the interactions between elements are not symmetric. Recent work has shown that these networks can display properties such as trophic coherence or non-normality, which in turn affect…
We study the situations when the solution to a weighted stochastic recursion has a power law tail. To this end, we develop two complementary approaches, the first one extends Goldie's (1991) implicit renewal theorem to cover recursions on…
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…
Considering a family of upper frequently hypercyclic operators we care about the existence of vectors which are upper frequently hypercyclic for any operator of this family. We establish sufficient conditions for a family of operators to…
We extend the relative index theorem on non-compact manifolds to encompass a wide variety of hypoelliptic differential operators of arbitrary order, demonstrating that the change in index when changing a differential operator locally can be…
An algorithm is proposed for constructing directed spanning forests of the minimum weight, in which the maximum possible degree of affinity between the minimum forests is preserved when the number of trees changes. The correctness of the…
Enhancing a recent result of Bayart and Ruzsa we obtain a Birkhoff-type characterization of upper frequently hypercyclic operators and a corresponding Upper Frequent Hypercyclicity Criterion. As an application we characterize upper…
We study a problem of damping a control system described by functional-differential equations of natural order $n$ and neutral type with non-smooth complex coefficients on an arbitrary tree with global delay. The latter means that the delay…
Weight systems are functions on chord diagrams satisfying Vassiliev's $4$-term relations. They originate in the theory of finite type knot invariants. Recent developments in understanding weight systems arising from Lie algebras are based…
In this paper we consider the problem of connected edge searching of weighted trees. It is shown that there exists a polynomial-time algorithm for finding optimal connected search strategy for bounded degree trees with arbitrary weights on…
In this paper, we study certain inequalities and a related result for weighted Sobolev spaces on H\"older-$\alpha$ domains, where the weights are powers of the distance to the boundary. We obtain results regarding the divergence equation's…