Related papers: Weighted shifts on directed forests and hyponormal…
We characterize when a weighted backward shift is chain recurrent on the $\ell^p$ ($1\leq p<\infty$) and $c_0$ spaces of a directed tree. The characterization is given in terms of two divergence conditions on the weights: a forward…
A key challenge in estimating causal effects from observational data is handling confounding and is commonly achieved through weighting methods that balance distribution of covariates between treatment and control groups. Weighting…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
Many natural, technological, and social systems incorporate multiway interactions, yet are characterized and measured on the basis of weighted pairwise interactions. In this article, I propose a family of models in which pairwise…
The shift-enabled property of an underlying graph is essential in designing distributed filters. This article discusses when a random graph is shift-enabled. In particular, popular graph models ER, WS, BA random graph are used, weighted and…
In this paper, we use the H2 norm associated with a communication graph to characterize the robustness of consensus to noise. In particular, we restrict our attention to trees and by systematic attention to the effect of local changes in…
The aim of this paper is twofold. We first provide a new orientation theorem which gives a natural and simple proof of a result of Gao, Yang \cite{GY} on matroid-reachability-based packing of mixed arborescences in mixed graphs by reducing…
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…
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…
For a weighted digraph without loops $V$, the arc weights of which can be obtained from an undirected graph with loops ${\sf P}$ according to the rule $v_{ij}=p_{ij}-p_{ii}$, the properties are studied. An effective algorithm for…
A treedepth decomposition of an undirected graph $G$ is a rooted forest $F$ on the vertex set of $G$ such that every edge $uv\in E(G)$ is in ancestor-descendant relationship in $F$. Given a weight function $w\colon V(G)\rightarrow…
When the backward shift operator on a weighted space $H^2_w=\{f=\sum_{j=0} ^{\infty} a_jz^j : \sum_{j=0}^{\infty} |a_j|^2w_j < \infty\}$ is an $n$-hypercontraction, we prove that the weights must satisfy the inequality $$\frac{w_{j+1}}{w_j}…
We establish an inequality which involves a non-negative function defined on the vertices of a finite $m$-ary regular rooted tree. The inequality may be thought of as relating an interaction energy defined on the free vertices of the tree…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…
This paper presents several algorithms for hashing directed graphs. The algorithms given are capable of hashing entire graphs as well as assigning hash values to specific nodes in a given graph. The notion of node symmetry is made precise…
Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…
In the first paper of the Graph Minors series [JCTB '83], Robertson and Seymour proved the Forest Minor theorem: the $H$-minor-free graphs have bounded pathwidth if and only if $H$ is a forest. In recent years, considerable effort has been…
The twin-width of a graph measures its distance to co-graphs and generalizes classical width concepts such as tree-width or rank-width. Since its introduction in 2020 (Bonnet et. al. 2020), a mass of new results has appeared relating twin…
This paper proposes a simple procedure to decide whether the empirically-observed adjacency or weights matrix, which characterizes the graph underlying a socio-economic network, is sufficiently symmetric (respectively, asymmetric) to…
We give an algorithm for finding the arboricity of a weighted, undirected graph, defined as the minimum number of spanning forests that cover all edges of the graph, in $\sqrt{n} m^{1+o(1)}$ time. This improves on the previous best bound of…