Doubling metric spaces and embeddings. Assaf Naor
|
|
- Loren Blankenship
- 5 years ago
- Views:
Transcription
1 Doubling metric spaces and embeddings Assaf Naor
2 Our approach to general metric spaces bears the undeniable imprint of early exposure to Euclidean geometry. We just love spaces sharing a common feature with R n. (M. Gromov, 2001).
3 Metric spaces A set X equipped with a mapping that assigns a nonnegative number every two elements (points) x; y 2 X d(x; y) = 0 () x = y d(x; y) = d(y; x) d(x; y) 6 d(x; z) + d(z; y) x d : X X! [0; 1) to such that d(x; y) > 0 d(x; y) d(x; z) y d(z; y) z
4 A rich and unstructured (?) world Shortest-path metrics on graphs
5
6
7 Heisenberg group The integer grid in 3-space f(x; y; z) : x; y; z are integersg edges: (x; y; z)» (x 1; y; z) (x; y; z)» (x; y 1; z x)
8
9 Edit distance X consists of all the strings of letters from an alphabet S (e.g. S={A,C,G,T}). The distance between two strings a,b is defined to be the minimum number of insertions or deletions of letters from S required to transform a to b.
10 Transportation cost/earthmover X consists of all the k-point subsets of the n by n grid in the plane. A =
11 A =
12 B =
13
14
15 If A = fa 1 ; : : : ; a k g and B = fb 1 ; : : : ; b k g then their distance is defined to be the minimum over all permutations ¼ of f1; : : : ; kgof the total matched distance: d(a; B) def = min ¼ nx j=1 a j b ¼(j)
16
17
18 Nice metric spaces R n The n-dimensional Euclidean space. p > 1 For the space `p, consisting of all infinite sequences of numbers x = (x 1 ; x 2 ; x 3 ; : : :), equipped with the distance d x = (x 1 ; x 2 ; : : :); y = (y 1 ; y 2 ; : : :) def = 1 1X jx j y j j p A j=1 1 p
19 Embeddings and distortion (X; d X ) admits a bi-lipschitz embedding into there exists 1 6 D < 1 and f : X! R n with Denote this by R n 8 x; y 2 X; d X (x; y) 6 kf(x) f(y)k 2 6 Dd X (x; y): X D,! R n : if c R n(x) def = smallest D for which this is possible.
20 Embeddings and distortion (X; d X ) admits a bi-lipschitz embedding into there exists 1 6 D < 1 and f : X! `p with 8 x; y 2 X; d X (x; y) 6 kf(x) f(y)k p 6 Dd X (x; y): Denote this by X D,! `p: `p if c p (X) def = smallest D for which this is possible.
21 Theorem (Bourgain, 1985): If (X; d X ) is a metric space of size n then c 2 (X). log n: This is sharp up to the value of the implicit constant (Linial-London-Rabinovich, 1995). Combining with (Johnson-Lindenstrauss, 1983): c R 10 log n(x). log n:
22 Theorem (Mendel-N., 2007): If (X; d X ) is a metric space of size n then for every 0 < ² < 1 there exists a subset Y ½ X with jy j > n 1 ² and c 2 (Y ). 1 ² : This is sharp (Bartal-Linial-Mendel-N., 2002).
23 The bi-lipschitz embeddability problem into R n Characterize those metric spaces (X; d X ) for which there exists an integer n such that (X; d X ) admits a bi-lipschitz embedding into. R n See [Semmes, 1999] for a survey.
24 Obvious restriction: doubling A metric space (X; d X ) is K-doubling if any ball can be covered by K-balls of half its radius. B(x; r) = fy 2 X : d X (x; y) 6 rg: (X; d X ) is said to be doubling if it is K-doubling for some K>0. ([Bouligand, 1928], [Larman, 1967], [Coifman-Weiss, 1971])
25 Doubling
26 Doubling
27 Doubling
28 Doubling
29 Doubling
30 Doubling
31 Doubling
32 Doubling
33 Doubling
34 Doubling
35 Doubling
36 Doubling
37 Doubling
38 Doubling
39 Doubling
40 Doubling
41 Doubling
42 Doubling
43 Doubling
44 R n is doubling R n Denote the unit ball of by. is a maximal set with for every distinct i,j. B n = B(0; 1) x 1 ; : : : ; x k 2 B n kx i x j k 2 > 1 2
45 R n is doubling R n Denote the unit ball of by. is a maximal set with for every distinct i,j. B n = B(0; 1) x 1 ; : : : ; x k 2 B n kx i x j k 2 > 1 2 def B j = B x j ; 1 4
46 R n is doubling R n Denote the unit ball of by. is a maximal set with for every distinct i,j. B n = B(0; 1) x 1 ; : : : ; x k 2 B n kx i x j k 2 > 1 2 vol (B n ) > > kx vol j=1 kx vol (B j \ B n ) j=1 µ B µ 7 8 x j; 1 8 = k vol (Bn ) 8 n :
47 R n is doubling R n Denote the unit ball of by. is a maximal set with for every distinct i,j. B n = B(0; 1) x 1 ; : : : ; x k 2 B n kx i x j k 2 > 1 2 k 6 8 n
48 R n is doubling R n Denote the unit ball of by. is a maximal set with for every distinct i,j. B n = B(0; 1) x 1 ; : : : ; x k 2 B n kx i x j k 2 > 1 2 B n ½ k 6 8 n k[ j=1 µ B x j ; 1 2
49 Simple consequence: If a metric space admits a bi- Lipschitz embedding into R n then it must also be doubling. If X D,! R n K = e O(n log D) then X is K-doubling with
50 Assouad s embedding theorem Theorem (Assouad, 1983): Suppose that is K-doubling and ² 2 (0; 1). Then (M; d 1 ² X ),! D(K;²) R N(K;²) : (X; d X )
51 Theorem (N.-Neiman, 2010): Suppose that is K-doubling and ² 2 (0; 1). Then (M; d 1 ² X ),! D(K;²) R N(K) : (X; d X ) David-Snipes, 2013: Simpler deterministic proof.
52 (M; d 1 ² X ),! D(K;²) R N(K;²) : Obvious question: Why do we need to raise the metric to the power 1 ²?
53 (M; d 1 ² X ),! D(K;²) R N(K;²) : Obvious question: Why do we need to raise the metric to the power 1 ²? Pansu (1989)-Semmes (1996): The power is needed! 1 ²
54 Heisenberg group The integer grid in 3-space H f(x; y; z) : x; y; z are integersg edges: (x; y; z)» (x 1; y; z) (x; y; z)» (x; y 1; z x)
55
56 Denote the shortest path metric on H by. d W The ball of radius n centered at 0=(0,0,0) is B n def = x 2 H = Z 3 : d W (x; 0) 6 n ª : By induction one shows that 8 m 2 N; 8x 2 H; jb dw (x; m)j = jb m j ³ m 4
57 8 m 2 N; 8x 2 H; jb dw (x; m)j = jb m j ³ m 4 So, (H; d W ) is a doubling metric space. Theorem (Pansu, Semmes, 1996): The metric space (H; d W ) does not admit a bi- Lipschitz embedding into for any integer n. R n
58 Heisenberg non-embeddability Pansu-Semmes (1996). Cheeger (1999). Pauls (2001). Lee-N. (2006). Cheeger-Kleiner (2006). Cheeger-Kleiner (2007). Cheeger-Kleiner (2008). Cheeger-Kleiner-N. (2009). Austin-N.-Tessera (2010). Lafforgue-N. (2012). Li (2013). Li (2014).
59 Heisenberg non-embeddability Pansu-Semmes (1996). Cheeger (1999). Pauls (2001). Lee-N. (2006). Cheeger-Kleiner (2006). Cheeger-Kleiner (2007). Cheeger-Kleiner (2008). Cheeger-Kleiner-N. (2009). Austin-N.-Tessera (2010). Lafforgue-N. (2012). Li (2013). Li (2014). H does not embed into `p:
60 More doubling spaces that do not admit a bi-lipschitz embedding into R n Laakso (1997):
61 [Laakso,1997], [Bourdon-Pajot, 1998], [Cheeger, 1999].
62 The Lang-Plaut problem (2001) All known examples of doubling metric spaces that fail to admit a bi-lipschitz embedding into actually fail to admit a bi-lipschitz embedding even into the infinite dimensional space. Question (Lang-Plaut): Does a doubling subset of admit a bi-lipschitz embedding into some? `2 R n R n `2
63 Would this solve the bi-lipschitz embeddability problem in? A metric space that embeds into must be doubling, and is clearly also bi-lipschitz to a subset of. `2 R n R n Conversely, can we recognize intrinsically that a given metric space embeds into? `2
64 Linial-London-Rabinovich (1995) Let d be a metric on f1; : : : ; ng. The metric space (f1; : : : ; ng; d) embeds with distortion D into `2 if and only if for every n by n symmetric positive semidefinite matrix A = (a ij ) with 8i; P n j=1 a ij = 0; nx i;j=1 maxf0; a ij gd(i; j) 2 6 D 2 n X i;j=1 maxf0; a ij gd(i; j) 2
65 Schoenberg, 1934 A metric space (X; d X ) is isometric to a subset of Hilbert space if and only if for every the matrix d(x i ; x j ) 2 is negative semidefinite on the subspace of mean-zero vectors: nx nx c j = 0 =) c i c j d(x i ; x j ) 2 6 0: j=1 j=1 x 1 ; : : : ; x n 2 X
66 Bi-Lipschitz dimensionality reduction Equivalent quantitative version of the Lang-Plaut question: Does every K-doubling subset X ½ `2 with distortion D(K) into R N(K)? embed This is known to be possible if one weakens the bi- Lipschitz requirement (e.g. nearest neighbor preserving embeddings, Indyk-N., 2007.)
67 Bi-Lipschitz dimensionality reduction Theorem (Johnson-Lindenstrauss, 1983): For every n points x 1 ; : : : ; x n 2 `2 and every ² 2 (0; 1), (fx 1 ; : : : ; x n g; kx yk 2 ) 1+²,! R C(²) log n : Most natural variants for important open problems. `p; p 6= 2 remain major In other metrics, e.g. earthmover, also wide open.
68 Failure of the Lang-Plaut problem? Theorem (Lafforgue-N., 2013): For every p>2 there exists a doubling subset of `p that does not admit a bi-lipschitz embedding into for every integer n. R n The construction relies on the Heisenberg group. Conjecture: The same construction refutes the Lang-Plaut problem in as well. `2
69 The Sparsest Cut Problem Input: Two symmetric functions C; D : f1; : : : ; ng f1; : : : ; ng! [0; 1): Goal: Compute (or estimate) in polynomial time the quantity (C; D) = min ;6=S(f1;:::;ng P n i;j=1 C(i; j)j1 S(i) 1 S (j)j P n i;j=1 D(i; j)j1 S(i) 1 S (j)j :
70 The Goemans-Linial Semidefinite Program The best known algorithm for the Sparsest Cut Problem is a continuous relaxation (~1997) called the Goemans-Linial Semidefinite program (G-L SDP). Theorem (Arora, Lee, N., 2005). The Goemans-Linial SDP outputs a number that is guaranteed to be within a factor of (log n) 1 2 +o(1) from (C; D):
71 Minimize nx i;j=1 C(i; j)kv i v j k 2 2 over all and v 1 ; : : : ; v n 2 R n, subject to the constraints nx i;j=1 D(i; j)kv i v j k 2 2 = 1; 8 i; j; k 2 f1; : : : ; ng; kv i v j k kv j v k k kv k v j k 2 2:
72 How well does the G-L SDP perform? Khot-Vishnoi (2005): The Goemans-Linial SDP must make an error of at least (log log n) c on some inputs.
73 The link to the Heisenberg group Theorem (Lee-N., 2006): The Goemans-Linial SDP makes an error of at least a constant multiple of c 1 (B n ; d W ) on some inputs. Motivated by Assouad s theorem.
74 How well does the G-L SDP perform? Theorem (Cheeger-Kleiner-N., 2009): There exists a universal constant c>0 such that c 1 (B n ; d W ) > (log n) c :
75 How well does the G-L SDP perform? Conjecture: Remark: In a special case called Uniform Sparsest Cut (approximating graph expansion) the G-L SDP might perform better. The best known performance guarantee is. p log n [Arora-Rao-Vazirani, 2004] and the best known impossibility result is e cp log log n [Kane-Meka, 2013]. c 1 (B n ; d W ) & p log n:
76 Conjecture: For every compactly supported), Ã Z 1. 0 Z R 3 f : R 3! R (smooth and µz 2 dt jf(x; y; z + t) f(x; y; z)jdxdydz R t 2 µ (x; y; (x; y; z) + x@f (x; dxdydz: Lemma: A positive solution of this conjecture implies that c 1 (B n ; d W ) & p log n:! 1 2
77 Theorem (Lafforgue-N., 2012): For every p>1, Ã Z 1 0. p µz µz R 3 2 p! 1 2 jf(x; y; z + t) f(x; y; z)j p dt dxdydz R t 2 3 µ (x; y; p (x; y; z) + x@f (x; 1 p dxdydz
78 Sharp distortion computation p 2 (1; 2] =) c p (B n ; d W ) ³ p p log n: p 2 [2; 1) =) c p (B n ; d W ) ³ p (log n) 1 p : Previously known for p=2 [Austin-N.-Tessera, 2010].
79 Geometric form of the conjecture Let A be a measurable subset of Then R 3. For t>0 define ³ (x; ª v t (A) def = vol y; z) 2 A : (x; y; z + t) =2 A : Z 1 0 v t (A) 2 t 2 dt. PER(A) 2 :
Vertical Versus Horizontal Poincare Inequalities. Assaf Naor Courant Institute
Vertical Versus Horizontal Poincare Inequalities Assaf Naor Courant Institute Bi-Lipschitz distortion a metric space and (M; d M ) (X; k k X ) a Banach space. c X (M) = the infimum over those D 2 (1; 1]
More informationFréchet embeddings of negative type metrics
Fréchet embeddings of negative type metrics Sanjeev Arora James R Lee Assaf Naor Abstract We show that every n-point metric of negative type (in particular, every n-point subset of L 1 ) admits a Fréchet
More informationFinite Metric Spaces & Their Embeddings: Introduction and Basic Tools
Finite Metric Spaces & Their Embeddings: Introduction and Basic Tools Manor Mendel, CMI, Caltech 1 Finite Metric Spaces Definition of (semi) metric. (M, ρ): M a (finite) set of points. ρ a distance function
More informationON ASSOUAD S EMBEDDING TECHNIQUE
ON ASSOUAD S EMBEDDING TECHNIQUE MICHAL KRAUS Abstract. We survey the standard proof of a theorem of Assouad stating that every snowflaked version of a doubling metric space admits a bi-lipschitz embedding
More informationTopic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007
CS880: Approximations Algorithms Scribe: Tom Watson Lecturer: Shuchi Chawla Topic: Balanced Cut, Sparsest Cut, and Metric Embeddings Date: 3/21/2007 In the last lecture, we described an O(log k log D)-approximation
More informationMetric structures in L 1 : Dimension, snowflakes, and average distortion
Metric structures in L : Dimension, snowflakes, and average distortion James R. Lee U.C. Berkeley and Microsoft Research jrl@cs.berkeley.edu Assaf Naor Microsoft Research anaor@microsoft.com Manor Mendel
More informationSimilarity searching, or how to find your neighbors efficiently
Similarity searching, or how to find your neighbors efficiently Robert Krauthgamer Weizmann Institute of Science CS Research Day for Prospective Students May 1, 2009 Background Geometric spaces and techniques
More informationU.C. Berkeley CS294: Spectral Methods and Expanders Handout 11 Luca Trevisan February 29, 2016
U.C. Berkeley CS294: Spectral Methods and Expanders Handout Luca Trevisan February 29, 206 Lecture : ARV In which we introduce semi-definite programming and a semi-definite programming relaxation of sparsest
More informationOn metric characterizations of some classes of Banach spaces
On metric characterizations of some classes of Banach spaces Mikhail I. Ostrovskii January 12, 2011 Abstract. The first part of the paper is devoted to metric characterizations of Banach spaces with no
More information16 Embeddings of the Euclidean metric
16 Embeddings of the Euclidean metric In today s lecture, we will consider how well we can embed n points in the Euclidean metric (l 2 ) into other l p metrics. More formally, we ask the following question.
More informationEuclidean distortion and the Sparsest Cut
Euclidean distortion and the Sparsest Cut [Extended abstract] Sanjeev Arora Princeton University arora@csprincetonedu James R Lee UC Berkeley jrl@csberkeleyedu Assaf Naor Microsoft Research anaor@microsoftcom
More informationHardness of Embedding Metric Spaces of Equal Size
Hardness of Embedding Metric Spaces of Equal Size Subhash Khot and Rishi Saket Georgia Institute of Technology {khot,saket}@cc.gatech.edu Abstract. We study the problem embedding an n-point metric space
More informationA Union of Euclidean Spaces is Euclidean. Konstantin Makarychev, Northwestern Yury Makarychev, TTIC
Union of Euclidean Spaces is Euclidean Konstantin Makarychev, Northwestern Yury Makarychev, TTIC MS Meeting, New York, May 7, 2017 Problem by ssaf Naor Suppose that metric space (X, d) is a union of two
More informationMANOR MENDEL AND ASSAF NAOR
. A NOTE ON DICHOTOMIES FOR METRIC TRANSFORMS MANOR MENDEL AND ASSAF NAOR Abstract. We show that for every nondecreasing concave function ω : [0, ) [0, ) with ω0) = 0, either every finite metric space
More informationPoorly embeddable metric spaces and Group Theory
Poorly embeddable metric spaces and Group Theory Mikhail Ostrovskii St. John s University Queens, New York City, NY e-mail: ostrovsm@stjohns.edu web page: http://facpub.stjohns.edu/ostrovsm March 2015,
More informationBi-Lipschitz embeddings of Grushin spaces
Bi-Lipschitz embeddings of Grushin spaces Matthew Romney University of Illinois at Urbana-Champaign 7 July 2016 The bi-lipschitz embedding problem Definition A map f : (X, d X ) (Y, d Y ) is bi-lipschitz
More informationProbabilistic clustering of high dimensional norms. Assaf Naor Princeton University SODA 17
Probabilistic clustering of high dimensional norms Assaf Naor Princeton University SODA 17 Partitions of metric spaces Let (X; d X ) be a metric space and a partition of X. P Given a point x 2 X; P(x)
More informationMarkov chains in smooth Banach spaces and Gromov hyperbolic metric spaces
Markov chains in smooth Banach spaces and Gromov hyperbolic metric spaces Assaf Naor Yuval Peres Oded Schramm Scott Sheffield October 19, 2004 Abstract A metric space X has Markov type 2, if for any reversible
More informationLocal Global Tradeoffs in Metric Embeddings
Local Global Tradeoffs in Metric Embeddings Moses Charikar Konstantin Makarychev Yury Makarychev Preprint Abstract Suppose that every k points in a n point metric space X are D-distortion embeddable into
More informationOn Stochastic Decompositions of Metric Spaces
On Stochastic Decompositions of Metric Spaces Scribe of a talk given at the fall school Metric Embeddings : Constructions and Obstructions. 3-7 November 204, Paris, France Ofer Neiman Abstract In this
More informationCoarse differentiation and multi-flows in planar graphs
Coarse differentiation and multi-flows in planar graphs James R. Lee Prasad Raghavendra Abstract We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching
More informationLecture 18: March 15
CS71 Randomness & Computation Spring 018 Instructor: Alistair Sinclair Lecture 18: March 15 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They may
More informationMetric spaces nonembeddable into Banach spaces with the Radon-Nikodým property and thick families of geodesics
Metric spaces nonembeddable into Banach spaces with the Radon-Nikodým property and thick families of geodesics Mikhail Ostrovskii March 20, 2014 Abstract. We show that a geodesic metric space which does
More informationNon-Asymptotic Theory of Random Matrices Lecture 4: Dimension Reduction Date: January 16, 2007
Non-Asymptotic Theory of Random Matrices Lecture 4: Dimension Reduction Date: January 16, 2007 Lecturer: Roman Vershynin Scribe: Matthew Herman 1 Introduction Consider the set X = {n points in R N } where
More informationEmbeddings of finite metric spaces in Euclidean space: a probabilistic view
Embeddings of finite metric spaces in Euclidean space: a probabilistic view Yuval Peres May 11, 2006 Talk based on work joint with: Assaf Naor, Oded Schramm and Scott Sheffield Definition: An invertible
More informationLecture: Expanders, in theory and in practice (2 of 2)
Stat260/CS294: Spectral Graph Methods Lecture 9-02/19/2015 Lecture: Expanders, in theory and in practice (2 of 2) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
More informationA (log n) Ω(1) integrality gap for the Sparsest Cut SDP
A (log n) Ω(1) integrality gap for the Sparsest Cut SDP Jeff Cheeger Courant Institute New York University New York, USA Email: cheeger@cims.nyu.edu Bruce Kleiner Courant Institute New York University
More informationDiffusion Geometries, Diffusion Wavelets and Harmonic Analysis of large data sets.
Diffusion Geometries, Diffusion Wavelets and Harmonic Analysis of large data sets. R.R. Coifman, S. Lafon, MM Mathematics Department Program of Applied Mathematics. Yale University Motivations The main
More informationTexas 2009 nonlinear problems
Texas 2009 nonlinear problems Workshop in Analysis and Probability August 2009, Texas A & M University, last update 07/28/2018 Abstract: This is a collection of problems suggested at two meetings of the
More informationOn-line embeddings. Piotr Indyk Avner Magen Anastasios Sidiropoulos Anastasios Zouzias
On-line embeddings Piotr Indyk Avner Magen Anastasios Sidiropoulos Anastasios Zouzias Abstract We initiate the study of on-line metric embeddings. In such an embedding we are given a sequence of n points
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationCompression bounds for Lipschitz maps from the Heisenberg group to L 1
Acta Math., 207 (2011), 291 373 DOI: 10.1007/s11511-012-0071-9 c 2011 by Institut Mittag-Leffler. All rights reserved Compression bounds for Lipschitz maps from the Heisenberg group to L 1 by Jeff Cheeger
More informationNOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS
NOWHERE LOCALLY UNIFORMLY CONTINUOUS FUNCTIONS K. Jarosz Southern Illinois University at Edwardsville, IL 606, and Bowling Green State University, OH 43403 kjarosz@siue.edu September, 995 Abstract. Suppose
More informationInto a Hilbert Space
ariv:math/0410427v1 [math.fa] 19 Oct 2004 l p (p > 2) Does Not Coarsely Embed Into a Hilbert Space William B. JOHNSON and N. Lovasoa RANDRIANARIVONY 1 A (not necessarily continuous) map f between two metric
More informationAlgorithms, Geometry and Learning. Reading group Paris Syminelakis
Algorithms, Geometry and Learning Reading group Paris Syminelakis October 11, 2016 2 Contents 1 Local Dimensionality Reduction 5 1 Introduction.................................... 5 2 Definitions and Results..............................
More information18.409: Topics in TCS: Embeddings of Finite Metric Spaces. Lecture 6
Massachusetts Institute of Technology Lecturer: Michel X. Goemans 8.409: Topics in TCS: Embeddings of Finite Metric Spaces September 7, 006 Scribe: Benjamin Rossman Lecture 6 Today we loo at dimension
More informationSharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces
Sharp quantitative nonembeddability of the Heisenberg group into superreflexive Banach spaces Tim Austin Brown Assaf Naor Courant Institute omain Tessera E.N.S. Lyon Abstract Let H denote the discrete
More information4 Countability axioms
4 COUNTABILITY AXIOMS 4 Countability axioms Definition 4.1. Let X be a topological space X is said to be first countable if for any x X, there is a countable basis for the neighborhoods of x. X is said
More informationBasic Properties of Metric and Normed Spaces
Basic Properties of Metric and Normed Spaces Computational and Metric Geometry Instructor: Yury Makarychev The second part of this course is about metric geometry. We will study metric spaces, low distortion
More informationEmbeddings of Negative-type Metrics and An Improved Approximation to Generalized Sparsest Cut
Embeddings of Negative-type Metrics and An Improved Approximation to Generalized Sparsest Cut Shuchi Chawla Anupam Gupta Harald Räcke Abstract In this paper, we study the metrics of negative type, which
More informationGeometric Constraints II
Geometric Constraints II Realizability, Rigidity and Related theorems. Embeddability of Metric Spaces Section 1 Given the matrix D d i,j 1 i,j n corresponding to a metric space, give conditions under which
More informationORIE 6334 Spectral Graph Theory November 22, Lecture 25
ORIE 64 Spectral Graph Theory November 22, 206 Lecture 25 Lecturer: David P. Williamson Scribe: Pu Yang In the remaining three lectures, we will cover a prominent result by Arora, Rao, and Vazirani for
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationSCALE-OBLIVIOUS METRIC FRAGMENTATION AND THE NONLINEAR DVORETZKY THEOREM
SCALE-OBLIVIOUS METRIC FRAGMENTATION AN THE NONLINEAR VORETZKY THEOREM ASSAF NAOR AN TERENCE TAO Abstract. We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is
More information1 The Heisenberg group does not admit a bi- Lipschitz embedding into L 1
The Heisenberg group does not admit a bi- Lipschitz embedding into L after J. Cheeger and B. Kleiner [CK06, CK09] A summary written by John Mackay Abstract We show that the Heisenberg group, with its Carnot-Caratheodory
More informationDiamond graphs and super-reflexivity
Diamond graphs and super-reflexivity William B. Johnson and Gideon Schechtman Abstract The main result is that a Banach space X is not super-reflexive if and only if the diamond graphs D n Lipschitz embed
More informationLecture 5 - Hausdorff and Gromov-Hausdorff Distance
Lecture 5 - Hausdorff and Gromov-Hausdorff Distance August 1, 2011 1 Definition and Basic Properties Given a metric space X, the set of closed sets of X supports a metric, the Hausdorff metric. If A is
More informationSection Taylor and Maclaurin Series
Section.0 Taylor and Maclaurin Series Ruipeng Shen Feb 5 Taylor and Maclaurin Series Main Goal: How to find a power series representation for a smooth function us assume that a smooth function has a power
More informationNotes taken by Costis Georgiou revised by Hamed Hatami
CSC414 - Metric Embeddings Lecture 6: Reductions that preserve volumes and distance to affine spaces & Lower bound techniques for distortion when embedding into l Notes taken by Costis Georgiou revised
More informationLecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University
Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University February 7, 2007 2 Contents 1 Metric Spaces 1 1.1 Basic definitions...........................
More informationMATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION. Problem 1
MATH 54 - TOPOLOGY SUMMER 2015 FINAL EXAMINATION ELEMENTS OF SOLUTION Problem 1 1. Let X be a Hausdorff space and K 1, K 2 disjoint compact subsets of X. Prove that there exist disjoint open sets U 1 and
More informationMultivariable Calculus
2 Multivariable Calculus 2.1 Limits and Continuity Problem 2.1.1 (Fa94) Let the function f : R n R n satisfy the following two conditions: (i) f (K ) is compact whenever K is a compact subset of R n. (ii)
More informationCOUNTABLE PRODUCTS ELENA GUREVICH
COUNTABLE PRODUCTS ELENA GUREVICH Abstract. In this paper, we extend our study to countably infinite products of topological spaces.. The Cantor Set Let us constract a very curios (but usefull) set known
More informationA new proof of Gromov s theorem on groups of polynomial growth
A new proof of Gromov s theorem on groups of polynomial growth Bruce Kleiner Courant Institute NYU Groups as geometric objects Let G a group with a finite generating set S G. Assume that S is symmetric:
More informationMeasured descent: A new embedding method for finite metrics
Measured descent: A new embedding method for finite metrics Robert Krauthgamer James R. Lee Manor Mendel Assaf Naor April 20, 2004 Abstract We devise a new embedding technique, which we call measured descent,
More informationSpherical Euclidean Distance Embedding of a Graph
Spherical Euclidean Distance Embedding of a Graph Hou-Duo Qi University of Southampton Presented at Isaac Newton Institute Polynomial Optimization August 9, 2013 Spherical Embedding Problem The Problem:
More informationEcon Lecture 3. Outline. 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n
Econ 204 2011 Lecture 3 Outline 1. Metric Spaces and Normed Spaces 2. Convergence of Sequences in Metric Spaces 3. Sequences in R and R n 1 Metric Spaces and Metrics Generalize distance and length notions
More informationVERTICAL PERIMETER VERSUS HORIZONTAL PERIMETER
VERTICAL PERIMETER VERSUS HORIONTAL PERIMETER ASSAF NAOR AND ROBERT YOUNG Abstract. Given k N, the k th discrete Heisenberg group, denoted H 2k+1, is the group generated by the elements a 1, b 1,..., a
More informationRaanan Schul UCLA Mathematics of Knowledge and Search Engines: Tutorials Sep. 19, Curvature and spanning trees in metric spaces p.
Curvature and spanning trees in metric spaces Raanan Schul UCLA Mathematics of Knowledge and Search Engines: Tutorials Sep. 19, 2007 Curvature and spanning trees in metric spaces p.1/33 How I was brought
More informationQualifying Exams I, 2014 Spring
Qualifying Exams I, 2014 Spring 1. (Algebra) Let k = F q be a finite field with q elements. Count the number of monic irreducible polynomials of degree 12 over k. 2. (Algebraic Geometry) (a) Show that
More informationLimits of cubes E1 4NS, U.K.
Limits of cubes Peter J. Cameron a Sam Tarzi a a School of Mathematical Sciences, Queen Mary, University of London, London E1 4NS, U.K. Abstract The celebrated Urysohn space is the completion of a countable
More informationAdvances in Manifold Learning Presented by: Naku Nak l Verm r a June 10, 2008
Advances in Manifold Learning Presented by: Nakul Verma June 10, 008 Outline Motivation Manifolds Manifold Learning Random projection of manifolds for dimension reduction Introduction to random projections
More informationREVIEW OF ESSENTIAL MATH 346 TOPICS
REVIEW OF ESSENTIAL MATH 346 TOPICS 1. AXIOMATIC STRUCTURE OF R Doğan Çömez The real number system is a complete ordered field, i.e., it is a set R which is endowed with addition and multiplication operations
More informationRamsey Theory. May 24, 2015
Ramsey Theory May 24, 2015 1 König s Lemma König s Lemma is a basic tool to move between finite and infinite combinatorics. To be concise, we use the notation [k] = {1, 2,..., k}, and [X] r will denote
More informationLecture 3. Econ August 12
Lecture 3 Econ 2001 2015 August 12 Lecture 3 Outline 1 Metric and Metric Spaces 2 Norm and Normed Spaces 3 Sequences and Subsequences 4 Convergence 5 Monotone and Bounded Sequences Announcements: - Friday
More informationSDP Relaxations for MAXCUT
SDP Relaxations for MAXCUT from Random Hyperplanes to Sum-of-Squares Certificates CATS @ UMD March 3, 2017 Ahmed Abdelkader MAXCUT SDP SOS March 3, 2017 1 / 27 Overview 1 MAXCUT, Hardness and UGC 2 LP
More informationLecture 10: Bourgain s Theorem
princeton u. sp 0 cos 598B: algorithms and complexity Lecture 10: Bourgain s Theorem Lecturer: Sanjeev Arora Scribe:Daniel J. Peng The goal of this week s lecture is to prove the l version of Bourgain
More informationLarge scale conformal geometry
July 24th, 2018 Goal: perform conformal geometry on discrete groups. Goal: perform conformal geometry on discrete groups. Definition X, X metric spaces. Map f : X X is a coarse embedding if where α +,
More informationSéminaire BOURBAKI Janvier ème année, , n o 1047 THE RIBE PROGRAMME. by Keith BALL
Séminaire BOURBAKI Janvier 2012 64ème année, 2011-2012, n o 1047 THE RIBE PROGRAMME by Keith BALL INTRODUCTION In 1976 Ribe [R] proved that uniformly homeomorphic Banach spaces have uniformly linearly
More informationMetric characterizations of some classes of Banach spaces
Metric characterizations of some classes of Banach spaces Mikhail Ostrovskii November 22, 2014 Dedicated to the memory of Cora Sadosky Abstract. The main purpose of the paper is to present some recent
More informationEuclidean Quotients of Finite Metric Spaces
Euclidean Quotients of Finite Metric Spaces Manor Mendel School of Engineering and Computer Science, Hebrew University, Jerusalem, Israel mendelma@cshujiacil Assaf Naor Microsoft Research, Redmond, Washington
More informationORIE 6334 Spectral Graph Theory December 1, Lecture 27 Remix
ORIE 6334 Spectral Graph Theory December, 06 Lecturer: David P. Williamson Lecture 7 Remix Scribe: Qinru Shi Note: This is an altered version of the lecture I actually gave, which followed the structure
More informationAn Algorithmist s Toolkit Nov. 10, Lecture 17
8.409 An Algorithmist s Toolkit Nov. 0, 009 Lecturer: Jonathan Kelner Lecture 7 Johnson-Lindenstrauss Theorem. Recap We first recap a theorem (isoperimetric inequality) and a lemma (concentration) from
More informationRandomized Algorithms
Randomized Algorithms 南京大学 尹一通 Martingales Definition: A sequence of random variables X 0, X 1,... is a martingale if for all i > 0, E[X i X 0,...,X i1 ] = X i1 x 0, x 1,...,x i1, E[X i X 0 = x 0, X 1
More informationRandom Feature Maps for Dot Product Kernels Supplementary Material
Random Feature Maps for Dot Product Kernels Supplementary Material Purushottam Kar and Harish Karnick Indian Institute of Technology Kanpur, INDIA {purushot,hk}@cse.iitk.ac.in Abstract This document contains
More informationOverview of normed linear spaces
20 Chapter 2 Overview of normed linear spaces Starting from this chapter, we begin examining linear spaces with at least one extra structure (topology or geometry). We assume linearity; this is a natural
More informationReal Analysis Problems
Real Analysis Problems Cristian E. Gutiérrez September 14, 29 1 1 CONTINUITY 1 Continuity Problem 1.1 Let r n be the sequence of rational numbers and Prove that f(x) = 1. f is continuous on the irrationals.
More informationarxiv: v1 [math.mg] 29 Sep 2015
SNOWFLAKE UNIVERSALITY OF WASSERSTEIN SPACES ALEXANDR ANDONI, ASSAF NAOR, AND OFER NEIMAN arxiv:509.08677v [math.mg] 29 Sep 205 Abstract. For p, ) let P pr 3 ) denote the metric space of all p-integrable
More informationMAS331: Metric Spaces Problems on Chapter 1
MAS331: Metric Spaces Problems on Chapter 1 1. In R 3, find d 1 ((3, 1, 4), (2, 7, 1)), d 2 ((3, 1, 4), (2, 7, 1)) and d ((3, 1, 4), (2, 7, 1)). 2. In R 4, show that d 1 ((4, 4, 4, 6), (0, 0, 0, 0)) =
More informationUnique Games Conjecture & Polynomial Optimization. David Steurer
Unique Games Conjecture & Polynomial Optimization David Steurer Newton Institute, Cambridge, July 2013 overview Proof Complexity Approximability Polynomial Optimization Quantum Information computational
More informationWeek 5 Lectures 13-15
Week 5 Lectures 13-15 Lecture 13 Definition 29 Let Y be a subset X. A subset A Y is open in Y if there exists an open set U in X such that A = U Y. It is not difficult to show that the collection of all
More informationMetric spaces admitting low-distortion embeddings into all n-dimensional Banach spaces
Metric spaces admitting low-distortion embeddings into all n-dimensional Banach spaces Mikhail I. Ostrovskii and Beata Randrianantoanina December 4, 04 Abstract For a fixed K and n N, n, we study metric
More informationMATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES
MATH 4200 HW: PROBLEM SET FOUR: METRIC SPACES PETE L. CLARK 4. Metric Spaces (no more lulz) Directions: This week, please solve any seven problems. Next week, please solve seven more. Starred parts of
More informationGeometry of Similarity Search
Geometry of Similarity Search Alex Andoni (Columbia University) Find pairs of similar images how should we measure similarity? Naïvely: about n 2 comparisons Can we do better? 2 Measuring similarity 000000
More informationPartitioning Algorithms that Combine Spectral and Flow Methods
CS369M: Algorithms for Modern Massive Data Set Analysis Lecture 15-11/11/2009 Partitioning Algorithms that Combine Spectral and Flow Methods Lecturer: Michael Mahoney Scribes: Kshipra Bhawalkar and Deyan
More informationMATHEMATICS ANNALS OF. Differentiating maps into L 1, and the geometry of BV functions. March, anmaah. By Jeff Cheeger and Bruce Kleiner
ANNALS OF MATHEMATICS Differentiating maps into L 1, and the geometry of BV functions By Jeff Cheeger and Bruce Kleiner SECOND SERIES, VOL. 171, NO. 2 March, 2010 anmaah Annals of Mathematics, 171 (2010),
More information2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.
2. Basic Structures 2.1 Sets Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R. Definition 2 Objects in a set are called elements or members of the set. A set is
More informationAN INTRODUCTION TO THE RIBE PROGRAM
AN INTRODUCTION TO THE RIBE PROGRAM ASSAF NAOR Contents 1. Introduction 2 2. Metric type 7 2.1. Type for metric spaces 8 2.2. The geometric puzzle 11 2.3. Pisier s argument 12 2.4. Unique obstructions
More information1 Dimension Reduction in Euclidean Space
CSIS0351/8601: Randomized Algorithms Lecture 6: Johnson-Lindenstrauss Lemma: Dimension Reduction Lecturer: Hubert Chan Date: 10 Oct 011 hese lecture notes are supplementary materials for the lectures.
More informationComputational Metric Embeddings. Anastasios Sidiropoulos
Computational Metric Embeddings by Anastasios Sidiropoulos Submitted to the Department of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor
More informationarxiv: v4 [math.mg] 16 Sep 2016
arxiv:1507.08211v4 [math.mg] 16 Sep 2016 Quantitative Bi-Lipschitz embeddings of bounded curvature manifolds and orbifolds SYLVESTER ERIKSSON-BIQUE We construct bi-lipschitz embeddings into Euclidean space
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More informationTHE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS
THE INVERSE FUNCTION THEOREM FOR LIPSCHITZ MAPS RALPH HOWARD DEPARTMENT OF MATHEMATICS UNIVERSITY OF SOUTH CAROLINA COLUMBIA, S.C. 29208, USA HOWARD@MATH.SC.EDU Abstract. This is an edited version of a
More informationUniversity of Sheffield. School of Mathematics and Statistics. Metric Spaces MAS331/6352
University of Sheffield School of Mathematics and Statistics Metric Spaces MAS331/635 017 18 1 Metric spaces This course is entitled Metric spaces. You may be wondering what such a thing should be. We
More informationUNIFORM EMBEDDINGS OF BOUNDED GEOMETRY SPACES INTO REFLEXIVE BANACH SPACE
UNIFORM EMBEDDINGS OF BOUNDED GEOMETRY SPACES INTO REFLEXIVE BANACH SPACE NATHANIAL BROWN AND ERIK GUENTNER ABSTRACT. We show that every metric space with bounded geometry uniformly embeds into a direct
More informationApproximating Sparsest Cut in Graphs of Bounded Treewidth
Approximating Sparsest Cut in Graphs of Bounded Treewidth Eden Chlamtac 1, Robert Krauthgamer 1, and Prasad Raghavendra 2 1 Weizmann Institute of Science, Rehovot, Israel. {eden.chlamtac,robert.krauthgamer}@weizmann.ac.il
More informationProblem Set 6: Solutions Math 201A: Fall a n x n,
Problem Set 6: Solutions Math 201A: Fall 2016 Problem 1. Is (x n ) n=0 a Schauder basis of C([0, 1])? No. If f(x) = a n x n, n=0 where the series converges uniformly on [0, 1], then f has a power series
More informationδ-hyperbolic SPACES SIDDHARTHA GADGIL
δ-hyperbolic SPACES SIDDHARTHA GADGIL Abstract. These are notes for the Chennai TMGT conference on δ-hyperbolic spaces corresponding to chapter III.H in the book of Bridson and Haefliger. When viewed from
More informationMedian Spaces and Applications
Median Spaces and Applications Indira Chatterji Based on joint work with C. Druku and F. Haglund Notes taken by W. Malone Abstract Median spaces are metric spaces in which given any 3 points, there exists
More informationASYMPTOTIC ISOPERIMETRY OF BALLS IN METRIC MEASURE SPACES
ASYMPTOTIC ISOPERIMETRY OF BALLS IN METRIC MEASURE SPACES ROMAIN TESSERA Abstract. In this paper, we study the asymptotic behavior of the volume of spheres in metric measure spaces. We first introduce
More information