Transportation cost spaces on finite metric spaces
Duration: 49 mins 22 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Kutzarova, D
Monday 17th June 2019 - 11:10 to 12:00 |
|---|
| Created: | 2019-06-18 09:23 |
|---|---|
| Collection: | Approximation, sampling, and compression in high dimensional problems |
| Publisher: | Isaac Newton Institute |
| Copyright: | Kutzarova, D |
| Language: | eng (English) |
| Abstract: | Transportation cost spaces are studied by several groups of researchers, for different reasons and under different names. The term Lipschitz-free spaces is commonly used in Banach space theory. We prove that the transportation cost space on any finite metric space contains a large well-complemented subspace which is close to ℓn1. We show that transportation cost spaces on large classes of recursively defined sequences of graphs are not uniformly isomorphic to ℓn1 of the corresponding dimensions. These classes contain well-known families of diamond graphs and Laakso graphs. In the particular case of diamond graphs we prove that their cycle space is spanned by even levels of Haar functions. It is curious that the subspaces generated by all the even/odd levels of the Haar functions also appear in the study of quasi-greedy basic sequences in L1[0,1]. This research is joint with Stephen Dilworth and Mikhail Ostrovskii. |
|---|---|
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.94 Mbits/sec | 719.33 MB | View | Download | |
| WebM | 640x360 | 916.85 kbits/sec | 331.62 MB | View | Download | |
| iPod Video | 480x270 | 522.26 kbits/sec | 188.84 MB | View | Download | |
| MP3 | 44100 Hz | 249.81 kbits/sec | 90.42 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||