相关论文: Weighted Join Operators on Directed Trees

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

In this review we present some recent extensions of the method of the weakly conjugate operator. We illustrate these developments through examples of operators on graphs and groups.

We consider a weighted counting problem on matchings, denoted $\textrm{PrMatching}(\mathcal{G})$, on an arbitrary fixed graph family $\mathcal{G}$. The input consists of a graph $G\in \mathcal{G}$ and of rational probabilities of existence…

In this paper, we study a new discrete tree and the resulting branching process, which we call the \textbf{E}rlang \textbf{W}eighted \textbf{T}ree(\textbf{EWT}). The EWT appears as the local weak limit of a random graph model proposed…

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…

We study the multiplication operators on the weighted Lipschitz space $\mathcal{L}_{\textbf{w}}$ consisting of the complex-valued functions $f$ on the set of vertices of an infinite tree $T$ rooted at $o$ such that $\sup_{v\neq…

We consider the k-outconnected directed Steiner tree problem (k-DST). Given a directed edge-weighted graph $G=(V,E,w)$, where $V=\{r\}\cup S \cup T$, and an integer $k$, the goal is to find a minimum cost subgraph of $G$ in which there are…

We construct an operad $\mathrm{Phyl}$ whose operations are the edge-labelled trees used in phylogenetics. This operad is the coproduct of $\mathrm{Com}$, the operad for commutative semigroups, and $[0,\infty)$, the operad with unary…

We consider a topologically twisted maximally supersymmetric Yang-Mills theory on a four-manifold of the form $V = W \times {\mathbb R}_+$. 't Hooft disorder operators localized in the boundary component at finite distance of $V$ are…

Let $(G,w)$ be an undirected weighted graph. The group inverse of $(G,w)$ is the weighted graph with the adjacency matrix $A^{\#}$, where $A$ is the adjacency matrix of $(G,w)$. We study the group inverse of singular weighted trees. It is…

In this study, we take a systematic look at the unrealised part of public transport networks (PTNs) with functional connections. We consider their complement graphs and study their structure. The complement graph $\bar G$ of an unweighted…

We compute the complexity of two infinite families of finite graphs: the Sierpi\'{n}ski graphs, which are finite approximations of the well-known Sierpi\'nsky gasket, and the Schreier graphs of the Hanoi Towers group $H^{(3)}$ acting on the…

We systematically develop the multivariable counterpart of the theory of weighted shifts on rooted directed trees. Capitalizing on the theory of product of directed graphs, we introduce and study the notion of multishifts on directed…

In order to assess the relevance of higher order terms in the Standard Model Effective Field Theory (SMEFT) expansion we consider four new physics models and their impact on the Drell Yan cross section. Of these four, one scalar model has…

We study the connective constants of weighted self-avoiding walks (SAWs) on infinite graphs and groups. The main focus is upon weighted SAWs on finitely generated, virtually indicable groups. Such groups possess so-called 'height…

The aim of our work is to study vertex-reinforced jump processes with super-linear weight function $w(t) = t^\alpha$ , for some $\alpha>1$. On any complete graph $G = (V, E)$, we prove that there is one vertex $v \in V$ such that the total…

We consider four-point functions of operators in the stress tensor multiplet of the 3d $\mathcal{N}=6$ $U(N)_k\times U(N+M)_{-k}$ or $SO(2)_{2k}\times USp(2+2M)_{-k}$ ABJ theories in the limit where $M$ and $k$ are taken to infinity while…

Let $\M$ be a von Neumann algebra with a faithful normal trace $\T$, and let $H^\infty$ be a finite, maximal, subdiagonal algebra of $\M$. Fundamental theorems on conjugate functions for weak$^*$\!-Dirichlet algebras are shown to be valid…

We consider node-weighted survivable network design (SNDP) in planar graphs and minor-closed families of graphs. The input consists of a node-weighted undirected graph $G=(V,E)$ and integer connectivity requirements $r(uv)$ for each…

This monograph is a comprehensive study of the combinatorial structure of various operads of wiring diagrams and undirected wiring diagrams. Our first main objective is to prove a finite presentation theorem for each operad of wiring…