Analysis on Laakso graphs with application to the structure of transportation cost spaces
Stephen J. Dilworth, Denka Kutzarova, and Mikhail I. Ostrovskii

TL;DR
This paper extends analysis of Laakso graphs by constructing orthogonal bases for cycle and cut spaces, estimating projection constants, and exploring the structure of associated transportation cost spaces, revealing their geometric properties.
Contribution
It introduces new orthogonal bases for Laakso graph cycle and cut spaces, and provides sharp estimates for projection constants and Banach-Mazur distances related to transportation cost spaces.
Findings
Projection constant estimates for Lipschitz spaces on Laakso graphs
Banach-Mazur distance lower bounds for transportation cost spaces
Examples of finite metric spaces containing and isometrically
Abstract
This article is a continuation of our article in [Canad. J. Math. Vol. 72 (3), (2020), pp. 774--804]. We construct orthogonal bases of the cycle and cut spaces of the Laakso graph . They are used to analyze projections from the edge space onto the cycle space and to obtain reasonably sharp estimates of the projection constant of , the space of Lipschitz functions on . We deduce that the Banach-Mazur distance from TC, the transportation cost space of , to of the same dimension is at least , which is the analogue of a result from [op. cit.] for the diamond graph . We calculate the exact projection constants of , where is the diamond graph of branching . We also provide simple examples of finite metric spaces,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
