A Tale of Two Eigenvalue Problems
|
|
- Jasmine Boone
- 5 years ago
- Views:
Transcription
1 A Tale of Two Eigenvalue Problems Music of the Microspheres + Hearing the Shape of a Graph David Bindel Department of Computer Science Cornell University CAM Visit Talk, 28 Feb 214 Brown bag 1 / 22
2 The Computational Science & Engineering Picture Application Analysis Computation MEMS Smart grids Networks Linear algebra Approximation theory Symmetry + structure HPC / cloud Simulators Solvers Brown bag 2 / 22
3 Music of the Spheres! On the beats in the vibrations of a revolving cylinder or bell by G. H. Bryan, 189 Brown bag 3 / 22
4 Audio Track Audio Track The Beat Goes On Brown bag 4 / 22
5 Foucault in Solid State Brown bag 5 / 22
6 A General Picture =q 1 (t) +q 2 (t) q 2 q 2 q 1 q 1 Brown bag 6 / 22
7 A Small Application Northrup-Grumman HRG (developed c early 199s) Brown bag 7 / 22
8 A Smaller Application (Cornell) Brown bag 8 / 22
9 Uncritical FEA: Fail! Brown bag 9 / 22
10 The Perturbation Picture Perturbations split degenerate modes: Coriolis forces (good) Imperfect fab (bad, but physical) Discretization error (non-physical) Brown bag 1 / 22
11 Fun with Fourier Perfect geometry: Fourier expand modal displacements Imperfect geometry: Fourier expand geometric distortion, too! R 7! R + (R) B B Brown bag 11 / 22
12 Typical Fabrication Imperfections p= p=1 p=2 p=4 Imperfections are small and structured. Use for: Fast quantitative information via structured FEA Qualitative information for engineers in early design Fourier analysis, group theory, eigenvalue perturbations, FEA,... Brown bag 12 / 22
13 Analyzing Imperfect Rings Brown bag 13 / 22
14 Analyzing Imperfect Rings q 2 q 2 q 2 q 1 q 1 q 1 q 2 q 2 q 2 q 1 q 1 q 1 Brown bag 14 / 22
15 Read All About It! Yilmaz and Bindel Effects of Imperfections on Solid-Wave Gyroscope Dynamics Proceedings of IEEE Sensors 213, Nov 3 6. Thanks to DARPA MRIG + Sunil Bhave and Laura Fegely. Brown bag 15 / 22
16 Can One Hear the Shape of a Drum? r 2 u = u on u Brown bag 16 / 22
17 What Do You Hear? A B S Size of bottlenecks (Cheeger inequality) 2 Volume (Weyl law) asymptotic distribution of n Brown bag 17 / 22
18 Can One Hear the Shape of a Graph? From eigenvalues of adjacency, Laplacian, normalized Laplacian? Brown bag 18 / 22
19 What Do You Hear? Size of separators (Cheeger inequality) What about analogue of Weyl s law? Brown bag 19 / 22
20 What Do You Hear? What information hides in the eigenvalue distribution? Discretizations of Laplacian: something like Weyl s law Sparse random graphs: Wigner semicircular distribution Real networks: less well understood Computing all eigenvalues seems expensive! But estimating distributions is much less expensive Steal a method (KPM) from the physics literature Brown bag 2 / 22
21 Exploring Spectral Densities (with David Gleich) Consider spectrum of normalized Laplacian (random walk matrix) Approximate via KPM and compare to full eigencomputation Things we know Eigenvalues in [ 1, 1]; nonsymmetric in general Stability: change d edges, have j d apple ˆj apple j+d kth moment = probability of return after k-step random walk Eigenvalue cluster near 1 well-separated clusters Eigenvalue cluster near triangles connected by one node What else can we hear? Brown bag 21 / 22
22 x x What Do You Hear? Brown bag 22 / 22
23 Erdos Brown bag 22 / 22
24 Internet topology Brown bag 22 / 22
25 Marvel characters Brown bag 22 / 22
26 Marvel comics Brown bag 22 / 22
27 PGP Brown bag 22 / 22
28 Yeast Brown bag 22 / 22
29 Enron s (SNAP) Brown bag 22 / 22
30 Reuters911 (Pajek) Brown bag 22 / 22
31 US power grid (Pajek) Brown bag 22 / 22
32 DBLP 21 (LAW) 6 x N = , nnz = 16154, 8 s (1 moments, 1 probes) Brown bag 22 / 22
33 Hollywood 29 (LAW) 4 x N = , nnz = , 293 s (1 moments, 1 probes) Brown bag 22 / 22
Understanding graphs through spectral densities
Understanding graphs through spectral densities David Bindel Department of Computer Science Cornell University SCAN seminar, 29 Feb 216 SCAN 1 / 1 Can One Hear the Shape of a Drum? 2 u = λu on Ω, u = on
More informationUnderstanding Graphs through Spectral Densities
Understanding Graphs through Spectral Densities 3 Jun 218 Department of Computer Science Cornell University 1 Acknowledgements Thanks Kun Dong (Cornell CAM), along with Anna Yesypenko, Moteleolu Onabajo,
More informationUnderstanding Graphs through Spectral Densities
Understanding Graphs through Spectral Densities 13 Jul 218 Department of Computer Science Cornell University 1 Acknowledgements Thanks Kun Dong (Cornell CAM), along with Anna Yesypenko, Moteleolu Onabajo,
More informationFacebook Friends! and Matrix Functions
Facebook Friends! and Matrix Functions! Graduate Research Day Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Network Analysis Use linear algebra
More informationComputer Aided Design of Micro-Electro-Mechanical Systems
Computer Aided Design of Micro-Electro-Mechanical Systems From Eigenvalues to Devices David Bindel Department of Computer Science Cornell University Fudan University, 13 Dec 2012 (Cornell University) Fudan
More informationLecture: Local Spectral Methods (1 of 4)
Stat260/CS294: Spectral Graph Methods Lecture 18-03/31/2015 Lecture: Local Spectral Methods (1 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide
More informationNonlinear Eigenvalue Problems: Theory and Applications
Nonlinear Eigenvalue Problems: Theory and Applications David Bindel 1 Department of Computer Science Cornell University 12 January 217 1 Joint work with Amanda Hood Berkeley 1 / 37 The Computational Science
More informationModel Reduction for Edge-Weighted Personalized PageRank
Model Reduction for Edge-Weighted Personalized PageRank D. Bindel 11 Apr 2016 D. Bindel Purdue 11 Apr 2016 1 / 33 The Computational Science & Engineering Picture Application Analysis Computation MEMS Smart
More informationApplications of Matrix Structure
Applications of Matrix Structure D. Bindel Department of Computer Science Cornell University 15 Sep 2009 (Cornell University) Brown Bag 1 / 32 The Computational Science Picture Ingredients: Application
More informationStructure-preserving model reduction for MEMS
Structure-preserving model reduction for MEMS David Bindel Department of Computer Science Cornell University SIAM CSE Meeting, 1 Mar 2011 Collaborators Sunil Bhave Emmanuel Quévy Zhaojun Bai Tsuyoshi Koyama
More informationComputational Science and Engineering
Computational Science and Engineering Application modeling Analysis ρü = σ Ax = b Ax = λx Algorithms and software HiQLab, Matscat,... Model reduction methods Structured linear solvers Today: Two applications
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 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 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 informationGrade 7/8 Math Circles November 27 & 28 &
Faculty of Mathematics Waterloo, Ontario N2L 3G1 Centre for Education in Mathematics and Computing Grade 7/8 Math Circles November 27 & 28 & 29 2018 Symmetry and Music Introduction We ve done a lot of
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 informationLocally-biased analytics
Locally-biased analytics You have BIG data and want to analyze a small part of it: Solution 1: Cut out small part and use traditional methods Challenge: cutting out may be difficult a priori Solution 2:
More informationLecture 12 : Graph Laplacians and Cheeger s Inequality
CPS290: Algorithmic Foundations of Data Science March 7, 2017 Lecture 12 : Graph Laplacians and Cheeger s Inequality Lecturer: Kamesh Munagala Scribe: Kamesh Munagala Graph Laplacian Maybe the most beautiful
More informationFrequency, Vibration, and Fourier
Lecture 22: Frequency, Vibration, and Fourier Computer Graphics CMU 15-462/15-662, Fall 2015 Last time: Numerical Linear Algebra Graphics via linear systems of equations Why linear? Have to solve BIG problems
More informationStrong localization in seeded PageRank vectors
Strong localization in seeded PageRank vectors https://github.com/nassarhuda/pprlocal David F. Gleich" Huda Nassar Computer Science" Computer Science " supported by NSF CAREER CCF-1149756, " IIS-1422918,
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 informationSpectral Analysis of Directed Complex Networks. Tetsuro Murai
MASTER THESIS Spectral Analysis of Directed Complex Networks Tetsuro Murai Department of Physics, Graduate School of Science and Engineering, Aoyama Gakuin University Supervisors: Naomichi Hatano and Kenn
More informationEugene Wigner [4]: in the natural sciences, Communications in Pure and Applied Mathematics, XIII, (1960), 1 14.
Introduction Eugene Wigner [4]: The miracle of the appropriateness of the language of mathematics for the formulation of the laws of physics is a wonderful gift which we neither understand nor deserve.
More informationA Nearly Sublinear Approximation to exp{p}e i for Large Sparse Matrices from Social Networks
A Nearly Sublinear Approximation to exp{p}e i for Large Sparse Matrices from Social Networks Kyle Kloster and David F. Gleich Purdue University December 14, 2013 Supported by NSF CAREER 1149756-CCF Kyle
More informationExtreme eigenvalues of Erdős-Rényi random graphs
Extreme eigenvalues of Erdős-Rényi random graphs Florent Benaych-Georges j.w.w. Charles Bordenave and Antti Knowles MAP5, Université Paris Descartes May 18, 2018 IPAM UCLA Inhomogeneous Erdős-Rényi random
More informationParameter-Dependent Eigencomputations and MEMS Applications
Parameter-Dependent Eigencomputations and MEMS Applications David Bindel UC Berkeley, CS Division Parameter-Dependent Eigencomputations and MEMS Applications p.1/36 Outline Some applications Mathematical
More informationEE Technion, Spring then. can be isometrically embedded into can be realized as a Gram matrix of rank, Properties:
5/25/200 2 A mathematical exercise Assume points with the metric are isometrically embeddable into Then, there exists a canonical form such that for all Spectral methods We can also write Alexander & Michael
More informationHyperbolic metric spaces and their applications to large complex real world networks II
Hyperbolic metric spaces Hyperbolic metric spaces and their applications to large complex real world networks II Gabriel H. Tucci Bell Laboratories Alcatel-Lucent May 17, 2010 Tucci Hyperbolic metric spaces
More informationEigenvalue Problems Computation and Applications
Eigenvalue ProblemsComputation and Applications p. 1/36 Eigenvalue Problems Computation and Applications Che-Rung Lee cherung@gmail.com National Tsing Hua University Eigenvalue ProblemsComputation and
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 informationSVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices)
Chapter 14 SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Today we continue the topic of low-dimensional approximation to datasets and matrices. Last time we saw the singular
More informationResonant MEMS, Eigenvalues, and Numerical Pondering
Resonant MEMS, Eigenvalues, and Numerical Pondering David Bindel UC Berkeley, CS Division Resonant MEMS, Eigenvalues,and Numerical Pondering p.1/27 Introduction I always pass on good advice. It is the
More informationHeat Kernel Based Community Detection
Heat Kernel Based Community Detection Joint with David F. Gleich, (Purdue), supported by" NSF CAREER 1149756-CCF Kyle Kloster! Purdue University! Local Community Detection Given seed(s) S in G, find a
More information16 SUPERPOSITION & STANDING WAVES
Chapter 6 SUPERPOSITION & STANDING WAVES 6. Superposition of waves Principle of superposition: When two or more waves overlap, the resultant wave is the algebraic sum of the individual waves. Illustration:
More informationScalable Algorithms for Complex Networks
Scalable Algorithms for Complex Networks Tuhin Sahai United Technologies Research Center University of Connecticut Outline / Acknowledgements Decentralized Clustering Alberto Speranzon (UTRC) Andrzej Banaszuk
More informationSUPPLEMENTARY MATERIALS TO THE PAPER: ON THE LIMITING BEHAVIOR OF PARAMETER-DEPENDENT NETWORK CENTRALITY MEASURES
SUPPLEMENTARY MATERIALS TO THE PAPER: ON THE LIMITING BEHAVIOR OF PARAMETER-DEPENDENT NETWORK CENTRALITY MEASURES MICHELE BENZI AND CHRISTINE KLYMKO Abstract This document contains details of numerical
More informationThe non-backtracking operator
The non-backtracking operator Florent Krzakala LPS, Ecole Normale Supérieure in collaboration with Paris: L. Zdeborova, A. Saade Rome: A. Decelle Würzburg: J. Reichardt Santa Fe: C. Moore, P. Zhang Berkeley:
More informationLab 8: Measuring Graph Centrality - PageRank. Monday, November 5 CompSci 531, Fall 2018
Lab 8: Measuring Graph Centrality - PageRank Monday, November 5 CompSci 531, Fall 2018 Outline Measuring Graph Centrality: Motivation Random Walks, Markov Chains, and Stationarity Distributions Google
More informationWed Feb The vector spaces 2, 3, n. Announcements: Warm-up Exercise:
Wed Feb 2 4-42 The vector spaces 2, 3, n Announcements: Warm-up Exercise: 4-42 The vector space m and its subspaces; concepts related to "linear combinations of vectors" Geometric interpretation of vectors
More informationNew Directions in Computer Science
New Directions in Computer Science John Hopcroft Cornell University Time of change The information age is a revolution that is changing all aspects of our lives. Those individuals, institutions, and nations
More informationOn sums of eigenvalues, and what they reveal about graphs and manifolds
On sums of eigenvalues, and what they reveal about graphs and manifolds Evans Harrell Georgia Tech Université F. Rabelais www.math.gatech.edu/~harrell Tours le 30 janvier, 2014 Copyright 2014 by Evans
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 informationInvariant Subspace Perturbations or: How I Learned to Stop Worrying and Love Eigenvectors
Invariant Subspace Perturbations or: How I Learned to Stop Worrying and Love Eigenvectors Alexander Cloninger Norbert Wiener Center Department of Mathematics University of Maryland, College Park http://www.norbertwiener.umd.edu
More informationTHE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING
THE HIDDEN CONVEXITY OF SPECTRAL CLUSTERING Luis Rademacher, Ohio State University, Computer Science and Engineering. Joint work with Mikhail Belkin and James Voss This talk A new approach to multi-way
More informationDesigning Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Homework 6
EECS 16A Designing Information Devices and Systems I Spring 2017 Babak Ayazifar, Vladimir Stojanovic Homework 6 This homework is due March 6, 2017, at 23:59. Self-grades are due March 9, 2017, at 23:59.
More informationCommunities, Spectral Clustering, and Random Walks
Communities, Spectral Clustering, and Random Walks David Bindel Department of Computer Science Cornell University 26 Sep 2011 20 21 19 16 22 28 17 18 29 26 27 30 23 1 25 5 8 24 2 4 14 3 9 13 15 11 10 12
More informationECS231: Spectral Partitioning. Based on Berkeley s CS267 lecture on graph partition
ECS231: Spectral Partitioning Based on Berkeley s CS267 lecture on graph partition 1 Definition of graph partitioning Given a graph G = (N, E, W N, W E ) N = nodes (or vertices), E = edges W N = node weights
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 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 informationEIGHTH GRADE TRANSITION MATH GLEs
GLEs and CCSS to be taught in and 13-14 EIGHTH GRADE TRANSITION MATH GLEs Math, Grade 8, and 13-14 Curriculum and Assessment Summary 1 GLEs and CCSS to be taught in and 13-14 GLE content to be taught and
More informationQuick Review for BC Calculus
Quick Review for BC Calculus When you see the words This is what you should do 1) Find equation of the line tangent to at. 2) Find equation of the normal line to at (. 3) Given, where is increasing Set,
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 informationClustering. SVD and NMF
Clustering with the SVD and NMF Amy Langville Mathematics Department College of Charleston Dagstuhl 2/14/2007 Outline Fielder Method Extended Fielder Method and SVD Clustering with SVD vs. NMF Demos with
More informationEE C245 / ME C218 INTRODUCTION TO MEMS DESIGN FALL 2009 PROBLEM SET #7. Due (at 7 p.m.): Thursday, Dec. 10, 2009, in the EE C245 HW box in 240 Cory.
Issued: Thursday, Nov. 24, 2009 PROBLEM SET #7 Due (at 7 p.m.): Thursday, Dec. 10, 2009, in the EE C245 HW box in 240 Cory. 1. Gyroscopes are inertial sensors that measure rotation rate, which is an extremely
More informationORIE 6334 Spectral Graph Theory September 22, Lecture 11
ORIE 6334 Spectral Graph Theory September, 06 Lecturer: David P. Williamson Lecture Scribe: Pu Yang In today s lecture we will focus on discrete time random walks on undirected graphs. Specifically, we
More informationLee County Schools Curriculum Road Map Pre-Algebra
Quarter 1 Rational Numbers, Repeating Decimals, Terminating Decimals 1 Numbers & Operations 2 Radicals & Integer Exponents 1 8.NS.1 8.NS.1 8.NS.2 8.NS.1 8.NS.2 8.EE.1 Know that numbers that are not rational
More informationResearch Science Institute (RSI)
Research Science Institute (RSI) Mathematics Section s of Final Research Papers M.I.T. Summer 2016 1 Pawel Burzyński Estimating Sums of Independent Random Variables under the direction of Chiheon Kim The
More informationGraph Detection and Estimation Theory
Introduction Detection Estimation Graph Detection and Estimation Theory (and algorithms, and applications) Patrick J. Wolfe Statistics and Information Sciences Laboratory (SISL) School of Engineering and
More informationInderjit Dhillon The University of Texas at Austin
Inderjit Dhillon The University of Texas at Austin ( Universidad Carlos III de Madrid; 15 th June, 2012) (Based on joint work with J. Brickell, S. Sra, J. Tropp) Introduction 2 / 29 Notion of distance
More informationChem120a : Exam 3 (Chem Bio) Solutions
Chem10a : Exam 3 (Chem Bio) Solutions November 7, 006 Problem 1 This problem will basically involve us doing two Hückel calculations: one for the linear geometry, and one for the triangular geometry. We
More informationGRADE 8 MATHEMATICS GLEs Color Coded. Math, Grade 8, and Curriculum and Assessment Summary 1
GRADE 8 MATHEMATICS GLEs Color Coded Math, Grade 8, and 13-14 Curriculum and Assessment Summary 1 GLE content to be taught and tested in Grade 8 Math in and 13-14 GLE # Grade-Level Expectation Text Aligned
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
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 informationCommunities, Spectral Clustering, and Random Walks
Communities, Spectral Clustering, and Random Walks David Bindel Department of Computer Science Cornell University 3 Jul 202 Spectral clustering recipe Ingredients:. A subspace basis with useful information
More informationLectures 15: Cayley Graphs of Abelian Groups
U.C. Berkeley CS294: Spectral Methods and Expanders Handout 15 Luca Trevisan March 14, 2016 Lectures 15: Cayley Graphs of Abelian Groups In which we show how to find the eigenvalues and eigenvectors of
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 information3 RD 9 WEEKS. EE 1 EE 3 EE 4 EE 7a EE 7b EE 8a EE 8b EE 8c SP 1 SP 2 SP 3 SP 4 F 2 F 3 F 5
1ST 9 WEEKS 2ND 9 WEEKS 3 RD 9 WEEKS 4 TH 9 WEEKS NS 1 NS 2 EE 2 G 1 G 2 G 3 G 4 G 5 EE 1 G 9 G 6 G 7 G 8 G 5 EE 5 EE 6 F 1 F 2 EE 1 EE 3 EE 4 EE 7a EE 7b EE 8a EE 8b EE 8c SP 1 SP 2 SP 3 SP 4 SP 4 SP
More informationWhat does the average eigenvalue know?
What does the average eigenvalue know? Evans Harrell Georgia Tech www.math.gatech.edu/~harrell CWRU March, 2017 Copyright 2017 by Evans M. Harrell II. What does the average eigenvalue know about geometry,
More informationSpectral Clustering. Guokun Lai 2016/10
Spectral Clustering Guokun Lai 2016/10 1 / 37 Organization Graph Cut Fundamental Limitations of Spectral Clustering Ng 2002 paper (if we have time) 2 / 37 Notation We define a undirected weighted graph
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 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 informationIsoperimetric inequalities for cartesian products of graphs
Isoperimetric inequalities for cartesian products of graphs F. R. K. Chung University of Pennsylvania Philadelphia 19104 Prasad Tetali School of Mathematics Georgia Inst. of Technology Atlanta GA 3033-0160
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 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 informationIntroduction to Spectral Theory
P.D. Hislop I.M. Sigal Introduction to Spectral Theory With Applications to Schrodinger Operators Springer Introduction and Overview 1 1 The Spectrum of Linear Operators and Hilbert Spaces 9 1.1 TheSpectrum
More informationHamiltonian System Approach to Distributed Spectral Decomposition in Networks
Hamiltonian System Approach to Distributed Spectral Decomposition in Networks Konstantin Avrachenkov INRIA, France Email: k.avrachenkov@inria.fr Philippe Jacquet Nokia Bell Labs, France Email: philippe.jacquet@nokia-bell-labs.com
More informationU.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018
U.C. Berkeley Better-than-Worst-Case Analysis Handout 3 Luca Trevisan May 24, 2018 Lecture 3 In which we show how to find a planted clique in a random graph. 1 Finding a Planted Clique We will analyze
More informationHigh-dimensional probability and statistics for the data sciences
High-dimensional probability and statistics for the data sciences Larry Goldstein and Mahdi Soltanolkotabi Motivation August 21, 2017 Motivation August 21, 2017 Please ask questions! Traditionally mathematics
More informationFinish section 3.6 on Determinants and connections to matrix inverses. Use last week's notes. Then if we have time on Tuesday, begin:
Math 225-4 Week 7 notes Sections 4-43 vector space concepts Tues Feb 2 Finish section 36 on Determinants and connections to matrix inverses Use last week's notes Then if we have time on Tuesday, begin
More informationChapter 2. EXPLORING LINEAR RELATIONS
Chapter 2. EXPLORING LINEAR RELATIONS In this chapter we begin with a review of proportional relationships as discussed in seventh grade mathematics. In eighth grade we focus on the unit rate of change
More informationMysteries Around Graph Laplacian Eigenvalue 4
Mysteries Around Graph Laplacian Eigenvalue 4 Yuji Nakatsukasa, Naoki Saito, Ernest Woei Department of Mathematics University of California, Davis ICIAM 2011, Vancouver, BC, Canada July 22, 2011 saito@math.ucdavis.edu
More informationExploring Topological Phases With Quantum Walks
Exploring Topological Phases With Quantum Walks Tk Takuya Kitagawa, Erez Berg, Mark Rudner Eugene Demler Harvard University References: PRA 82:33429 and PRB 82:235114 (2010) Collaboration with A. White
More informationME 563 HOMEWORK # 7 SOLUTIONS Fall 2010
ME 563 HOMEWORK # 7 SOLUTIONS Fall 2010 PROBLEM 1: Given the mass matrix and two undamped natural frequencies for a general two degree-of-freedom system with a symmetric stiffness matrix, find the stiffness
More informationGrade 8 Mathematics Performance Level Descriptors
Limited A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Grade 8 Mathematics. A student at this level has an emerging ability to formulate and reason
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 informationPreface to the Second Edition...vii Preface to the First Edition... ix
Contents Preface to the Second Edition...vii Preface to the First Edition........... ix 1 Introduction.............................................. 1 1.1 Large Dimensional Data Analysis.........................
More informationApproximate Principal Components Analysis of Large Data Sets
Approximate Principal Components Analysis of Large Data Sets Daniel J. McDonald Department of Statistics Indiana University mypage.iu.edu/ dajmcdon April 27, 2016 Approximation-Regularization for Analysis
More informationSpectral Generative Models for Graphs
Spectral Generative Models for Graphs David White and Richard C. Wilson Department of Computer Science University of York Heslington, York, UK wilson@cs.york.ac.uk Abstract Generative models are well known
More informationInstructor (Brad Osgood)
TheFourierTransformAndItsApplications-Lecture26 Instructor (Brad Osgood): Relax, but no, no, no, the TV is on. It's time to hit the road. Time to rock and roll. We're going to now turn to our last topic
More information6 Distances. 6.1 Metrics. 6.2 Distances L p Distances
6 Distances We have mainly been focusing on similarities so far, since it is easiest to explain locality sensitive hashing that way, and in particular the Jaccard similarity is easy to define in regards
More informationUsing the computer to select the right variables
Using the computer to select the right variables Rationale: Straight Line Distance Curved Transition Distance Actual transition difficulty represented by curved path Lake Carnegie, Princeton, NJ Using
More informationInformation Recovery from Pairwise Measurements
Information Recovery from Pairwise Measurements A Shannon-Theoretic Approach Yuxin Chen, Changho Suh, Andrea Goldsmith Stanford University KAIST Page 1 Recovering data from correlation measurements A large
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 informationSpectra of Large Random Stochastic Matrices & Relaxation in Complex Systems
Spectra of Large Random Stochastic Matrices & Relaxation in Complex Systems Reimer Kühn Disordered Systems Group Department of Mathematics, King s College London Random Graphs and Random Processes, KCL
More informationFast Linear Iterations for Distributed Averaging 1
Fast Linear Iterations for Distributed Averaging 1 Lin Xiao Stephen Boyd Information Systems Laboratory, Stanford University Stanford, CA 943-91 lxiao@stanford.edu, boyd@stanford.edu Abstract We consider
More informationA sequence of triangle-free pseudorandom graphs
A sequence of triangle-free pseudorandom graphs David Conlon Abstract A construction of Alon yields a sequence of highly pseudorandom triangle-free graphs with edge density significantly higher than one
More informationNorms of Random Matrices & Low-Rank via Sampling
CS369M: Algorithms for Modern Massive Data Set Analysis Lecture 4-10/05/2009 Norms of Random Matrices & Low-Rank via Sampling Lecturer: Michael Mahoney Scribes: Jacob Bien and Noah Youngs *Unedited Notes
More information2.1 Laplacian Variants
-3 MS&E 337: Spectral Graph heory and Algorithmic Applications Spring 2015 Lecturer: Prof. Amin Saberi Lecture 2-3: 4/7/2015 Scribe: Simon Anastasiadis and Nolan Skochdopole Disclaimer: hese notes have
More informationA Note on Google s PageRank
A Note on Google s PageRank According to Google, google-search on a given topic results in a listing of most relevant web pages related to the topic. Google ranks the importance of webpages according to
More informationContent Area: Mathematics Course: Grade 8 Math Grade Level: Grade 8 R14 The Seven Cs of Learning
Content Area: Mathematics Course: Grade 8 Math Grade Level: Grade 8 R14 The Seven Cs of Learning Collaboration Character Communication Citizenship Critical Thinking Creativity Curiosity Unit Titles Geometric
More information