English
Related papers

Related papers: Ultrametric properties for valuation spaces of nor…

200 papers

We present a streamlined exposition of a construction by R. Chen, A. Poulin, R. Tao, and A. Tserunyan, which proves the treeability of equivalence relations generated by any locally-finite Borel graph such that each component is a…

Logic · Mathematics 2025-04-25 Zhaoshen Zhai

We prove the "End Curve Theorem," which states that a normal surface singularity $(X,o)$ with rational homology sphere link $\Sigma$ is a splice-quotient singularity if and only if it has an end curve function for each leaf of a good…

Algebraic Geometry · Mathematics 2011-07-29 Walter D Neumann , Jonathan Wahl

In this note various geometric properties of a Banach space $X$ are characterized by means of weaker corresponding geometric properties involving an ultrapower $X^\mathcal{U}$. The characterizations do not depend on the particular choice of…

Functional Analysis · Mathematics 2015-07-09 Jarno Talponen

We define the concept of an ultrametric M\"obius space and use this to characterize nonelementary geodesically complete trees.

Metric Geometry · Mathematics 2015-08-14 Jonas Beyrer , Viktor Schroeder

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

Metric Geometry · Mathematics 2023-08-28 Alice Kerr

It is shown that a locally finite ultrametric space $(X, d)$ is generated by labeled tree if and only if, for every open ball $B \subseteq X$, there is a point $c \in B$ such that $d(x, c) = \operatorname{diam} B$ whenever $x \in B$ and $x…

General Topology · Mathematics 2023-08-15 Oleksiy Dovgoshey , Alexander Kostikov

We consider groups $\mathbb{I}$ of isometries of ultrametric Urysohn spaces $\mathbb{U}$. Such spaces $\mathbb{U}$ admit transparent realizations as boundaries of certain $R$-trees and the groups $\mathbb{I}$ are groups of automorphisms of…

Representation Theory · Mathematics 2022-12-07 Yury A. Neretin

Ultrametric matrices have a rich structure that is not apparent from their definition. Notably, the subclass of strictly ultrametric matrices are covariance matrices of certain weighted rooted binary trees. In applications, these matrices…

Numerical Analysis · Mathematics 2022-08-23 Evan D. Gorman , Manuel E. Lladser

We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…

Metric Geometry · Mathematics 2020-02-18 Oleksiy Dovgoshey

We describe the class of graphs for which all metric spaces with diametrical graphs belonging to this class are ultrametric. It is shown that a metric space $(X, d)$ is ultrametric iff the diametrical graph of the metric $d_{\varepsilon}(x,…

Metric Geometry · Mathematics 2021-03-18 Viktoriia Bilet , Oleksiy Dovgoshey , Yuriy Kononov

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…

General Topology · Mathematics 2025-02-07 Oleksiy Dovgoshey

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$.

Metric Geometry · Mathematics 2013-02-26 E. Petrov

Ultrametric matrices are a class of covariance matrices that arise in latent tree models. As a parameter space in a statistical model, the set of ultrametric matrices is neither convex nor a smooth manifold. Focus in the literature has…

Methodology · Statistics 2025-04-28 Tsung-Hung Yao , Zhenke Wu , Karthik Bharath , Veerabhadran Baladandayuthapani

Motivated by the local theory of Banach spaces we introduce a notion of finite representability for metric spaces. This allows us to develop a new technique for comparing the generalized roundness of metric spaces. We illustrate this…

Functional Analysis · Mathematics 2016-08-15 Lukiel Levy-Moore , Margaret Nichols , Anthony Weston

The goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by…

Probability · Mathematics 2019-04-09 Patrick Gloede , Andreas Greven , Thomas Rippl

We consider unimodular random rooted trees (URTs) and invariant forests in Cayley graphs. We show that URTs of bounded degree are the same as the law of the component of the root in an invariant percolation on a regular tree. We use this to…

Probability · Mathematics 2019-02-20 Itai Benjamini , Russell Lyons , Oded Schramm

We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…

Combinatorics · Mathematics 2014-08-12 Anthony Bonato , Jeannette Janssen

For arbitrary star graph $S$ with a non-degenerate vertex labeling $l\colon V(S) \to \mathbb{R}^+$ we denote by $d_l$ the corresponding ultrametric on the vertex set $V(S)$ of $S$. We characterize the class $\bf US$ of all ultrametric…

General Topology · Mathematics 2025-02-04 Oleksiy Dovgoshey , Olga Rovenska

A metric space $X$ is rigid if the isometry group of $X$ is trivial. The finite ultrametric spaces $X$ with $|X| \geq 2$ are not rigid since for every such $X$ there is a self-isometry having exactly $|X|-2$ fixed points. Using the…

Metric Geometry · Mathematics 2015-11-26 O. Dovgoshey , E. Petrov , H. -M. Teichert

Let T=(V,E) be a tree graph with non-negative weights defined on the vertices. A vertex z is called a separating vertex for u and v if the distances of z to u and v are not equal. A set of vertices L\subseteq V is a feasible solution for…

Data Structures and Algorithms · Computer Science 2015-01-22 Ron Adar , Leah Epstein