Coloring graph powers; A Fourier approach N. Alon, I. Dinur, E. Friedgut, B. Sudakov.

Slides:

Advertisements

Similar presentations

Quantum t-designs: t-wise independence in the quantum world Andris Ambainis, Joseph Emerson IQC, University of Waterloo.

Advertisements

Shortest Vector In A Lattice is NP-Hard to approximate

On the robustness of dictatorships: spectral methods. Ehud Friedgut, Hebrew University, Jerusalem.

On Complexity, Sampling, and -Nets and -Samples. Range Spaces A range space is a pair, where is a ground set, it’s elements called points and is a family.

Quantum One-Way Communication is Exponentially Stronger than Classical Communication TexPoint fonts used in EMF. Read the TexPoint manual before you delete.

On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.

List decoding Reed-Muller codes up to minimal distance: Structure and pseudo- randomness in coding theory Abhishek Bhowmick (UT Austin) Shachar Lovett.

The first of many fun lessons….  We will utilize class time and discussions to determine if a statement is true.

On the size of dissociated bases Raphael Yuster University of Haifa Joint work with Vsevolod Lev University of Haifa.

Eigenvalues and Eigenvectors

1 List Coloring and Euclidean Ramsey Theory TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A Noga Alon, Tel Aviv.

II. Linear Independence 1.Definition and Examples.

Analysis of Boolean Functions Fourier Analysis, Projections, Influence, Junta, Etc… And (some) applications Slides prepared with help of Ricky Rosen.

Asymmetric Ramsey Properties of Random Graphs involving Cliques Reto Spöhel Joint work with Martin Marciniszyn, Jozef Skokan, and Angelika Steger TexPoint.

On the Fourier Tails of Bounded Functions over the Discrete Cube Irit Dinur, Ehud Friedgut, and Ryan O’Donnell Joint work with Guy Kindler Microsoft Research.

Dimensionality Reduction

Fourier Analysis, Projections, Influences, Juntas, Etc…

5.II. Similarity 5.II.1. Definition and Examples

Expanders Eliyahu Kiperwasser. What is it? Expanders are graphs with no small cuts. The later gives several unique traits to such graph, such as: – High.

The Importance of Being Biased Irit Dinur S. Safra (some slides borrowed from Dana Moshkovitz) Irit Dinur S. Safra (some slides borrowed from Dana Moshkovitz)

Fourier Analysis of Boolean Functions Juntas, Projections, Influences Etc.

Orthogonality and Least Squares

Antimagic Labellings of Graphs Torsten Mütze Joint work with Dan Hefetz and Justus Schwartz.

Dana Moshkovitz, MIT Joint work with Subhash Khot, NYU.

GROUPS & THEIR REPRESENTATIONS: a card shuffling approach Wayne Lawton Department of Mathematics National University of Singapore S ,

8.1 Vector spaces A set of vector is said to form a linear vector space V Chapter 8 Matrices and vector spaces.

Correlation testing for affine invariant properties on Shachar Lovett Institute for Advanced Study Joint with Hamed Hatami (McGill)

CHAPTER FIVE Orthogonality Why orthogonal? Least square problem Accuracy of Numerical computation.

+ Review of Linear Algebra Optimization 1/14/10 Recitation Sivaraman Balakrishnan.

Dense subgraphs of random graphs Uriel Feige Weizmann Institute.

Eigenvalues and Eigenvectors

Linear Algebra (Aljabar Linier) Week 10 Universitas Multimedia Nusantara Serpong, Tangerang Dr. Ananda Kusuma

Primer on Fourier Analysis Dana Moshkovitz Princeton University and The Institute for Advanced Study.

Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.

1 CPSC 320: Intermediate Algorithm Design and Analysis July 11, 2014.

4 4.6 © 2012 Pearson Education, Inc. Vector Spaces RANK.

Postulates and Paragraph Proofs Section 2-5.  postulate or axiom – a statement that describes a fundamental relationship between the basic terms of geometry.

The Hilbert transform along a one variable vector field Christoph Thiele (joint work with M. Bateman) Conference in honor of Eli Stein, Princeton, 2011.

