Metric Embeddings

Regular price €188.48
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Mikhail I. Ostrovskii
Author_Mikhail I. Ostrovskii
Category=PBD
Category=PBKF
Category=UY
Embedding of Discrete Metric Spaces
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction

Product details

  • ISBN 9783110263404
  • Weight: 777g
  • Dimensions: 170 x 240mm
  • Publication Date: 18 Jun 2013
  • Publisher: De Gruyter
  • Publication City/Country: DE
  • Product Form: Hardback
Secure checkout Fast Shipping Easy returns

Embeddings of discrete metric spaces into Banach spaces recently became an important tool in computer science and topology. The purpose of the book is to present some of the most important techniques and results, mostly on bilipschitz and coarse embeddings.

The topics include: (1) Embeddability of locally finite metric spaces into Banach spaces is finitely determined; (2) Constructions of embeddings; (3) Distortion in terms of Poincaré inequalities; (4) Constructions of families of expanders and of families of graphs with unbounded girth and lower bounds on average degrees; (5) Banach spaces which do not admit coarse embeddings of expanders; (6) Structure of metric spaces which are not coarsely embeddable into a Hilbert space; (7) Applications of Markov chains to embeddability problems; (8) Metric characterizations of properties of Banach spaces; (9) Lipschitz free spaces. Substantial part of the book is devoted to a detailed presentation of relevant results of Banach space theory and graph theory. The final chapter contains a list of open problems. Extensive bibliography is also included. Each chapter, except the open problems chapter, contains exercises and a notes and remarks section containing references, discussion of related results, and suggestions for further reading.

The book will help readers to enter and to work in a very rapidly developing area having many important connections with different parts of mathematics and computer science.

Mikhail I. Ostrovskii, St. John's University, Queens, USA.

More from this author