English
Related papers

Related papers: On the $(\beta)$-distortion of some infinite graph…

200 papers

A distortion lower bound of $\Omega(\log(h)^{1/p})$ is proven for embedding the complete countably branching hyperbolic tree of height $h$ into a Banach space admitting an equivalent norm satisfying property $(\beta)$ of Rolewicz with…

Metric Geometry · Mathematics 2017-09-27 Florent P. Baudier , Sheng Zhang

In this paper we present new proofs of the non-embeddability of countably branching trees into Banach spaces satisfying property $(\beta_p)$ and of countably branching diamonds into Banach spaces which are $p$-AMUC for $p > 1$. These proofs…

Metric Geometry · Mathematics 2024-09-27 Ryan Malthaner

Diamond graphs and binary trees are important examples in the theory of metric embeddings and also in the theory of metric characterizations of Banach spaces. Some results for these families of graphs are parallel to each other, for example…

Metric Geometry · Mathematics 2018-11-13 Siu Lam Leung , Sarah Nelson , Sofiya Ostrovska , Mikhail Ostrovskii

We show that if the Szlenk index of a Banach space $X$ is larger than the first infinite ordinal $\omega$ or if the Szlenk index of its dual is larger than $\omega$, then the tree of all finite sequences of integers equipped with the…

Functional Analysis · Mathematics 2017-09-27 F. Baudier , N. J. Kalton , G. Lancien

For every $p\in(0,\infty)$, a new metric invariant called umbel $p$-convexity is introduced. The asymptotic notion of umbel convexity captures the geometry of countably branching trees, much in the same way as Markov convexity, the local…

Metric Geometry · Mathematics 2025-02-11 Florent P. Baudier , Chris Gartland

It was shown recently by Fakcharoenphol et al that arbitrary finite metrics can be embedded into distributions over tree metrics with distortion O(log n). It is also known that this bound is tight since there are expander graphs which…

Data Structures and Algorithms · Computer Science 2008-07-30 Douglas E. Carroll , Ashish Goel

We prove an exponential separation in sample complexity between Euclidean and hyperbolic representations for learning on hierarchical data under standard Lipschitz regularization. For depth-$R$ hierarchies with branching factor $m$, we…

Machine Learning · Statistics 2026-01-29 Divit Rawal , Sriram Vishwanath

We characterize non-reflexive Banach spaces by a low-distortion (resp. isometric) embeddability of a certain metric graph up to a renorming. Also we study non-linear sufficient conditions for $\ell_1^n$ being $(1+\varepsilon)$-isomorphic to…

Functional Analysis · Mathematics 2016-07-29 Antonin Prochazka

This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a graph which strongly preserves distances in the graph is a…

Discrete Mathematics · Computer Science 2016-08-31 Ittai Abraham , Yair Bartal , Ofer Neiman

We give a lower bound for the $\ell^p$-distortion $c_p(X)$ of finite graphs $X$, depending on the first eigenvalue $\lambda_1^{(p)}(X)$ of the $p$-Laplacian and the maximal displacement of permutations of vertices. For a $k$-regular…

Metric Geometry · Mathematics 2017-05-17 Pierre-Nicolas Jolissaint , Alain Valette

Given an $n$-point metric space $(X,d_X)$, a tree cover $\mathcal{T}$ is a set of $|\mathcal{T}|=k$ trees on $X$ such that every pair of vertices in $X$ has a low-distortion path in one of the trees in $\mathcal{T}$. Tree covers have been…

Data Structures and Algorithms · Computer Science 2025-11-19 Yu Chen , Zihan Tan , Hangyu Xu

We strengthen the connections between electrical transformations and homotopy from the planar setting---observed and studied since Steinitz---to arbitrary surfaces with punctures. As a result, we improve our earlier lower bound on the…

Computational Geometry · Computer Science 2019-03-27 Hsien-Chih Chang , Marcos Cossarini , Jeff Erickson

In this paper, we deal with a notion of Banach space-valued mappings defined on a set consisting of finite graphs with uniformly bounded vertex degree. These functions will be endowed with certain boundedness and additivity criteria. We…

Combinatorics · Mathematics 2015-01-14 Felix Pogorzelski

Let $X$ be Banach space which is not super-reflexive. Then, for each $n\ge1$ and $\varepsilon>0$, we exhibit metric embeddings of the Laakso graph $\mathcal{L}_n$ into $X$ with distortion less than $2+\varepsilon$ and into $L_1[0,1]$ with…

Functional Analysis · Mathematics 2022-03-17 S. J. Dilworth , Denka Kutzarova , Svetozar Stankov

If $X$ is a subset of a Banach space with $X-X$ homogeneous, then $X$ can be embedded into some $\R^n$ (with $n$ sufficiently large) using a linear map $L$ whose inverse is Lipschitz to within logarithmic corrections. More precisely,…

Metric Geometry · Mathematics 2010-07-28 James C Robinson

One of the fundamental results in graph minor theory is that for every planar graph $H$, there is a minimum integer $f(H)$ such that graphs with no minor isomorphic to $H$ have treewidth at most $f(H)$. A lower bound for ${f(H)}$ can be…

Combinatorics · Mathematics 2026-01-16 J. Pascal Gollin , Kevin Hendrey , Sang-il Oum , Bruce Reed

We characterize the asymptotic behaviour of the compression associated to a uniform embedding into some Lp-space for a large class of groups including connected Lie groups with exponential growth and word-hyperbolic finitely generated…

Group Theory · Mathematics 2007-08-27 Romain Tessera

We introduce two ordinal indices that are linear invariants for Banach spaces: the dyadic tree index and the sprawling tree index. We show that they are also bi-Lipschitz invariants. In fact, we characterize their values in terms of…

Functional Analysis · Mathematics 2026-05-28 Estelle Basset , Gilles Lancien , Antonin Procházka

In these notes we study a family of Banach spaces, denoted $\, D^{0,\,\al}(\Ov)\,,$ $\,\al \in\,\R^+\,,$ and called H-log spaces. For $\,0<\,\la\leq\,1\,,$ one has $ C^{0,\,\la}(\Ov)\subset D^{0,\,\al}(\Ov) \subset\,C(\Ov)\,,$ with compact…

Analysis of PDEs · Mathematics 2015-03-16 Hugo Beirao da Veiga

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

Combinatorics · Mathematics 2015-12-14 Eran Nevo , Guillermo Pineda-Villavicencio , David R. Wood
‹ Prev 1 2 3 10 Next ›