1 Asymptotically optimal K k -packings of dense graphs via fractional K k -decompositions Raphael Yuster University of Haifa.

1 Decomposition into bipartite graphs with minimum degree 1. Raphael Yuster.

1 ۞ An eigenvalue λ and an eigenfunction f(x) of an operator Ĥ in a space S satisfy Week 6 2. Properties of self-adjoint operators where f(x) is implied.

Charles University FSV UK STAKAN III Institute of Economic Studies Faculty of Social Sciences Institute of Economic Studies Faculty of Social Sciences.

5.1 Eigenvectors and Eigenvalues 5. Eigenvalues and Eigenvectors.

Multi-way spectral partitioning and higher-order Cheeger inequalities University of Washington James R. Lee Stanford University Luca Trevisan Shayan Oveis.

Proof that the three medians of a triangle meet at one point, known as the centroid. Proof 3: Proof by vectors.

Presented by Alon Levin

5 5.1 © 2016 Pearson Education, Ltd. Eigenvalues and Eigenvectors EIGENVECTORS AND EIGENVALUES.

Approximation Algorithms based on linear programming.

Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.

Tutorial 6. Eigenvalues & Eigenvectors Reminder: Eigenvectors A vector x invariant up to a scaling by λ to a multiplication by matrix A is called.

Chapter 3 Linear Systems Review

Antimagic Labellings of Graphs

Matrices and vector spaces

EIGEN … THINGS (values, vectors, spaces … )

Markov Chains Mixing Times Lecture 5

Spectral Clustering.

Sum of Squares, Planted Clique, and Pseudo-Calibration

The Road Problem - Special Case Study

GROUPS & THEIR REPRESENTATIONS: a card shuffling approach

Probabilistic existence of regular combinatorial objects

Linear sketching with parities

Around the Regularity Lemma

Complexity Theory in Practice

Vector Spaces RANK © 2012 Pearson Education, Inc..

Linear Algebra: Matrix Eigenvalue Problems – Part 2

The Importance of Being Biased

The Hilbert transform along a one variable vector field

Eigenvalues and Eigenvectors

Presentation transcript:

Coloring graph powers; A Fourier approach N. Alon, I. Dinur, E. Friedgut, B. Sudakov

Traffic light Whenever you change all the switches......the light changes! How does that work?! Maybe... the light depends on only one switch?

Weak graph products

Coloring the product

Theorem: Trivial New Previously known (Lovász & Greenwell)

Extensions to general r -regular graphs This generalizes part (a)

Independent sets and the smallest eigenvalue

Theorem:

Sketch of the proof for the case of £ n K r For the sake of simplicity we will go through this proof for the case of r =3

Sketch of the proof for the case of £ n K r

easy

Sketch of the proof for the case of £ n K r Generalized F.K.N.

General r -regular graphs For the more general case we imitate this proof, and do pseudo-Fourier analysis on products of general graphs. Surprisingly enough, this amounts to no more than a change of basis in a linear space that allows us to “import” results such as F.K.N.

Highlights of the proof for the general case

From here on the proof proceeds almost precisely as before, we essentially “cut and paste” the previous arguments, where all the Fourier-related lemmas are preserved under the transformation between the two orthonormal bases of our space: the characters and the eigenvectors of G. (Crucially, this transformation has | S | $ | v |).

Questions?

Large independent sets Here is an example of a large independent set in f 0,1,2 g n : All vectors that have at least two 0’s among their first three coordinates. (The measure of this set is 7/27.) Are all reasonably large independent sets of similar form?

No, a random subset of such an independent set is also independent, yet does not depend on a fixed number of coordinates. However, we conjecture that the following is true:

Conjecture: Every large independent set is contained almost entirely in a junta. More Precisely:

Conjecture:

Part B: ( or The importance of being biased 1.1) Joint with Irit Dinur.

How to recover the junta? 0 12

The importance of being biased

The slope is equal to the sum of the influences

The junta lemma

Erdős-Ko-Rado (The sunflower theorem)

Corollary: Continuous asymptotic EKR.

From binary to ternary, the proof: Wait a minute, doesn’t that prove that every set is close to a junta according to some measure?!

Recovering the junta