Skip to main content

Geometric Aspects of Functional Analysis

Israel Seminar (GAFA) 2020-2022

  • Book
  • © 2023

Overview

  • Features an interdisciplinary mix of harmonic analysis, computational geometry, optimization & learning algorithms
  • Includes a unique combination of papers on convex geometry and high-dimensional analysis
  • Presents the state-of-the-art in asymptotic geometric analysis

Part of the book series: Lecture Notes in Mathematics (LNM, volume 2327)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 16.99 USD 54.99
Discount applied Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 16.99 USD 69.99
Discount applied Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

About this book

This book reflects general trends in the study of geometric aspects of functional analysis, understood in a broad sense. A classical theme in the local theory of Banach spaces is the study of probability measures in high dimension and the concentration of measure phenomenon. Here this phenomenon is approached from different angles, including through analysis on the Hamming cube, and via quantitative estimates in the Central Limit Theorem under thin-shell and related assumptions. Classical convexity theory plays a central role in this volume, as well as the study of geometric inequalities. These inequalities, which are somewhat in spirit of the Brunn-Minkowski inequality, in turn shed light on convexity and on the geometry of Euclidean space. Probability measures with convexity or curvature properties, such as log-concave distributions, occupy an equally central role and arise in the study of Gaussian measures and non-trivial properties of the heat flow in Euclidean spaces. Also discussed are interactions of this circle of ideas with linear programming and sampling algorithms, including the solution of a question in online learning algorithms using a classical convexity construction from the 19th century.

Keywords

Table of contents (15 chapters)

Editors and Affiliations

  • Department of Mathematics, Weizmann Institute of Science, Rehovot, Israel

    Ronen Eldan, Bo'az Klartag

  • Department of Mathematical and Statistical Sciences, University of Alberta, Edmonton, Canada

    Alexander Litvak

  • Department of Mathematics, Technion - Israel Institute of Technology, Haifa, Israel

    Emanuel Milman

Bibliographic Information

Publish with us