Spectral and Electrical Graph Theory. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
|
|
- Gregory Douglas
- 6 years ago
- Views:
Transcription
1 Spectral and Electrical Graph Theory Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
2 Outline Spectral Graph Theory: Understand graphs through eigenvectors and eigenvalues of associated matrices. Electrical Graph Theory: Understand graphs through metaphor of resistor networks. Heuristics Algorithms Theorems Intuition
3 Spectral Graph Theory Graph G =(V,E) Matrix A rows and cols indexed by V Eigenvalues Eigenvectors Av = λv v : V IR
4 Spectral Graph Theory Graph G =(V,E) 1! 2! 3! 4! Matrix A rows and cols indexed by V A(i, j) =1if(i, j) E Eigenvalues Eigenvectors Av = λv v : V IR ! 2! 3! 4!
5 Example: Graph Drawing by the Laplacian
6 Example: Graph Drawing by the Laplacian
7 Example: Graph Drawing by the Laplacian L(i, j) = 1 if (i, j) E deg(i) if i = j 0 otherwise 8 9
8 Example: Graph Drawing by the Laplacian L(i, j) = 1 if (i, j) E deg(i) if i = j 0 otherwise 8 9 Eigenvalues 0, 1.53, 1.53, 3, 3.76, 3.76, 5, 5.7, 5.7 Let x, y IR V span eigenspace of eigenvalue 1.53
9 Example: Graph Drawing by the Laplacian Plot vertex i at (x(i),y(i)) Draw edges as straight lines
10 Laplacian: natural quadratic form on graphs where D is diagonal matrix of degrees 1! 2! 3! 4!
11 Laplacian: fast facts zero is an eigenvalue Connected if and only if λ 2 > 0 Fiedler ( 73) called algebraic connectivity of a graph The further from 0, the more connected.
12 Drawing a graph in the line (Hall 70) map minimize trivial solution: Solution So, require x 1, x =1 Atkins, Boman, Hendrickson 97: Gives correct drawing for graphs like
13 Courant-Fischer definition of eigvals/vecs
14 Courant-Fischer definition of eigvals/vecs (here )
15 Courant-Fischer definition of eigvals/vecs (here )
16 Drawing a graph in the plane (Hall 70) map minimize
17 Drawing a graph in the plane (Hall 70) map minimize trivial solution: So, require x 1, x 2 1
18 Drawing a graph in the plane (Hall 70) map minimize trivial solution: So, require x 1, x 2 1 diagonal solution: So, require x 1 x 2 Solution up to rotation
19 A Graph
20 Drawing of the graph using v 2, v 3 Plot vertex i at
21
22 The Airfoil Graph, original coordinates
23 The Airfoil Graph, spectral coordinates
24 The Airfoil Graph, spectral coordinates
25 Spectral drawing of Streets in Rome
26 Spectral drawing of Erdos graph: edge between co-authors of papers
27 Dodecahedron Best embedded by first three eigenvectors
28 Intuition: Graphs as Spring Networks edges - > ideal linear springs weights - > spring constants (k) Physics: when stretched to length x, force is kx poten9al energy is kx 2 /2 Nail down some ver9ces, let rest se;le
29 Intuition: Graphs as Spring Networks Nail down some ver9ces, let rest se;le i Physics: minimizes total poten9al energy (i,j) E x(i) (x(i) x(j)) 2 = x T Lx subject to boundary constraints (nails)
30 Intuition: Graphs as Spring Networks Nail down some ver9ces, let rest se;le x(i) i Physics: energy minimized when non- fixed ver9ces are averages of neighbors x(i) = 1 d i (i,j) E x(j)
31 Tutte s Theorem 63 If nail down a face of a planar 3- connected graph, get a planar embedding!
32 Spectral graph drawing: Tutte justification Condition for eigenvector Gives λ small says x(i) = 1 d i λ x(i) (i,j) E x(j) for all near average of neighbors i
33 Spectral graph drawing: Tutte justification Condition for eigenvector Gives λ small says x(i) = 1 d i λ x(i) (i,j) E x(j) for all i near average of neighbors For planar graphs: λ 2 8d/n [S-Teng 96] λ 3 O(d/n) [Kelner-Lee-Price-Teng 09]
34 Small eigenvalues are not enough Plot vertex i at (v 3 (i),v 4 (i))
35 Graph Partitioning
36 Spectral Graph Partitioning [Donath-Hoffman 72, Barnes 82, Hagen-Kahng 92] S = {i : v 2 (i) t} for some t
37 Measuring Partition Quality: Conductance S Φ(S) = # edges leaving S sum of degrees in S For deg(s) deg(v )/2
38 Spectral Image Segmentation (Shi-Malik 00)
39 Spectral Image Segmentation (Shi-Malik 00)
40 Spectral Image Segmentation (Shi-Malik 00)
41 Spectral Image Segmentation (Shi-Malik 00)
42 Spectral Image Segmentation (Shi-Malik 00) edge weight
43 The second eigenvector
44 Second eigenvector cut
45 Third Eigenvector
46 Fourth Eigenvector
47 Cheeger s Inequality [Cheeger 70] [Alon-Milman 85, Jerrum-Sinclair 89, Diaconis-Stroock 91] For Normalized Laplacian: L = D 1/2 LD 1/2 λ 2 /2 min S Φ(S) 2λ 2 And, is a spectral cut for which Φ(S) 2λ 2
48 McSherry s Analysis of Spectral Partitioning p p q S T Divide vertices into S and T Place edges at random with Pr [S-S edge] = p Pr [T-T edge] = p Pr [S-T edge] = q q<p
49 McSherry s Analysis of Spectral Partitioning p q p S T E [ A ]= p q } S q p } T S T
50 McSherry s Analysis of Spectral Partitioning E [ A ]= p q } S q p } T S T v 2 (E [ L ]) is positive const on S, negative const on T View A as perturbation of E [ A ] and L as perturbation of E [ L ]
51 McSherry s Analysis of Spectral Partitioning v 2 (E [ L ]) is negative const on S, positive const on T View A as perturbation of E [ A ] and L as perturbation of E [ L ] Random Matrix Theory [Füredi-Komlós 81, Vu 07] With high probability L E [ L ] small Perturbation Theory for Eigenvectors implies v 2 (L) v 2 (E [ L ])
52 Spectral graph coloring from high eigenvectors Embedding of dodecahedron by 19 th and 20 th eigvecs.
53 Spectral graph coloring from high eigenvectors p p p p p Coloring 3-colorable random graphs [Alon-Kahale 97]
54 Independent Sets S is independent if are no edges between vertices in S
55 Independent Sets S is independent if are no edges between vertices in S Hoffman s Bound: if every vertex has degree d S n 1 d λ n
56 Networks of Resistors Ohm s laws gives i = v/r In general, i = L G v with w (u,v) =1/r (u,v) Minimize dissipated energy v T L G v 1V 0V
57 Networks of Resistors Ohm s laws gives i = v/r In general, i = L G v with w a,b =1/r a,b Minimize dissipated energy By solving Laplacian v T L G v 0.5V 0.5V 1V 0V 0.375V 0.625V
58 Electrical Graph Theory Considers flows in graphs Allows comparisons of graphs, and embedding of one graph within another. Relative Spectral Graph Theory
59 Effective Resistance Resistance of entire network, measured between a and b. Ohm s law: r = v/i R eff (a, b) = 1/(current flow at one volt) 1V a b 0.53V 0.27V 0V 0.2V 0.33V
60 Effective Resistance Resistance of entire network, measured between a and b. Ohm s law: r = v/i R eff (a, b) = 1/(current flow at one volt) = voltage difference to flow 1 unit
61 Effective Resistance R eff (a, b) = voltage difference to flow 1 unit Vector of one unit flow has 1 at a, -1 at b, 0 elsewhere i a,b = e a e b Voltages required by this flow are given by v a,b = L 1 G i a,b
62 Effective Resistance R eff (a, b) = voltage difference of unit flow Voltages required by unit flow are given by Voltage difference is v a,b = L 1 G i a,b v a,b (a) v a,b (b) =(e a e b ) T v a,b =(e a e b ) T L + G (e a e b )
63 Effective Resistance Distance Effective resistance is a distance Lower when are more short paths Equivalent to commute time distance: expected time for a random walk from a to reach b and then return to a. See Doyle and Snell, Random Walks and Electrical Networks
64 Relative Spectral Graph Theory For two connected graphs G and H with the same vertex set, consider L G L 1 H work orthogonal to nullspace or use pseudoinverse Allows one to compare G and H
65 Relative Spectral Graph Theory For two connected graphs G and H, consider L G L 1 H = I n 1 if and only if G = H
66 Relative Spectral Graph Theory For two connected graphs G and H, consider L G L 1 H I n 1 if and only if G H
67 Relative Spectral Graph Theory For two connected graphs G and H, consider 1 1+ eigs(l GL 1 H ) 1+ if and only if for all x IR V 1 1+ xt L G x x T L H x 1+
68 Relative Spectral Graph Theory In particular, for x T L G x = 1 1+ xt L G x x T L H x S (a,b) E x(a) = 1 a S 0 a S 0 (x(a) x(b)) 2 = E(S, V S)
69 Relative Spectral Graph Theory 1 1+ xt L G x x T L H x 1+ For all S V 1 1+ E G(S, V S) E H (S, V S) 1+
70 Expanders Approximate Complete Graphs Expanders: d-regular graphs on n vertices high conductance random walks mix quickly weak expanders: eigenvalues bounded from 0 strong expanders: all eigenvalues near d
71 Expanders Approximate Complete Graphs For G the complete graph on n vertices. all non- zero eigenvalues of L G are n. For, x 1 x =1 x T L G x = n
72 Expanders Approximate Complete Graphs For G the complete graph on n vertices. all non- zero eigenvalues of L G are n. For, x 1 x =1 x T L G x = n For H a d- regular strong expander, all non- zero eigenvalues of L H are close to d. For, x 1 x =1 x T L H x [λ 2, λ n ] d
73 Expanders Approximate Complete Graphs For G the complete graph on n vertices. all non- zero eigenvalues of L G are n. For, x 1 x =1 x T L G x = n For H a d- regular strong expander, all non- zero eigenvalues of L H are close to d. For, x 1 n d H x =1 x T L H x d is a good approximation of G
74 Sparse approximations of every graph 1 1+ xt L G x x T L H x 1+ For every G, there is an H with (2 + ) 2 n/ 2 edges [Batson-S-Srivastava] Can find an H with in nearly-linear time. O(n log n/ 2 ) edges [S-Srivastava]
75 Sparsification by Random Sampling [S- Srivastava] Include edge (u, v) with probability p u,v w u,v R eff (u, v) If include edge, give weight w u,v /p u,v Analyze by Rudelson s concentration of random sums of rank-1 matrices
76 Approximating a graph by a tree Alon, Karp, Peleg, West 91: measure the stretch
77 Approximating a graph by a tree Alon, Karp, Peleg, West 91: measure the stretch T
78 Approximating a graph by a tree Alon, Karp, Peleg, West 91: measure the stretch i 3 j T
79 Approximating a graph by a tree Alon, Karp, Peleg, West 91: measure the stretch T
80 Low-Stretch Spanning Trees For every G there is a T with stretch T (G) m 1+o(1) (Alon- Karp- Peleg- West 91) where m = E stretch T (G) O(m log m log 2 log m) (Elkin- Emek- S- Teng 04, Abraham- Bartal- Neiman 08) Conjecture: stretch T (G) m log 2 m
81 Algebraic characterization of stretch [S- Woo 09] stretch T (G) = Trace[L G L 1 T ]
82 Algebraic characterization of stretch [S- Woo 09] stretch T (G) = Trace[L G L 1 T ] Resistances in series sum In trees, resistance is distance. 1 1 v : 0 1 a 2 2 T b
83 Algebraic characterization of stretch [S- Woo 09] stretch T (G) = Trace[L G L 1 x T L G x = (x(a) x(b)) 2 (a,b) E = ((e a e b ) T x) 2 (a,b) E = x T (e a e b )(e a e b ) T x (a,b) E = x T ( (e a e b )(e a e b ) T )x (a,b) E T ]
84 Algebraic characterization of stretch [S- Woo 09] stretch T (G) = Trace[L G L 1 T ] Trace[L G L 1 T ]= (a,b) E = (a,b) E = (a,b) E Trace[(e a e b )(e a e b ) T L 1 T ] Trace[(e a e b ) T L 1 T (e a e b )] (e a e b ) T L 1 T (e a e b )
85 Algebraic characterization of stretch [S- Woo 09] (a,b) E stretch T (G) = Trace[L G L 1 T ] (e a e b ) T L 1 T (e a e b )= (a,b) E = (a,b) E R eff (a, b) stretch T (a, b)
86 Notable Things I ve left out Behavior under graph transformations Graph Isomorphism Random Walks and Diffusion PageRank and Hits Matrix-Tree Theorem Special Graphs (Cayley, Strongly-Regular, etc.) Diameter bounds Colin de Verdière invariant Discretizations of Manifolds
87 The next two talks Tomorrow: Solving equations in Laplacians in nearly-linear time. Preconditioning Sparsification Low-Stretch Spanning Trees Local graph partitioning
88 The next two talks Thursday: Existence of sparse approximations. A theorem in linear algebra and some of its connections.
Laplacian 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 informationSpectral Graph Theory and its Applications. Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity
Spectral Graph Theory and its Applications Daniel A. Spielman Dept. of Computer Science Program in Applied Mathematics Yale Unviersity Outline Adjacency matrix and Laplacian Intuition, spectral graph drawing
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 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 informationAlgorithms, Graph Theory, and the Solu7on of Laplacian Linear Equa7ons. Daniel A. Spielman Yale University
Algorithms, Graph Theory, and the Solu7on of Laplacian Linear Equa7ons Daniel A. Spielman Yale University Rutgers, Dec 6, 2011 Outline Linear Systems in Laplacian Matrices What? Why? Classic ways to solve
More informationGraph Sparsification I : Effective Resistance Sampling
Graph Sparsification I : Effective Resistance Sampling Nikhil Srivastava Microsoft Research India Simons Institute, August 26 2014 Graphs G G=(V,E,w) undirected V = n w: E R + Sparsification Approximate
More informationAlgorithmic Primitives for Network Analysis: Through the Lens of the Laplacian Paradigm
Algorithmic Primitives for Network Analysis: Through the Lens of the Laplacian Paradigm Shang-Hua Teng Computer Science, Viterbi School of Engineering USC Massive Data and Massive Graphs 500 billions web
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 informationAn Algorithmist s Toolkit September 10, Lecture 1
18.409 An Algorithmist s Toolkit September 10, 2009 Lecture 1 Lecturer: Jonathan Kelner Scribe: Jesse Geneson (2009) 1 Overview The class s goals, requirements, and policies were introduced, and topics
More informationLecture 24: Element-wise Sampling of Graphs and Linear Equation Solving. 22 Element-wise Sampling of Graphs and Linear Equation Solving
Stat260/CS294: Randomized Algorithms for Matrices and Data Lecture 24-12/02/2013 Lecture 24: Element-wise Sampling of Graphs and Linear Equation Solving Lecturer: Michael Mahoney Scribe: Michael Mahoney
More informationData Analysis and Manifold Learning Lecture 7: Spectral Clustering
Data Analysis and Manifold Learning Lecture 7: Spectral Clustering Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline of Lecture 7 What is spectral
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 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 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 informationGraph Partitioning Using Random Walks
Graph Partitioning Using Random Walks A Convex Optimization Perspective Lorenzo Orecchia Computer Science Why Spectral Algorithms for Graph Problems in practice? Simple to implement Can exploit very efficient
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 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 informationLecture: Modeling graphs with electrical networks
Stat260/CS294: Spectral Graph Methods Lecture 16-03/17/2015 Lecture: Modeling graphs with electrical networks Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.
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 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 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 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 informationDiffusion and random walks on graphs
Diffusion and random walks on graphs Leonid E. Zhukov School of Data Analysis and Artificial Intelligence Department of Computer Science National Research University Higher School of Economics Structural
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
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 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 informationFast Linear Solvers for Laplacian Systems UCSD Research Exam
Fast Linear olvers for Laplacian ystems UCD Research Exam Olivia impson Fall 2013 olving a system of linear equations is a fundamental problem that has deep implications in the computational sciences,
More informationDissertation Defense
Clustering Algorithms for Random and Pseudo-random Structures Dissertation Defense Pradipta Mitra 1 1 Department of Computer Science Yale University April 23, 2008 Mitra (Yale University) Dissertation
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 informationORIE 6334 Spectral Graph Theory October 13, Lecture 15
ORIE 6334 Spectral Graph heory October 3, 206 Lecture 5 Lecturer: David P. Williamson Scribe: Shijin Rajakrishnan Iterative Methods We have seen in the previous lectures that given an electrical network,
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 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 informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
More informationTowards Practically-Efficient Spectral Sparsification of Graphs. Zhuo Feng
Design Automation Group Towards Practically-Efficient Spectral Sparsification of Graphs Zhuo Feng Acknowledgements: PhD students: Xueqian Zhao, Lengfei Han, Zhiqiang Zhao, Yongyu Wang NSF CCF CAREER grant
More informationAlgorithms, Graph Theory, and Linear Equations in Laplacian Matrices
Proceedings of the International Congress of Mathematicians Hyderabad, India, 200 Algorithms, Graph Theory, and Linear Equations in Laplacian Matrices Daniel A. Spielman Abstract The Laplacian matrices
More informationData Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings
Data Analysis and Manifold Learning Lecture 3: Graphs, Graph Matrices, and Graph Embeddings Radu Horaud INRIA Grenoble Rhone-Alpes, France Radu.Horaud@inrialpes.fr http://perception.inrialpes.fr/ Outline
More informationFour graph partitioning algorithms. Fan Chung University of California, San Diego
Four graph partitioning algorithms Fan Chung University of California, San Diego History of graph partitioning NP-hard approximation algorithms Spectral method, Fiedler 73, Folklore Multicommunity flow,
More informationBruce Hendrickson Discrete Algorithms & Math Dept. Sandia National Labs Albuquerque, New Mexico Also, CS Department, UNM
Latent Semantic Analysis and Fiedler Retrieval Bruce Hendrickson Discrete Algorithms & Math Dept. Sandia National Labs Albuquerque, New Mexico Also, CS Department, UNM Informatics & Linear Algebra Eigenvectors
More informationRandom Walks on Graphs. One Concrete Example of a random walk Motivation applications
Random Walks on Graphs Outline One Concrete Example of a random walk Motivation applications shuffling cards universal traverse sequence self stabilizing token management scheme random sampling enumeration
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 informationGraph Sparsifiers: A Survey
Graph Sparsifiers: A Survey Nick Harvey UBC Based on work by: Batson, Benczur, de Carli Silva, Fung, Hariharan, Harvey, Karger, Panigrahi, Sato, Spielman, Srivastava and Teng Approximating Dense Objects
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 informationLecture 10. Lecturer: Aleksander Mądry Scribes: Mani Bastani Parizi and Christos Kalaitzis
CS-621 Theory Gems October 18, 2012 Lecture 10 Lecturer: Aleksander Mądry Scribes: Mani Bastani Parizi and Christos Kalaitzis 1 Introduction In this lecture, we will see how one can use random walks to
More informationGraphs in Machine Learning
Graphs in Machine Learning Michal Valko INRIA Lille - Nord Europe, France Partially based on material by: Ulrike von Luxburg, Gary Miller, Doyle & Schnell, Daniel Spielman January 27, 2015 MVA 2014/2015
More informationMATH 567: Mathematical Techniques in Data Science Clustering II
This lecture is based on U. von Luxburg, A Tutorial on Spectral Clustering, Statistics and Computing, 17 (4), 2007. MATH 567: Mathematical Techniques in Data Science Clustering II Dominique Guillot Departments
More informationSpectral Graph Theory
Spectral Graph Theory Aaron Mishtal April 27, 2016 1 / 36 Outline Overview Linear Algebra Primer History Theory Applications Open Problems Homework Problems References 2 / 36 Outline Overview Linear Algebra
More informationSpace-Variant Computer Vision: A Graph Theoretic Approach
p.1/65 Space-Variant Computer Vision: A Graph Theoretic Approach Leo Grady Cognitive and Neural Systems Boston University p.2/65 Outline of talk Space-variant vision - Why and how of graph theory Anisotropic
More informationIntroduction. 1.1 First Things. 1.2 Introduction. 1.3 Mechanics. Spectral Graph Theory Lecture 1. Daniel A. Spielman August 29, 2018
Spectral Graph Theory Lecture 1 Introduction Daniel A. Spielman August 29, 2018 1.1 First Things 1. Please call me Dan. If such informality makes you uncomfortable, you can try Professor Dan. If that fails,
More informationIntroduction to Spectral Graph Theory and Graph Clustering
Introduction to Spectral Graph Theory and Graph Clustering Chengming Jiang ECS 231 Spring 2016 University of California, Davis 1 / 40 Motivation Image partitioning in computer vision 2 / 40 Motivation
More informationSpectral Clustering on Handwritten Digits Database
University of Maryland-College Park Advance Scientific Computing I,II Spectral Clustering on Handwritten Digits Database Author: Danielle Middlebrooks Dmiddle1@math.umd.edu Second year AMSC Student Advisor:
More informationSpectral clustering. Two ideal clusters, with two points each. Spectral clustering algorithms
A simple example Two ideal clusters, with two points each Spectral clustering Lecture 2 Spectral clustering algorithms 4 2 3 A = Ideally permuted Ideal affinities 2 Indicator vectors Each cluster has an
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 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 informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
More informationHW2 - Due 01/30. Each answer must be mathematically justified. Don t forget your name.
HW2 - Due 0/30 Each answer must be mathematically justified. Don t forget your name. Problem. Use the row reduction algorithm to find the inverse of the matrix 0 0, 2 3 5 if it exists. Double check your
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 informationVectorized Laplacians for dealing with high-dimensional data sets
Vectorized Laplacians for dealing with high-dimensional data sets Fan Chung Graham University of California, San Diego The Power Grid Graph drawn by Derrick Bezanson 2010 Vectorized Laplacians ----- Graph
More informationLecture: Local Spectral Methods (3 of 4) 20 An optimization perspective on local spectral methods
Stat260/CS294: Spectral Graph Methods Lecture 20-04/07/205 Lecture: Local Spectral Methods (3 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationLecture 14: Random Walks, Local Graph Clustering, Linear Programming
CSE 521: Design and Analysis of Algorithms I Winter 2017 Lecture 14: Random Walks, Local Graph Clustering, Linear Programming Lecturer: Shayan Oveis Gharan 3/01/17 Scribe: Laura Vonessen Disclaimer: These
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 information(K2) For sum of the potential differences around any cycle is equal to zero. r uv resistance of {u, v}. [In other words, V ir.]
Lectures 16-17: Random walks on graphs CSE 525, Winter 2015 Instructor: James R. Lee 1 Random walks Let G V, E) be an undirected graph. The random walk on G is a Markov chain on V that, at each time step,
More informationA NOTE ON THE POINCARÉ AND CHEEGER INEQUALITIES FOR SIMPLE RANDOM WALK ON A CONNECTED GRAPH. John Pike
A NOTE ON THE POINCARÉ AND CHEEGER INEQUALITIES FOR SIMPLE RANDOM WALK ON A CONNECTED GRAPH John Pike Department of Mathematics University of Southern California jpike@usc.edu Abstract. In 1991, Persi
More informationLaplacian and Random Walks on Graphs
Laplacian and Random Walks on Graphs Linyuan Lu University of South Carolina Selected Topics on Spectral Graph Theory (II) Nankai University, Tianjin, May 22, 2014 Five talks Selected Topics on Spectral
More informationCertifying the Global Optimality of Graph Cuts via Semidefinite Programming: A Theoretic Guarantee for Spectral Clustering
Certifying the Global Optimality of Graph Cuts via Semidefinite Programming: A Theoretic Guarantee for Spectral Clustering Shuyang Ling Courant Institute of Mathematical Sciences, NYU Aug 13, 2018 Joint
More informationCS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory
CS168: The Modern Algorithmic Toolbox Lectures #11 and #12: Spectral Graph Theory Tim Roughgarden & Gregory Valiant May 2, 2016 Spectral graph theory is the powerful and beautiful theory that arises from
More informationEmbedding and Spectrum of Graphs
Embedding and Spectrum of Graphs Ali Shokoufandeh, Department of Computer Science, Drexel University Overview Approximation Algorithms Geometry of Graphs and Graphs Encoding the Geometry Spectral Graph
More informationContents. Preface for the Instructor. Preface for the Student. xvii. Acknowledgments. 1 Vector Spaces 1 1.A R n and C n 2
Contents Preface for the Instructor xi Preface for the Student xv Acknowledgments xvii 1 Vector Spaces 1 1.A R n and C n 2 Complex Numbers 2 Lists 5 F n 6 Digression on Fields 10 Exercises 1.A 11 1.B Definition
More informationPowerful tool for sampling from complicated distributions. Many use Markov chains to model events that arise in nature.
Markov Chains Markov chains: 2SAT: Powerful tool for sampling from complicated distributions rely only on local moves to explore state space. Many use Markov chains to model events that arise in nature.
More informationSpectral Analysis of Random Walks
Graphs and Networks Lecture 9 Spectral Analysis of Random Walks Daniel A. Spielman September 26, 2013 9.1 Disclaimer These notes are not necessarily an accurate representation of what happened in class.
More informationLaplacian eigenvalues and optimality: II. The Laplacian of a graph. R. A. Bailey and Peter Cameron
Laplacian eigenvalues and optimality: II. The Laplacian of a graph R. A. Bailey and Peter Cameron London Taught Course Centre, June 2012 The Laplacian of a graph This lecture will be about the Laplacian
More informationMATH 567: Mathematical Techniques in Data Science Clustering II
Spectral clustering: overview MATH 567: Mathematical Techniques in Data Science Clustering II Dominique uillot Departments of Mathematical Sciences University of Delaware Overview of spectral clustering:
More informationLecture: Local Spectral Methods (2 of 4) 19 Computing spectral ranking with the push procedure
Stat260/CS294: Spectral Graph Methods Lecture 19-04/02/2015 Lecture: Local Spectral Methods (2 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationLinear Algebra II Lecture 13
Linear Algebra II Lecture 13 Xi Chen 1 1 University of Alberta November 14, 2014 Outline 1 2 If v is an eigenvector of T : V V corresponding to λ, then v is an eigenvector of T m corresponding to λ m since
More informationBeyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian
Beyond Scalar Affinities for Network Analysis or Vector Diffusion Maps and the Connection Laplacian Amit Singer Princeton University Department of Mathematics and Program in Applied and Computational Mathematics
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 informationClustering Algorithms for Random and Pseudo-random Structures
Abstract Clustering Algorithms for Random and Pseudo-random Structures Pradipta Mitra 2008 Partitioning of a set objects into a number of clusters according to a suitable distance metric is one of the
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationAlgebraic Representation of Networks
Algebraic Representation of Networks 0 1 2 1 1 0 0 1 2 0 0 1 1 1 1 1 Hiroki Sayama sayama@binghamton.edu Describing networks with matrices (1) Adjacency matrix A matrix with rows and columns labeled by
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 informationMath 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank
Math 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank David Glickenstein November 3, 4 Representing graphs as matrices It will sometimes be useful to represent graphs
More informationLaplacian Eigenmaps for Dimensionality Reduction and Data Representation
Introduction and Data Representation Mikhail Belkin & Partha Niyogi Department of Electrical Engieering University of Minnesota Mar 21, 2017 1/22 Outline Introduction 1 Introduction 2 3 4 Connections to
More informationAlgorithm Design Using Spectral Graph Theory
Algorithm Design Using Spectral Graph Theory Richard Peng CMU-CS-13-121 August 2013 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Thesis Committee: Gary L. Miller, Chair Guy
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 informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More information7. Symmetric Matrices and Quadratic Forms
Linear Algebra 7. Symmetric Matrices and Quadratic Forms CSIE NCU 1 7. Symmetric Matrices and Quadratic Forms 7.1 Diagonalization of symmetric matrices 2 7.2 Quadratic forms.. 9 7.4 The singular value
More informationSpectral Clustering. Zitao Liu
Spectral Clustering Zitao Liu Agenda Brief Clustering Review Similarity Graph Graph Laplacian Spectral Clustering Algorithm Graph Cut Point of View Random Walk Point of View Perturbation Theory Point of
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 informationNetwork Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec
Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec Jiezhong Qiu Tsinghua University February 21, 2018 Joint work with Yuxiao Dong (MSR), Hao Ma (MSR), Jian Li (IIIS,
More informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationConsistency of Spectral Clustering
Max Planck Institut für biologische Kybernetik Max Planck Institute for Biological Cybernetics Technical Report No. TR-34 Consistency of Spectral Clustering Ulrike von Luxburg, Mikhail Belkin 2, Olivier
More informationNetworks and Their Spectra
Networks and Their Spectra Victor Amelkin University of California, Santa Barbara Department of Computer Science victor@cs.ucsb.edu December 4, 2017 1 / 18 Introduction Networks (= graphs) are everywhere.
More informationPart I: Preliminary Results. Pak K. Chan, Martine Schlag and Jason Zien. Computer Engineering Board of Studies. University of California, Santa Cruz
Spectral K-Way Ratio-Cut Partitioning Part I: Preliminary Results Pak K. Chan, Martine Schlag and Jason Zien Computer Engineering Board of Studies University of California, Santa Cruz May, 99 Abstract
More informationSpectral Theory of Unsigned and Signed Graphs Applications to Graph Clustering. Some Slides
Spectral Theory of Unsigned and Signed Graphs Applications to Graph Clustering Some Slides Jean Gallier Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104,
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 informationUsing Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems
Using Laplacian Eigenvalues and Eigenvectors in the Analysis of Frequency Assignment Problems Jan van den Heuvel and Snežana Pejić Department of Mathematics London School of Economics Houghton Street,
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
More informationGraph Embeddings and Laplacian Eigenvalues
NASA/CR-1998-0845 ICASE Report No. 98-3 Graph Embeddings and Laplacian Eigenvalues Stephen Guattery ICASE, Hampton, Virginia Gary L. Miller Carnegie Mellon University, Pittsburgh, Pennsylvania Institute
More informationRandom Matrices: Invertibility, Structure, and Applications
Random Matrices: Invertibility, Structure, and Applications Roman Vershynin University of Michigan Colloquium, October 11, 2011 Roman Vershynin (University of Michigan) Random Matrices Colloquium 1 / 37
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 informationVector Spaces and Linear Transformations
Vector Spaces and Linear Transformations Wei Shi, Jinan University 2017.11.1 1 / 18 Definition (Field) A field F = {F, +, } is an algebraic structure formed by a set F, and closed under binary operations
More information