相关论文: Weighted Join Operators on Directed Trees

Systems which consist of many localized constituents interacting with each other can be represented by complex networks. Consistently, network science has become highly popular in vast fields focusing on natural, artificial and social…

A \emph{metric tree embedding} of expected \emph{stretch~$\alpha \geq 1$} maps a weighted $n$-node graph $G = (V, E, \omega)$ to a weighted tree $T = (V_T, E_T, \omega_T)$ with $V \subseteq V_T$ such that, for all $v,w \in V$,…

This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of couplings of their corresponding generic branching vectors.…

Weighted recursive trees are built by adding successively vertices with predetermined weights to a tree: each new vertex is attached to a parent chosen randomly proportionally to its weight. Under some assumptions on the sequence of…

We begin a systematic study of finite semigroups that generate join irreducible members of the lattice of pseudovarieties of finite semigroups, which are important for the spectral theory of this lattice. Finite semigroups $S$ that generate…

Let $T_1$, $T_2$ be two Calder\'on-Zygmund operators and $T_{1,\,b}$ be the commutator of $T_1$ with symbol $b\in {\rm BMO}(\mathbb{R}^n)$. In this paper, the author prove that, the composite operator $T_1T_2$ satisfies the following…

Let $\ell^{p}$, $1\leq p<\infty$, be the Banach space of absolutely $p$-th power summable sequences and let $\pi_{n}$ be the natural projection to the $n$-th coordinate for $n\in\mathbb{N}$. Let $\mathfrak{W}=\{w_{n}\}_{n=1}^{\infty}$ be a…

We introduce a generalized family of $\left( 2\cdot \left\lfloor \frac{k}{2} \right\rfloor-1, 2\cdot \left\lceil \frac{k}{2} \right\rceil \cdot W_{1} +\max\left\{0,2\cdot\left(\left\lceil\frac{k}{2}\right\rceil-2\right)\right\}\cdot W_{2}…

Let $G$ be a simple complex Lie group with Lie algebra $\mf g$ and let $\af$ be the affine Lie algebra. We use intertwining operators and Knizhnik-Zamolodchikov equations to construct a family of $\N$-graded vertex operator algebras…

In general the problem of finding a miminum spanning tree for a weighted directed graph is difficult but solvable. There are a lot of differences between problems for directed and undirected graphs, therefore the algorithms for undirected…

We work in the setting of infinite, not necessarily locally finite, weighted graphs. We give a sufficient condition for the essential self-adjointness of (discrete) Schr\"odinger operators $\mathcal{L}_{V}$ that are not necessarily lower…

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…

We consider directed weighted graphs and define various families of path counting functions. Our main results are explicit formulas for the main term of the asymptotic growth rate of these counting functions, under some irrationality…

This is a straightforward generalization Section 2 of arXiv:1805.11167. It shows that for a residual set of transformations in the space of measure preserving transformations, with the weak topology, any self-joining defines a Markov…

In this paper we study the Spanning Tree Congestion problem, where we are given a graph $G=(V,E)$ and are asked to find a spanning tree $T$ of minimum maximum congestion. Here, the congestion of an edge $e\in T$ is the number of edges…

We construct a class of extended operators in the cohomology of a pair of twisted Schur supercharges of 4d N=2 SCFTs. The extended operators are constructed from the local operators in this cohomology -- the Schur operators -- by a version…

Given a weight-one element $u$ of a vertex operator algebra $V$, we construct an automorphism of the category of generalized $g$-twisted modules for automorphisms $g$ of $V$ fixing $u$. We apply this construction to the case that $V$ is an…

Weighted Finite State Transducers (WFSTs) are versatile data structures that can model a great number of problems, ranging from Automatic Speech Recognition to DNA sequencing. Traditional computer science algorithms are employed when…

We consider Directed Steiner Forest (DSF), a fundamental problem in network design. The input to DSF is a directed edge-weighted graph $G = (V, E)$ and a collection of vertex pairs $\{(s_i, t_i)\}_{i \in [k]}$. The goal is to find a minimum…

We introduce weighted regular tree grammars with storage as combination of (a) regular tree grammars with storage and (b) weighted tree automata over multioperator monoids. Each weighted regular tree grammar with storage generates a…