Modern Erdos Magic

Spencer, Joel

Title:

Modern Erdos Magic

dc.contributor.author	Spencer, Joel
dc.contributor.corporatename	Georgia Institute of Technology. Algorithms, Randomness and Complexity Center	en_US
dc.contributor.corporatename	Georgia Institute of Technology. College of Computing	en_US
dc.contributor.corporatename	Georgia Institute of Technology. School of Industrial and Systems Engineering	en_US
dc.contributor.corporatename	Georgia Institute of Technology. School of Mathematics	en_US
dc.contributor.corporatename	New York University. Courant Institute of Mathematical Sciences	en_US
dc.date.accessioned	2017-11-13T20:36:21Z
dc.date.available	2017-11-13T20:36:21Z
dc.date.issued	2017-11-02
dc.description	Presented on November 2, 2017 at 11:05 a.m. in Skiles, room 006.	en_US
dc.description	Joel Spencer is a Silver Professor in the Computer Science and Mathematics Departments at the Courant Institute, New York University.	en_US
dc.description	Runtime: 53:50 minutes	en_US
dc.description.abstract	Traditional Erdos Magic (a.k.a. The Probabilistic Method) proves the existence of an object with certain properties by showing that a random (appropriately defined) object will have those properties with positive probability. Modern Erdos Magic analyzes a random process, a random (CS take note!) algorithm. These, when successful, can find a "needle in an exponential haystack" in polynomial time. We'll look at two particular examples, both involving a family of n-element sets under suitable side conditions. The Lovasz Local Lemma finds a coloring with no set monochromatic. A result of this speaker finds a coloring with low discrepency. In both cases the original proofs were not implementable but Modern Erdos Magic finds the colorings in polynomial times. The methods are varied. Basic probability and combinatorics. Brownian Motion. Semigroups. Martingales. Recursions ... and Tetris!	en_US
dc.format.extent	53:50 minutes
dc.identifier.uri	http://hdl.handle.net/1853/58931
dc.language.iso	en_US	en_US
dc.relation.ispartofseries	School of Mathematics Colloquium
dc.relation.ispartofseries	Algorithms, Combinatorics and Optimization (ACO) Colloquium
dc.subject	Discrepancy	en_US
dc.subject	Lovasz local lemma	en_US
dc.subject	Probabilistic method	en_US
dc.title	Modern Erdos Magic	en_US
dc.type	Moving Image
dc.type.genre	Lecture
dspace.entity.type	Publication
local.contributor.corporatename	Algorithms and Randomness Center
local.contributor.corporatename	College of Computing
local.relation.ispartofseries	ARC Colloquium
relation.isOrgUnitOfPublication	b53238c2-abff-4a83-89ff-3e7b4e7cba3d
relation.isOrgUnitOfPublication	c8892b3c-8db6-4b7b-a33a-1b67f7db2021
relation.isSeriesOfPublication	c933e0bc-0cb1-4791-abb4-ed23c5b3be7e