Search for tag: "combinatorics on words"

Sivakanth Gopi - Locally decodable codes and arithmetic progressions in random settings

(1) A set D of natural numbers is called t-intersective if every positive upper density subset A of natural numbers contains a (t+1)-length arithmetic progression (AP) whose common differences is in…

From  Kathryn Gentilello 2 Months ago 1 views 0  

Chris Urmson - Delivering the Benefits of Self-Driving Technology Safely, Quickly, and Broadly

The sixth Kelly Distinguished Lecturer, Chris Urmson, will present “Delivering the Benefits of Self-Driving Technology Safely, Quickly, and Broadly” on Wednesday, November 7, from…

From  Kathryn Gentilello 3 Months ago 283 views 0  

Lutz Warnke - Large girth approximate Steiner triple systems

In 1973 Erdos asked whether there are n-vertex partial Steiner triple systems with arbitrary high girth and quadratically many triples. (Here girth is defined as the smallest integer g \ge 4 for…

From  Kathryn Gentilello 4 Months ago 69 views 0  

A Friendly Smoothed Analysis of the Simplex Method - Daniel Dadush

Explaining the excellent practical performance of the simplex method for linear programming has been a major topic of research for over 50 years. One of the most successful frameworks for…

From  Kathryn Gentilello 8 Months ago 23 views 0  

On the infection time of the Duarte model: the role of energy barriers - Fabio Martinelli

In the Duarte model each vertex of Z <Superscript> 2 can be either infected or healthy. In the bootstrap percolation model version, infected vertices stay infected while a healthy vertex…

From  Kathryn Gentilello 8 Months ago 7 views 0  

Cutoff with window for the random to random shuffle - Megan Bernstein

Cutoff is a remarkable property of many Markov chains in which they after number of steps abruptly transition in a smaller order window from an unmixed to a mixed distribution. Most random walks on…

From  Kathryn Gentilello 8 Months ago 8 views 0  

Sphere packings, codes, and kissing numbers via hard core models - Will Perkins

We prove a lower bound on the expected size of a spherical code drawn from a "hard cap" model and the expected density of a packing drawn from the hard sphere model in high dimensions.…

From  Kathryn Gentilello 8 Months ago 11 views 0  

Inapproximability of the Independent Set Polynomial in the Complex Plane - Daniel Stefankovic

Hard-core model (also known as independent set polynomial) is one of the simplest models in statistical physics. The complexity of approximating the value of the partition function of the model on…

From  Kathryn Gentilello 8 Months ago 8 views 0  

Learning discrete Markov Random Fields with nearly optimal runtime and sample complexity - Raghu Meka

We give an algorithm for learning the structure of an undirected graphical model that has essentially optimal sample complexity and running time. We make no assumptions on the structure of the…

From  Kathryn Gentilello 8 Months ago 14 views 0  

Towards Tight Approximation Bounds for Graph Diameter and Eccentricities - Virginia Vassilevska Williams

Among the most important graph parameters is the Diameter, the largest distance between any two vertices. There are no known very efficient algorithms for computing the Diameter exactly. Thus, much…

From  Kathryn Gentilello 8 Months ago 8 views 0