Location: ** CoRE 301**

Date & time: Wednesday, 06 December 2017 at 11:00AM - 12:00PM

Abstract: A lot of well-studied problems in CS Theory are about making “sketches” of graphs that occupy much less space than the graph itself, but where the shortest path distances of the graph can still be approximately recovered from the sketch. For example, in the literature on Spanners, we seek a sparse subgraph whose distance metric approximates that of the original graph. In Emulator literature, we relax the requirement that the approximating graph is a subgraph. Most generally, in Distance Oracles, the sketch can be an arbitrary data structure, so long as it can approximately answer queries about the pairwise distance between nodes in the original graph.

Research on these objects typically focuses on optimizing the worst-case tradeoff between the quality of the approximation and the amount of space that the sketch occupies. In this talk, we will survey a recent leap in understanding about this tradeoff, overturning the conventional wisdom on the problem. Specifically, the tradeoff is not smooth, but rather it follows a new discrete hierarchy in which the quality of the approximation that can be obtained jumps considerably at certain predictable thresholds.

Includes joint work with Amir Abboud and Seth Pettie.

Arthur Wang Organizer's Page

Charles Weibel Organizer's Page

Brooke Logan

Wujun Zhang, Rick Falk Organizer's Page

Xiaojun Huang, Jian Song, Sagun Chanillo

Pranjal Awasthi, Shubhangi Saraf Organizer's Page

Jeffry Kahn, Bhargav Narayanan, Abigail Raz Organizer's Page

Bryan Ek, Doron Zeilbrger Organizer's Page

Paul Feehan, Manousos Maridakis, Natasa Sesum seminar webpage

Borisov, Diaconescu, Tarasca, Woodward

Alejandro Ginory Organizer's Page

Jason Saied, Corrine Yap Organizer's Page

Erik De Amorim Organizer's Page

Yonah Biers-Ariel Organizer's Page

Katie McKeon Organizer's Page

Yanyan Li, Zheng-Chao Han, Jian Song, Natasa Sesum

Lisa Carbone, Yi-Zhi Huang, James Lepowsky, Siddhartha Sahi Organizer's page

Grigor Sargsyan seminar website

Kasper Larsen, Daniel Ocone and Kim Weston Organizer's page

Joel Lebowitz, Michael Kiessling

Yanyan Li, Haim Brezis

Matthew C Welsh

Stephen D. Miller, John C. Miller, Alex V. Kontorovich, Claire Burrin seminar website

Stephen D. Miller

Matthew Charnley Organizer's Page

Feng Luo, Xiaochun Rong, Hongbin Sun Organizer's page

M. Lienert seminar webpage

Organizer: Vladimir Retakh Organizer's page

Claire Burrin, Amita Malik, Kei Nakamura

- Show events from all categories

Directions: map and driving directions. If you need information on public transportation, you may want to check the New Jersey Transit page.

*Unfortunately, cancellations do occur from time to time. Feel free to call our department: 848-445-6969 before embarking on your journey. Thank you.*

Department of Mathematics
Rutgers University Hill Center - Busch Campus 110 Frelinghuysen Road Piscataway, NJ 08854-8019, USA Phone: +1.848.445.2390 Fax: +1.732.445.5530 |