Hardcover ISBN:  9780821853276 
Product Code:  PSAPM/70 
List Price:  $129.00 
MAA Member Price:  $116.10 
AMS Member Price:  $103.20 
eBook ISBN:  9780821889978 
Product Code:  PSAPM/70.E 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
Hardcover ISBN:  9780821853276 
eBook: ISBN:  9780821889978 
Product Code:  PSAPM/70.B 
List Price:  $254.00 $191.50 
MAA Member Price:  $228.60 $172.35 
AMS Member Price:  $203.20 $153.20 
Hardcover ISBN:  9780821853276 
Product Code:  PSAPM/70 
List Price:  $129.00 
MAA Member Price:  $116.10 
AMS Member Price:  $103.20 
eBook ISBN:  9780821889978 
Product Code:  PSAPM/70.E 
List Price:  $125.00 
MAA Member Price:  $112.50 
AMS Member Price:  $100.00 
Hardcover ISBN:  9780821853276 
eBook ISBN:  9780821889978 
Product Code:  PSAPM/70.B 
List Price:  $254.00 $191.50 
MAA Member Price:  $228.60 $172.35 
AMS Member Price:  $203.20 $153.20 

Book DetailsProceedings of Symposia in Applied MathematicsVolume: 70; 2012; 232 ppMSC: Primary 55; 37; 53; 68
What is the shape of data? How do we describe flows? Can we count by integrating? How do we plan with uncertainty? What is the most compact representation? These questions, while unrelated, become similar when recast into a computational setting. Our input is a set of finite, discrete, noisy samples that describes an abstract space. Our goal is to compute qualitative features of the unknown space. It turns out that topology is sufficiently tolerant to provide us with robust tools.
This volume is based on lectures delivered at the 2011 AMS Short Course on Computational Topology, held January 4–5, 2011 in New Orleans, Louisiana.
The aim of the volume is to provide a broad introduction to recent techniques from applied and computational topology. Afra Zomorodian focuses on topological data analysis via efficient construction of combinatorial structures and recent theories of persistence. Marian Mrozek analyzes asymptotic behavior of dynamical systems via efficient computation of cubical homology. Justin Curry, Robert Ghrist, and Michael Robinson present Euler Calculus, an integral calculus based on the Euler characteristic, and apply it to sensor and network data aggregation. Michael Erdmann explores the relationship of topology, planning, and probability with the strategy complex. Jeff Erickson surveys algorithms and hardness results for topological optimization problems.
ReadershipGraduate students and research mathematicians interested in applied and computational topology.

Table of Contents

Articles

Afra Zomorodian — Topological data analysis

Marian Mrozek — Topological dynamics: Rigorous numerics via cubical homology

Justin Curry, Robert Ghrist and Michael Robinson — Euler calculus with applications to signals and sensing

Michael Erdmann — On the topology of discrete planning with uncertainty

Jeff Erickson — Combinatorial optimization of cycles and bases


Additional Material

RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Additional Material
 Requests
What is the shape of data? How do we describe flows? Can we count by integrating? How do we plan with uncertainty? What is the most compact representation? These questions, while unrelated, become similar when recast into a computational setting. Our input is a set of finite, discrete, noisy samples that describes an abstract space. Our goal is to compute qualitative features of the unknown space. It turns out that topology is sufficiently tolerant to provide us with robust tools.
This volume is based on lectures delivered at the 2011 AMS Short Course on Computational Topology, held January 4–5, 2011 in New Orleans, Louisiana.
The aim of the volume is to provide a broad introduction to recent techniques from applied and computational topology. Afra Zomorodian focuses on topological data analysis via efficient construction of combinatorial structures and recent theories of persistence. Marian Mrozek analyzes asymptotic behavior of dynamical systems via efficient computation of cubical homology. Justin Curry, Robert Ghrist, and Michael Robinson present Euler Calculus, an integral calculus based on the Euler characteristic, and apply it to sensor and network data aggregation. Michael Erdmann explores the relationship of topology, planning, and probability with the strategy complex. Jeff Erickson surveys algorithms and hardness results for topological optimization problems.
Graduate students and research mathematicians interested in applied and computational topology.

Articles

Afra Zomorodian — Topological data analysis

Marian Mrozek — Topological dynamics: Rigorous numerics via cubical homology

Justin Curry, Robert Ghrist and Michael Robinson — Euler calculus with applications to signals and sensing

Michael Erdmann — On the topology of discrete planning with uncertainty

Jeff Erickson — Combinatorial optimization of cycles and bases