相关论文: Uniformly continuous maps between ends of R-trees
We give a fairly complete characterization of the exact components of a large class of uniformly expanding Markov maps of $\mathbb{R}$. Using this result, for a class of $\mathbb{Z}$-invariant maps and finite modifications thereof, we prove…
Merge trees are fundamental structures in topological data analysis. Interleaving distance is a widely accepted metric for comparing merge trees, with applications in visualization and scientific computing. While a greedy algorithm exists…
It is shown that the rooted trees $T_X$ and $T_Y$ representing finite ultrametric spaces $X$ and $Y$ are isomorphic if and only if there exists a ball-preserving bijection $F:X\to Y$.
Uniform spanning trees are a statistical model obtained by taking the set of all spanning trees on a given graph (such as a portion of a cubic lattice in d dimensions), with equal probability for each distinct tree. Some properties of such…
We study the leaf-to-leaf distances on full and complete m-ary graphs using a recursive approach. In our formulation, leaves are ordered along a line. We find explicit analytical formulae for the sum of all paths for arbitrary leaf-to-leaf…
We introduce a new construction of the Uniform Infinite Planar Quadrangulation (UIPQ). Our approach is based on an extension of the Cori-Vauquelin-Schaeffer mapping in the context of infinite trees, in the spirit of previous work. However,…
Weak similarities form a special class of mappings between semimetric spaces. Two semimetric spaces $X$ and $Y$ are weakly similar if there exists a weak similarity $\Phi\colon X\to Y$. We find a structural characteristic of finite…
We define a notion of (one-sided) edge shift spaces associated to ultragraphs. In the finite case our notion coincides with the edge shift space of a graph. In general, we show that our space is metrizable and has a countable basis of…
Extension dimension is characterized in terms of $\omega$-maps. We apply this result to prove that extension dimension is preserved by refinable maps between metrizable spaces. It is also shown that refinable maps preserve some…
In this paper we provide several \emph{metric universality} results. We exhibit for certain classes $\cC$ of metric spaces, families of metric spaces $(M_i, d_i)_{i\in I}$ which have the property that a metric space $(X,d_X)$ in $\cC$ is…
We view ultrametric spaces as two-sorted structures consisting of a set of points and of a linearly ordered set of distances. We call the appropriate notion of embeddings distance-carrying (dc for short). Those are obtained by combining…
This paper outlines a method to determine whether two label-regular directed trees, are isomorphic and when they are almost isomorphic. The approach involves reinterpreting label-regular directed trees as universal covers of rooted graphs.…
Extending a result of K. Milliken \cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence $(U_i)_{i\in d}$ of fixed trees $U_i$,…
We prove several criteria for quasi-isometry between non-locally-finite graphs and their structure trees. Results of M\"oller in \cite{moeller92ends2} for locally finite and transitive graphs are generalized. We also give a criterion which…
Two graphs are of the same topological type if they can be mutually embedded into each other topologically. We show that there are exactly $\aleph_1$ distinct topological types of countable trees. In general, for any infinite cardinal…
In this series we introduce and investigate the concept of connectoids, which captures the connectivity structure of various discrete objects like undirected graphs, directed graphs, bidirected graphs, hypergraphs or finitary matroids. In…
Rooted, weighted continuum random trees are used to describe limits of sequences of random discrete trees. Formally, they are random quadruples $(\mathcal{T},d,r,p)$, where $(\mathcal{T},d)$ is a tree-like metric space, $r\in\mathcal{T}$ is…
We already saw in [A1] that the space of dynamically marked rational maps can be identified to a subspace of the space of covers between trees of spheres on which there is a notion of convergence that makes it sequentially compact. In the…
We develop an analog to the ends of a metric space for the category of coarse metric spaces and show that it is equivalent to a previously defined coarse invariant.
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…