Properties of Expanders Expanders as Approximations of the Complete Graph
|
|
- Dale Chapman
- 5 years ago
- Views:
Transcription
1 Spectral Graph Theory Lecture 10 Properties of Expanders Daniel A. Spielman October 2, Expanders as Approximations of the Complete Graph Last lecture, we defined an expander graph to be a d-regular graph whose adjacency matrix eigenvalues satisfy α i ɛd, 10.1) for i 2, for some small ɛ. We will now see that graphs satisfying this condition are very good approximations of the complete graph. I say that a graph G is an ɛ-approximation of a graph H if where I recall that I say H G if for all x 1 ɛ)h G 1 + ɛ)h, x T L H x x T L G x. Let G be a graph whose adjacency eigenvalues satisfy 10.1). As its Laplacian eigenvalues satisfy λ i = d α i, all non-zero eignevalues of L G are between 1 ɛ)d and 1 + ɛ)d. This means that for all x orthogonal to the all-1s vector, 1 ɛ)dx T x x T L G x 1 + ɛ)dx T x. You may verify this by Courant-Fischer, or by expanding x in an eigenbasis. On the other hand, for the complete graph K n, we know that all x orthogonal to the all-1s vector satisfy x T L Kn x = nx T x. Let H be the graph so Thus, G is an ɛ-approximation of H. H = d n K n, x T L H x = dx T x. This tells us that G H is a matrix of small norm. Observe that 1 ɛ)h G 1 + ɛ)h ɛh G H ɛh. As G and H are symmetric, and all eigenvalues of ɛh are 0 or d, we may infer L G L H ɛd. 10.2) 10-1
2 Lecture 10: October 2, Quasi-Random Properties of Expanders There are many ways in which expander graphs act like random graphs. In fact, one can prove that a random d-regular graph is an expander graph with reasonably high probability. We also know that all sets of vertices in an expander graph act like random sets of vertices. To make this precise, imagine creating a random set S V by including each vertex in S independently with probabilty α. How many edeges do we expect to find between vertices in S? Well, for every edge u, v), the probability that u S is α and the probability that v S is α, so the probability that both endpoints are in S is α 2. So, we expect an α 2 fraction of the edges to go between vertices in S. We will show that this is true for all sufficiently large sets S in an expander. In fact, we will prove a stronger version of this statement for two sets S and T. Imagine including each vertex in S independently with probability α and each vertex in T with probability β. We allow vertices to belong to both S and T. For how many ordered pairs u, v) E do we expect to have u S and v T? Obviously, it should hold for an αβ fraction of the pairs. For a graph G = V, E), define ES, T ) = {u, v) : u S, v T, u, v) E}. We have put the arrow above the E in the definition, because we are considering ordered pairs of vertices. When S and T are disjoint ES, T ) is precisely the number of edges between S and T, while ES, S) counts every edge inside S twice. The following bound is a slight extension by Beigel, Margulis and Spielman [BMS93] of a bound originally proved by Alon and Chung [AC88]. Theorem Let G = V, E) be a d-regular graph that ɛ-approximates d n K n. Then, for every S V and T V, ES, T ) αβdn ɛdn α α 2 )β β 2 ), where S = αn and T = βn. Observe that when α and β are greater than ɛ, the term on the right is less than αβdn. In class, we will just prove this in the case that S and T are disjoint. Proof. The first step towards the proof is to observe χ T S L G χ T = d S T ES, T ).
3 Lecture 10: October 2, Let H = d n K n. As G is a good approximation of H, let s compute χ T S L H χ T = χ T S di dn ) J χ T = d S T d S T = d S T αβdn. n So, As ES, T ) αβdn = χ T S L G χ T χ T S L H χ T. L G L H ɛd, χ T S L H χ T χ T S L G χ T = χ T S L H L G )χ T χ S L H L G )χ T χ S L H L G χ T ɛd χ S χ T = ɛdn αβ. This is almost as good as the bound we are trying to prove. To prove the claimed bound, we should orthogonalize χ S and χ T with respect to the all-1 s vector. We then get χ T S L H L G )χ T = χ S α1) T L H L G )χ T β1), while χ S α1 χ T α1 = n α α 2 )β β 2 ). So, we may conclude ES, T ) αβdn ɛdn α α 2 )β β 2 ). We remark that when S and T are disjoint, the same proof goes through even if G is irregular and weighted if we replace ES, T ) with ws, T ) = u,v) E,u S,v T wu, v). We only need the fact that G ɛ-approximates d n K n. See [BSS09] for details Vertex Expansion The reason for the name expander graph is that small sets of vertices in expander graphs have unusually large numbers of neighbors. For S V, let NS) denote the set of vertices that are neighbors of vertices in S. The following theorem, called Tanner s Theorem, provides a lower bound on the size of NS).
4 Lecture 10: October 2, Theorem [Tan84]). Let G = V, E) be a d-regular graph on n vertices that ɛ-approximates d n K n. Then, for all S V, S NS) ɛ 2 1 α) + α, where S = αn. Note that when α is much less than ɛ 2, the term on the right is approximately S /ɛ 2, which can be much larger than S. We will derive Tanner s theorem from Theorem Proof. Let R = NS) and let T = V R. Then, there are no edges between S and T. Let T = βn and R = γn, so γ = 1 β. By Theorem , it must be the case that αβdn ɛdn α α 2 )β β 2 ). The lower bound on γ now follows by re-arranging terms. For example, we have α 2 β 2 ɛ 2 α α 2 )β β 2 ) αβ ɛ 2 1 α)1 β) β 1 β ɛ2 1 α) α 1 γ ɛ2 1 α) γ α 1 γ ɛ2 1 α) + α α α γ ɛ 2 1 α) + α. If instead of NS) we consider NS) S, then T and S are disjoint, so the same proof goes through for weighted, irregular graphs that ɛ-approximate d n K n How well can a graph approximate the complete graph? Consider applying Tanner s Theorem with S = {v} for some vertex v. As v has exactly d neighbors, we find ɛ 2 1 1/n) + 1/n 1/d, from which we see that ɛ must be at least 1/ d + d 2 /n, which is essentially 1/ d. But, how small can it be? The Ramanujan graphs, constructed by Margulis [Mar88] and Lubotzky, Phillips and Sarnak [LPS88] achieve ɛ 2 d 1. d
5 Lecture 10: October 2, We will see that if we keep d fixed while we let n grow, ɛ cannot exceed this bound in the limit. We will prove an upper bound on ɛ by constructing a suitable test function. As a first step, choose two vertices v and u in V whose neighborhoods to do not overlap. Consider the vector x defined by 1 if i = u, 1/ d if i Nu), x i) = 1 if i = v, 1/ d if i Nv), 0 otherwise. Now, compute the Rayleigh quotient with respect to x. The numerator is the sum over all edges of the squares of differences accross the edges. This gives 1 1/ d) 2 for the edges attached to u and v, and 1/d for the edges attached to Nu) and Nv) but not to u or v, for a total of 2d1 1/ d) 2 + 2dd 1)/d = 2 On the other hand, the denominator is 4, so we find If we use instead the vector we find d 2 d d 1) x T Lx x T x = d d. 1 if i = u, 1/ d if i Nu), yi) = 1 if i = v, 1/ d if i Nv), 0 otherwise, y T Ly y T y = d + d. ) = 2 2d 2 d This is not so impressive, as it merely tells us that ɛ 1/ d, which we already knew. But, we can improve this argument by pushing it further. We do this by modifying it in two ways. First, we extend x to neighborhoods of neighboods of u and v. Second, instead of basing the construction at vertices u and v, we base it at two edges. This way, each vertex has d 1 edges to those that are farther away from the centers of the construction. The following theorem is attributed to A. Nilli [Nil91], but we suspect it was written by N. Alon. Theorem Let G be a d-regular graph containing two edges u 0, u 1 ) and v 0, v 1 ) that are at distance at least 2k + 2. Then and λ 2 d 2 d d 1 1, k + 1 λ n d + 2 d 1 2 d 1 1. k + 1 ).
6 Lecture 10: October 2, Proof. Define the following neighborboods. U 0 = {u 0, u 1 } U i = NU i 1 ) j<i U j, for 0 < i k, V 0 = {v 0, v 1 } V i = NV i 1 ) j<i V j, for 0 < i k. That is, U i consists of exactly those vertices at distance i from U 0. Note that there are no edges between any vertices in any U i and any V j. Our test vector for λ 2 will be given by x a) = We choose β so that x is orthogonal to 1. 1 d 1) i/2 β d 1) i/2 for a U i for a V i 0 otherwise. We now find that the Rayleigh quotient of x with respect to L is at most U i d 1) 1 1/ d 1 d 1) i/2 ) 2 + Uk d 1) k+1 ) + β 2 V i d 1) k U i d 1) i + β 2 k V i d 1) i 1 1/ d 1 d 1) i/2 ) 2 + Vk d 1) k+1 ) By my favorite inequality, it suffices to prove upper bounds on the left and right-hand terms in these fractions. So, consider ) 2 k 1 U i d 1) 1 1/ d 1 d 1) + Uk d 1) k+1 i/2 k U. i d 1) i For now, let s focus on the numerator, ) 2 1 1/ d 1 d 1) d 1) i/2 + U k d 1)d 1) k = = = k d 1) i d 2 d 1) + U k d 1) d 1) k d 1) i d 2 d 1) + U k d 1) k d 2 d 1) + U k d 1) k 2 d 1 1) d 1) i d 2 d 1) + U k d 1) k 2 d 1 1). To upper bound the Rayleigh quotient, we observe that the left-most of these terms contributes k d 1) i d 2 d 1) k U i d 1) i = d 2 d 1.
7 Lecture 10: October 2, To bound the impact of the remaining term, note that So, we have Thus, the last term contributes at most to the Rayleigh quotient. U k d 1) k 2 d 1 1), U k d 1) k i. U k d 1) k 1 k d 1 k + 1 k d 1) i. To prove the lower bound on λ n, we apply the same argument to the test function 1) i 1 for a U d 1) i/2 i 1) i β for a V ya) = d 1) i/2 i 0 otherwise Research Question We still don t know how well general irregular, weighted graphs can approximate the complete graph. If G = V, E, w) has dn/2 edges, one can still show that it cannot be an ɛ-approximation of the complete graph for ɛ < 1/ d see [BSS09]). I conjecture that in fact one cannot have ɛ < 2 d 1/d, the same bound for the regular case. Any bound close to this would be publishable. References [AC88] Noga Alon and Fan Chung. Explicit construction of linear sized tolerant networks. Discrete Mathematics, 72:15 19, [BMS93] Richard Beigel, Grigorii Margulis, and Daniel A. Spielman. Fault diagnosis in a small constant number of parallel testing rounds. In SPAA 93: Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, pages 21 29, New York, NY, USA, ACM.
8 Lecture 10: October 2, [BSS09] Joshua D. Batson, Daniel A. Spielman, and Nikhil Srivastava. Twice-Ramanujan sparsifiers. In Proceedings of the 41st Annual ACM Symposium on Theory of computing, pages , [LPS88] A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 83): , [Mar88] G. A. Margulis. Explicit group theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. Problems of Information Transmission, 241):39 46, July [Nil91] A. Nilli. On the second eigenvalue of a graph. Discrete Math, 91: , [Tan84] R. Michael Tanner. Explicit concentrators from generalized n-gons. SIAM Journal Alg. Disc. Meth., 53): , September 1984.
PSRGs via Random Walks on Graphs
Spectral Graph Theory Lecture 11 PSRGs via Random Walks on Graphs Daniel A. Spielman October 3, 2012 11.1 Overview There has been a lot of work on the design of Pseudo-Random Number Generators (PSRGs)
More informationAlgebraic Constructions of Graphs
Spectral Graph Theory Lecture 15 Algebraic Constructions of Graphs Daniel A. Spielman October 17, 2012 15.1 Overview In this lecture, I will explain how to make graphs from linear error-correcting codes.
More informationarxiv: v1 [math.co] 24 Sep 2017
k-planar Crossing Number of Random Graphs and Random Regular Graphs arxiv:1709.08136v1 [math.co] 24 Sep 2017 John Asplund 1 Thao Do 2 Arran Hamm 3 László Székely 4 Libby Taylor 5 Zhiyu Wang 4 Abstract
More informationOblivious and Adaptive Strategies for the Majority and Plurality Problems
Oblivious and Adaptive Strategies for the Majority and Plurality Problems Fan Chung 1, Ron Graham 1, Jia Mao 1, and Andrew Yao 2 1 Department of Computer Science and Engineering, University of California,
More informationGraph Sparsification III: Ramanujan Graphs, Lifts, and Interlacing Families
Graph Sparsification III: Ramanujan Graphs, Lifts, and Interlacing Families Nikhil Srivastava Microsoft Research India Simons Institute, August 27, 2014 The Last Two Lectures Lecture 1. Every weighted
More informationConstant Arboricity Spectral Sparsifiers
Constant Arboricity Spectral Sparsifiers arxiv:1808.0566v1 [cs.ds] 16 Aug 018 Timothy Chu oogle timchu@google.com Jakub W. Pachocki Carnegie Mellon University pachocki@cs.cmu.edu August 0, 018 Abstract
More informationEigenvalues, random walks and Ramanujan graphs
Eigenvalues, random walks and Ramanujan graphs David Ellis 1 The Expander Mixing lemma We have seen that a bounded-degree graph is a good edge-expander if and only if if has large spectral gap If G = (V,
More informationAn Elementary Construction of Constant-Degree Expanders
An Elementary Construction of Constant-Degree Expanders Noga Alon Oded Schwartz Asaf Shapira Abstract We describe a short and easy to analyze construction of constant-degree expanders. The construction
More informationThe Simplest Construction of Expanders
Spectral Graph Theory Lecture 14 The Simplest Construction of Expanders Daniel A. Spielman October 16, 2009 14.1 Overview I am going to present the simplest construction of expanders that I have been able
More informationSparsification of Graphs and Matrices
Sparsification of Graphs and Matrices Daniel A. Spielman Yale University joint work with Joshua Batson (MIT) Nikhil Srivastava (MSR) Shang- Hua Teng (USC) HUJI, May 21, 2014 Objective of Sparsification:
More informationConductance, the Normalized Laplacian, and Cheeger s Inequality
Spectral Graph Theory Lecture 6 Conductance, the Normalized Laplacian, and Cheeger s Inequality Daniel A. Spielman September 17, 2012 6.1 About these notes These notes are not necessarily an accurate representation
More information1 Matrix notation and preliminaries from spectral graph theory
Graph clustering (or community detection or graph partitioning) is one of the most studied problems in network analysis. One reason for this is that there are a variety of ways to define a cluster or community.
More informationLaplacian Matrices of Graphs: Spectral and Electrical Theory
Laplacian Matrices of Graphs: Spectral and Electrical Theory Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale University Toronto, Sep. 28, 2 Outline Introduction to graphs
More informationRandom Lifts of Graphs
27th Brazilian Math Colloquium, July 09 Plan of this talk A brief introduction to the probabilistic method. A quick review of expander graphs and their spectrum. Lifts, random lifts and their properties.
More informationSpecral Graph Theory and its Applications September 7, Lecture 2 L G1,2 = 1 1.
Specral Graph Theory and its Applications September 7, 2004 Lecturer: Daniel A. Spielman Lecture 2 2.1 The Laplacian, again We ll begin by redefining the Laplacian. First, let G 1,2 be the graph on two
More informationarxiv:cs.it/ v1 25 Jun 2004
ON EXPANDERS GRAPHS: PARAMETERS AND APPLICATIONS H. L. JANWA AND A. K. LAL arxiv:cs.it/0406048 v1 5 Jun 004 Abstract. We give a new lower bound on the expansion coefficient of an edge-vertex graph of a
More informationLecture 17: Cheeger s Inequality and the Sparsest Cut Problem
Recent Advances in Approximation Algorithms Spring 2015 Lecture 17: Cheeger s Inequality and the Sparsest Cut Problem Lecturer: Shayan Oveis Gharan June 1st Disclaimer: These notes have not been subjected
More informationSparsification by Effective Resistance Sampling
Spectral raph Theory Lecture 17 Sparsification by Effective Resistance Sampling Daniel A. Spielman November 2, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened
More informationRamanujan Graphs of Every Size
Spectral Graph Theory Lecture 24 Ramanujan Graphs of Every Size Daniel A. Spielman December 2, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class. The
More informationLecture 12: Introduction to Spectral Graph Theory, Cheeger s inequality
CSE 521: Design and Analysis of Algorithms I Spring 2016 Lecture 12: Introduction to Spectral Graph Theory, Cheeger s inequality Lecturer: Shayan Oveis Gharan May 4th Scribe: Gabriel Cadamuro Disclaimer:
More informationRegular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs Noga Alon Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Peter Hamburger Department of Mathematical
More informationPhysical Metaphors for Graphs
Graphs and Networks Lecture 3 Physical Metaphors for Graphs Daniel A. Spielman October 9, 203 3. Overview We will examine physical metaphors for graphs. We begin with a spring model and then discuss resistor
More informationU.C. Berkeley CS270: Algorithms Lecture 21 Professor Vazirani and Professor Rao Last revised. Lecture 21
U.C. Berkeley CS270: Algorithms Lecture 21 Professor Vazirani and Professor Rao Scribe: Anupam Last revised Lecture 21 1 Laplacian systems in nearly linear time Building upon the ideas introduced in the
More informationStanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013
Stanford University CS366: Graph Partitioning and Expanders Handout 13 Luca Trevisan March 4, 2013 Lecture 13 In which we construct a family of expander graphs. The problem of constructing expander graphs
More information1 Adjacency matrix and eigenvalues
CSC 5170: Theory of Computational Complexity Lecture 7 The Chinese University of Hong Kong 1 March 2010 Our objective of study today is the random walk algorithm for deciding if two vertices in an undirected
More information[10] N. Kahale. Expander Graphs. PhD thesis, Massachusetts Institute of Technology, September
[10] N. Kahale. Expander Graphs. PhD thesis, Massachusetts Institute of Technology, September 1993. MIT Laboratory for Computer Science, Technical Report MIT/LCS/TR-591. [11] N. Kahale. Eigenvalues and
More informationSpectral Partitiong in a Stochastic Block Model
Spectral Graph Theory Lecture 21 Spectral Partitiong in a Stochastic Block Model Daniel A. Spielman November 16, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened
More informationSpectral Graph Theory Lecture 2. The Laplacian. Daniel A. Spielman September 4, x T M x. ψ i = arg min
Spectral Graph Theory Lecture 2 The Laplacian Daniel A. Spielman September 4, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class. The notes written before
More informationHamilton Cycles in Digraphs of Unitary Matrices
Hamilton Cycles in Digraphs of Unitary Matrices G. Gutin A. Rafiey S. Severini A. Yeo Abstract A set S V is called an q + -set (q -set, respectively) if S has at least two vertices and, for every u S,
More informationEigenvalues of graphs
Eigenvalues of graphs F. R. K. Chung University of Pennsylvania Philadelphia PA 19104 September 11, 1996 1 Introduction The study of eigenvalues of graphs has a long history. From the early days, representation
More informationto be more efficient on enormous scale, in a stream, or in distributed settings.
16 Matrix Sketching The singular value decomposition (SVD) can be interpreted as finding the most dominant directions in an (n d) matrix A (or n points in R d ). Typically n > d. It is typically easy to
More informationSpectral Graph Theory Lecture 3. Fundamental Graphs. Daniel A. Spielman September 5, 2018
Spectral Graph Theory Lecture 3 Fundamental Graphs Daniel A. Spielman September 5, 2018 3.1 Overview We will bound and derive the eigenvalues of the Laplacian matrices of some fundamental graphs, including
More informationTOPOLOGY FOR GLOBAL AVERAGE CONSENSUS. Soummya Kar and José M. F. Moura
TOPOLOGY FOR GLOBAL AVERAGE CONSENSUS Soummya Kar and José M. F. Moura Department of Electrical and Computer Engineering Carnegie Mellon University, Pittsburgh, PA 15213 USA (e-mail:{moura}@ece.cmu.edu)
More informationPacking and Covering Dense Graphs
Packing and Covering Dense Graphs Noga Alon Yair Caro Raphael Yuster Abstract Let d be a positive integer. A graph G is called d-divisible if d divides the degree of each vertex of G. G is called nowhere
More information1 Review: symmetric matrices, their eigenvalues and eigenvectors
Cornell University, Fall 2012 Lecture notes on spectral methods in algorithm design CS 6820: Algorithms Studying the eigenvalues and eigenvectors of matrices has powerful consequences for at least three
More informationQuasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets
Quasi-randomness is determined by the distribution of copies of a fixed graph in equicardinal large sets Raphael Yuster 1 Department of Mathematics, University of Haifa, Haifa, Israel raphy@math.haifa.ac.il
More informationAn Algorithmist s Toolkit September 15, Lecture 2
18.409 An Algorithmist s Toolkit September 15, 007 Lecture Lecturer: Jonathan Kelner Scribe: Mergen Nachin 009 1 Administrative Details Signup online for scribing. Review of Lecture 1 All of the following
More informationBipartite Ramanujan Graphs of Every Degree
Spectral Graph Theory Lecture 26 Bipartite Ramanujan Graphs of Every Degree Daniel A. Spielman December 9, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationEffective Resistance and Schur Complements
Spectral Graph Theory Lecture 8 Effective Resistance and Schur Complements Daniel A Spielman September 28, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in
More informationPSRGs via Random Walks on Graphs
Spectral Graph Theory Lecture 9 PSRGs via Random Walks on Graphs Daniel A. Spielman September 30, 2009 9.1 Overview There has been a lot of work on the design of Pseudo-Random Number Generators (PSRGs)
More information, Department of Mathematics, Cambridge University, Cambridge CB2 ST, United Kingdom. , Bell Communications Research, Morfistown, New Jersey
SIAM J. Disc. MATH. Vol. 1, No. 3, August 1988 (C) 1988 Society for Industrial and Applied Mathematics 006 THE DIAMETER OF A CYCLE PLUS A RANDOM MATCHING* B. BOLLOB.S- AND F. R. K. CHUNG Abstract. How
More informationEigenvalue comparisons in graph theory
Eigenvalue comparisons in graph theory Gregory T. Quenell July 1994 1 Introduction A standard technique for estimating the eigenvalues of the Laplacian on a compact Riemannian manifold M with bounded curvature
More informationPersonal PageRank and Spilling Paint
Graphs and Networks Lecture 11 Personal PageRank and Spilling Paint Daniel A. Spielman October 7, 2010 11.1 Overview These lecture notes are not complete. The paint spilling metaphor is due to Berkhin
More informationCycle lengths in sparse graphs
Cycle lengths in sparse graphs Benny Sudakov Jacques Verstraëte Abstract Let C(G) denote the set of lengths of cycles in a graph G. In the first part of this paper, we study the minimum possible value
More information8.1 Concentration inequality for Gaussian random matrix (cont d)
MGMT 69: Topics in High-dimensional Data Analysis Falll 26 Lecture 8: Spectral clustering and Laplacian matrices Lecturer: Jiaming Xu Scribe: Hyun-Ju Oh and Taotao He, October 4, 26 Outline Concentration
More informationGraphs, Vectors, and Matrices Daniel A. Spielman Yale University. AMS Josiah Willard Gibbs Lecture January 6, 2016
Graphs, Vectors, and Matrices Daniel A. Spielman Yale University AMS Josiah Willard Gibbs Lecture January 6, 2016 From Applied to Pure Mathematics Algebraic and Spectral Graph Theory Sparsification: approximating
More informationConvergence of Random Walks and Conductance - Draft
Graphs and Networks Lecture 0 Convergence of Random Walks and Conductance - Draft Daniel A. Spielman October, 03 0. Overview I present a bound on the rate of convergence of random walks in graphs that
More informationLecture 13: Spectral Graph Theory
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 13: Spectral Graph Theory Lecturer: Shayan Oveis Gharan 11/14/18 Disclaimer: These notes have not been subjected to the usual scrutiny reserved
More informationMatching Polynomials of Graphs
Spectral Graph Theory Lecture 25 Matching Polynomials of Graphs Daniel A Spielman December 7, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class The notes
More informationTesting the Expansion of a Graph
Testing the Expansion of a Graph Asaf Nachmias Asaf Shapira Abstract We study the problem of testing the expansion of graphs with bounded degree d in sublinear time. A graph is said to be an α- expander
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A. Spielman September 19, 2018 7.1 Overview In today s lecture we will justify some of the behavior we observed when using eigenvectors
More informationEXPANDERS, EIGENVALUES, AND ALL THAT
EXPANDERS, EIGENVALUES, AND ALL THAT NATI LINIAL Hebrew University Jerusalem, Israel http://www.cs.huji.ac.il/ nati/ Visiting Microsoft Research. See also my lecture notes from a joint class with Avi Wigderson.
More information4 - Moore Graphs. Jacques Verstraëte
4 - Moore Graphs Jacques erstraëte jacques@ucsd.edu 1 Introduction In these notes, we focus on the problem determining the maximum number of edges in an n-vertex graph that does not contain short cycles.
More informationRamanujan Graphs, Ramanujan Complexes and Zeta Functions. Emerging Applications of Finite Fields Linz, Dec. 13, 2013
Ramanujan Graphs, Ramanujan Complexes and Zeta Functions Emerging Applications of Finite Fields Linz, Dec. 13, 2013 Winnie Li Pennsylvania State University, U.S.A. and National Center for Theoretical Sciences,
More information2 Introduction to Network Theory
Introduction to Network Theory In this section we will introduce some popular families of networks and will investigate how well they allow to support routing.. Basic network topologies The most basic
More informationx #{ p=prime p x }, as x logx
1 The Riemann zeta function for Re(s) > 1 ζ s -s ( ) -1 2 duality between primes & complex zeros of zeta using Hadamard product over zeros prime number theorem x #{ p=prime p x }, as x logx statistics
More informationLecture 6: Expander Codes
CS369E: Expanders May 2 & 9, 2005 Lecturer: Prahladh Harsha Lecture 6: Expander Codes Scribe: Hovav Shacham In today s lecture, we will discuss the application of expander graphs to error-correcting codes.
More informationLecture Introduction. 2 Brief Recap of Lecture 10. CS-621 Theory Gems October 24, 2012
CS-62 Theory Gems October 24, 202 Lecture Lecturer: Aleksander Mądry Scribes: Carsten Moldenhauer and Robin Scheibler Introduction In Lecture 0, we introduced a fundamental object of spectral graph theory:
More informationVERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS
VERTEX DEGREE SUMS FOR PERFECT MATCHINGS IN 3-UNIFORM HYPERGRAPHS YI ZHANG, YI ZHAO, AND MEI LU Abstract. We determine the minimum degree sum of two adjacent vertices that ensures a perfect matching in
More informationFault tolerant graphs, perfect hash functions and disjoint paths
Fault tolerant graphs, perfect hash functions and disjoint paths M. Ajtai N. Alon J. Bruck R. Cypher C.T. Ho M. Naor E. Szemerédi Abstract Given a graph G on n nodes we say that a graph T on n + k nodes
More informationLecture 7. 1 Normalized Adjacency and Laplacian Matrices
ORIE 6334 Spectral Graph Theory September 3, 206 Lecturer: David P. Williamson Lecture 7 Scribe: Sam Gutekunst In this lecture, we introduce normalized adjacency and Laplacian matrices. We state and begin
More informationTesting Expansion in Bounded-Degree Graphs
Testing Expansion in Bounded-Degree Graphs Artur Czumaj Department of Computer Science University of Warwick Coventry CV4 7AL, UK czumaj@dcs.warwick.ac.uk Christian Sohler Department of Computer Science
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationAlgorithms, Graph Theory, and Linear Equa9ons in Laplacians. Daniel A. Spielman Yale University
Algorithms, Graph Theory, and Linear Equa9ons in Laplacians Daniel A. Spielman Yale University Shang- Hua Teng Carter Fussell TPS David Harbater UPenn Pavel Cur9s Todd Knoblock CTY Serge Lang 1927-2005
More informationCutting Graphs, Personal PageRank and Spilling Paint
Graphs and Networks Lecture 11 Cutting Graphs, Personal PageRank and Spilling Paint Daniel A. Spielman October 3, 2013 11.1 Disclaimer These notes are not necessarily an accurate representation of what
More informationWalks, Springs, and Resistor Networks
Spectral Graph Theory Lecture 12 Walks, Springs, and Resistor Networks Daniel A. Spielman October 8, 2018 12.1 Overview In this lecture we will see how the analysis of random walks, spring networks, and
More informationHolistic Convergence of Random Walks
Graphs and Networks Lecture 1 Holistic Convergence of Random Walks Daniel A. Spielman October 5, 1 1.1 Overview There are two things that I want to do in this lecture. The first is the holistic proof of
More informationThe Matching Polytope: General graphs
8.433 Combinatorial Optimization The Matching Polytope: General graphs September 8 Lecturer: Santosh Vempala A matching M corresponds to a vector x M = (0, 0,,, 0...0) where x M e is iff e M and 0 if e
More informationRandom Cayley Graphs and Expanders
Random Cayley Graphs and Expanders Noga Alon Yuval Roichman February 22, 2002 Abstract For every 1 > δ > 0 there exists a c = c(δ) > 0 such that for every group G of order n, and for a set S of c(δ) log
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A Spielman September 9, 202 7 About these notes These notes are not necessarily an accurate representation of what happened in
More informationAffine extractors over large fields with exponential error
Affine extractors over large fields with exponential error Jean Bourgain Zeev Dvir Ethan Leeman Abstract We describe a construction of explicit affine extractors over large finite fields with exponentially
More informationFitting a Graph to Vector Data. Samuel I. Daitch (Yale) Jonathan A. Kelner (MIT) Daniel A. Spielman (Yale)
Fitting a Graph to Vector Data Samuel I. Daitch (Yale) Jonathan A. Kelner (MIT) Daniel A. Spielman (Yale) Machine Learning Summer School, June 2009 Given a collection of vectors x 1,..., x n IR d 1,, n
More informationCS294: PCP and Hardness of Approximation January 25, Notes for Lecture 3
U.C. Berkeley Handout N3 CS294: PCP and Hardness of Approximation January 25, 2006 Professor Luca Trevisan Scribe: Luca Trevisan Notes for Lecture 3 These notes are based on my survey paper [6]. L.T. Some
More informationIntroducing the Laplacian
Introducing the Laplacian Prepared by: Steven Butler October 3, 005 A look ahead to weighted edges To this point we have looked at random walks where at each vertex we have equal probability of moving
More informationLecture 1. 1 if (i, j) E a i,j = 0 otherwise, l i,j = d i if i = j, and
Specral Graph Theory and its Applications September 2, 24 Lecturer: Daniel A. Spielman Lecture. A quick introduction First of all, please call me Dan. If such informality makes you uncomfortable, you can
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg) of edge-disjoint
More informationInduced subgraphs with many repeated degrees
Induced subgraphs with many repeated degrees Yair Caro Raphael Yuster arxiv:1811.071v1 [math.co] 17 Nov 018 Abstract Erdős, Fajtlowicz and Staton asked for the least integer f(k such that every graph with
More informationUniversal Traversal Sequences for Expander Graphs
Universal Traversal Sequences for Expander Graphs Shlomo Hoory Avi Wigderson Hebrew University, Jerusalem Keywords: Universal traversal sequence, space-bounded computation, explicit construction, connectivity,
More informationLecture 6: Random Walks versus Independent Sampling
Spectral Graph Theory and Applications WS 011/01 Lecture 6: Random Walks versus Independent Sampling Lecturer: Thomas Sauerwald & He Sun For many problems it is necessary to draw samples from some distribution
More informationWhat is the Riemann Hypothesis for Zeta Functions of Irregular Graphs?
What is the Riemann Hypothesis for Zeta Functions of Irregular Graphs? UCLA, IPAM February, 2008 Joint work with H. M. Stark, M. D. Horton, etc. What is an expander graph X? X finite connected (irregular)
More informationOn a problem of Bermond and Bollobás
On a problem of Bermond and Bollobás arxiv:1803.07501v1 [math.co] 20 Mar 2018 Slobodan Filipovski University of Primorska, Koper, Slovenia slobodan.filipovski@famnit.upr.si Robert Jajcay Comenius University,
More informationarxiv: v1 [math.co] 1 Oct 2013
Tiling in bipartite graphs with asymmetric minimum degrees Andrzej Czygrinow and Louis DeBiasio November 9, 018 arxiv:1310.0481v1 [math.co] 1 Oct 013 Abstract The problem of determining the optimal minimum
More informationORIE 6334 Spectral Graph Theory November 8, Lecture 22
ORIE 6334 Spectral Graph Theory November 8, 206 Lecture 22 Lecturer: David P. Williamson Scribe: Shijin Rajakrishnan Recap In the previous lectures, we explored the problem of finding spectral sparsifiers
More informationGraph Partitioning Algorithms and Laplacian Eigenvalues
Graph Partitioning Algorithms and Laplacian Eigenvalues Luca Trevisan Stanford Based on work with Tsz Chiu Kwok, Lap Chi Lau, James Lee, Yin Tat Lee, and Shayan Oveis Gharan spectral graph theory Use linear
More informationarxiv: v2 [math.co] 19 Jun 2018
arxiv:1705.06268v2 [math.co] 19 Jun 2018 On the Nonexistence of Some Generalized Folkman Numbers Xiaodong Xu Guangxi Academy of Sciences Nanning 530007, P.R. China xxdmaths@sina.com Meilian Liang School
More informationPCA with random noise. Van Ha Vu. Department of Mathematics Yale University
PCA with random noise Van Ha Vu Department of Mathematics Yale University An important problem that appears in various areas of applied mathematics (in particular statistics, computer science and numerical
More informationLecture 1: Riemann, Dedekind, Selberg, and Ihara Zetas
Lecture 1: Riemann, Dedekind, Selberg, and Ihara Zetas Audrey Terras U.C.S.D. 2008 more details can be found in my webpage: www.math.ucsd.edu /~aterras/ newbook.pdf First the Riemann Zeta 1 The Riemann
More informationOn the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy Ishay Haviv Oded Regev Amnon Ta-Shma March 12, 2007 Abstract In 1991, Papadimitriou and Yannakakis gave a reduction
More informationInduced subgraphs of prescribed size
Induced subgraphs of prescribed size Noga Alon Michael Krivelevich Benny Sudakov Abstract A subgraph of a graph G is called trivial if it is either a clique or an independent set. Let q(g denote the maximum
More informationSpectra of Adjacency and Laplacian Matrices
Spectra of Adjacency and Laplacian Matrices Definition: University of Alicante (Spain) Matrix Computing (subject 3168 Degree in Maths) 30 hours (theory)) + 15 hours (practical assignment) Contents 1. Spectra
More informationGRAPHS WITH LARGE GIRTH AND LARGE CHROMATIC NUMBER
GRAPHS WITH LARGE GIRTH AND LARGE CHROMATIC NUMBER CHEUK TO TSUI Abstract. This paper investigates graphs that have large girth and large chromatic number. We first give a construction of a family of graphs
More informationBell Communications Research, 435 South Street, Morristown, New Jersey 07960, USA
Discrete Mathematics 72 (1988) 15-19 North-Holland 15 EXPLICIT CONSTRUCTION TOLERANT NETWORKS OF LINEAR SIZED N. ALON* Department of Mathematics, Snckkr FacuIty of Exact Sciences, Te[ Aviv University,
More informationOn the concentration of eigenvalues of random symmetric matrices
On the concentration of eigenvalues of random symmetric matrices Noga Alon Michael Krivelevich Van H. Vu April 23, 2012 Abstract It is shown that for every 1 s n, the probability that the s-th largest
More informationMax k-cut and the smallest eigenvalue
Max -cut and the smallest eigenvalue V. Niiforov arxiv:1604.0088v [math.co] 11 Apr 016 Abstract Let G be a graph of order n and size m, and let mc (G) be the maximum size of a -cut of G. It is shown that
More informationRings, Paths, and Paley Graphs
Spectral Graph Theory Lecture 5 Rings, Paths, and Paley Graphs Daniel A. Spielman September 12, 2012 5.1 About these notes These notes are not necessarily an accurate representation of what happened in
More informationEight theorems in extremal spectral graph theory
Eight theorems in extremal spectral graph theory Michael Tait Carnegie Mellon University mtait@cmu.edu ICOMAS 2018 May 11, 2018 Michael Tait (CMU) May 11, 2018 1 / 1 Questions in extremal graph theory
More informationUniversity of Chicago Autumn 2003 CS Markov Chain Monte Carlo Methods. Lecture 7: November 11, 2003 Estimating the permanent Eric Vigoda
University of Chicago Autumn 2003 CS37101-1 Markov Chain Monte Carlo Methods Lecture 7: November 11, 2003 Estimating the permanent Eric Vigoda We refer the reader to Jerrum s book [1] for the analysis
More informationGraph Sparsifiers. Smaller graph that (approximately) preserves the values of some set of graph parameters. Graph Sparsification
Graph Sparsifiers Smaller graph that (approximately) preserves the values of some set of graph parameters Graph Sparsifiers Spanners Emulators Small stretch spanning trees Vertex sparsifiers Spectral sparsifiers
More informationThe Minesweeper game: Percolation and Complexity
The Minesweeper game: Percolation and Complexity Elchanan Mossel Hebrew University of Jerusalem and Microsoft Research March 15, 2002 Abstract We study a model motivated by the minesweeper game In this
More information