Related papers: Embedded trace operator for infinite metric trees
We study iterated weighted residual (WR) splittings generated by a positive operator $R_{0}\in B\left(H\right)_{+}$ and a finite family of contractions $C_{1},\dots,C_{m}$ in $B\left(H\right)$. The associated residual update $R\mapsto…
We investigate the interrelations between the metric properties, order properties and combinatorial properties of the set of balls in totally bounded ultrametric space. In particular, the Gurvich-Vyalyi representation of finite, ultrametric…
A family of orthonormal bases of ultrametric wavelets in the space of quadratically integrable with respect to arbitrary measure functions on general (up to some topological restrictions) ultrametric space is introduced. Pseudodifferential…
In this paper, we introduce the concepts of $\omega$-limit sets and pseudo orbits for a tree-shift defined on a Markov-Cayley tree, extending the results of tree-shifts defined on $d$-trees [5,6]. Firstly, we establish the relationships…
Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…
A full interpolation theory for Sobolev functions with smoothness between 0 and 1 and vanishing trace on a part of the boundary of an open set is established. Geometric assumptions are of mostly measure theoretic nature and reach beyond…
A (pseudo-)metric $D$ on a finite set $X$ is said to be a `tree metric' if there is a finite tree with leaf set $X$ and non-negative edge weights so that, for all $x,y \in X$, $D(x,y)$ is the path distance in the tree between $x$ and $y$.…
We consider weighted graphs with an infinite set of vertices. We show that boundedness of all functions of finite energy can be seen as a notion of `relative compactness' for such graphs and study sufficient and necessary conditions for…
Many recent works address the question of characterizing induced obstructions to bounded treewidth. In 2022, Lozin and Razgon completely answered this question for graph classes defined by finitely many forbidden induced subgraphs. Their…
This paper is a detailled study of the coding of real trees by real valued functions that is motivated by probabilistic problems related to continuum random trees. Indeed it is known since the works of Aldous (1993) and Le Gall (1991) that…
This is the last one of three successive articles by the authors on matrix-weighted Besov-type and Triebel--Lizorkin-type spaces $\dot B^{s,\tau}_{p,q}(W)$ and $\dot F^{s,\tau}_{p,q}(W)$. In this article, the authors establish the molecular…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
We generalize the notion of tight geodesics in the curve complex to tight trees. We then use tight trees to construct model geometries for certain surface bundles over graphs. This extends some aspects of the combinatorial model for doubly…
In the framework of the Laplacian transport, described by a Robin boundary value problem in an exterior domain in $\mathbb{R}^n$, we generalize the definition of the Poincar\'e-Steklov operator to $d$-set boundaries, $n-2< d<n$, and give…
We study (plane) tree-valued Markov chains $(T_n,n \geq 1)$ with uniform backward dynamics and show that they can be obtained by sampling from a real tree. As non--plane trees, every such Markov chain is represented by a weighted real tree.…
The metric space of phylogenetic trees defined by Billera, Holmes, and Vogtmann, which we refer to as BHV space, provides a natural geometric setting for describing collections of trees on the same set of taxa. However, it is sometimes…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
Building trees to represent or to fit distances is a critical component of phylogenetic analysis, metric embeddings, approximation algorithms, geometric graph neural nets, and the analysis of hierarchical data. Much of the previous…
We study {\em $\nabla$-Sobolev spaces} and {\em $\nabla$-differential operators} with coefficients in general Hermitian vector bundles on Riemannian manifolds, stressing a coordinate free approach that uses connections (which are typically…
The Schr\"odinger operator on a metric tree is a family of ordinary differential operators on its edges complemented by certain matching conditions at the vertices. The regular trees are highly symmetric. This allows one to construct an…