The discrete Laplacian on d-regular graphs : Combinatorics, Random Matrix Theory and Random Waves Work done with Yehonatan Elon, Idan Oren, and Amit Godel.

Slides:

Advertisements

Similar presentations

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.

Advertisements

13 May 2009Instructor: Tasneem Darwish1 University of Palestine Faculty of Applied Engineering and Urban Planning Software Engineering Department Introduction.

Section 14.1 Intro to Graph Theory. Beginnings of Graph Theory Euler’s Konigsberg Bridge Problem (18 th c.)  Can one walk through town and cross all.

Statistical properties of Random time series (“noise”)

Groups, Graphs & Isospectrality Rami Band Ori Parzanchevski Gilad Ben-Shach Uzy Smilansky.

Spectral Clustering Scatter plot of a 2D data set K-means ClusteringSpectral Clustering U. von Luxburg. A tutorial on spectral clustering. Technical report,

A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts Dhillon, Inderjit S., Yuqiang Guan, and Brian Kulis.

Graph Algorithms: Minimum Spanning Tree We are given a weighted, undirected graph G = (V, E), with weight function w:

Tracing periodic orbits and cycles in the nodal count Amit Aronovitch, Ram Band, Yehonatan Elon, Idan Oren, Uzy Smilansky xz ( stands for the integral.

A Unified View of Kernel k-means, Spectral Clustering and Graph Cuts

EXPANDER GRAPHS Properties & Applications. Things to cover ! Definitions Properties Combinatorial, Spectral properties Constructions “Explicit” constructions.

Zig-Zag Expanders Seminar in Theory and Algorithmic Research Sashka Davis UCSD, April 2005 “ Entropy Waves, the Zig-Zag Graph Product, and New Constant-

Chapter 7. Random Process – Spectral Characteristics

The Mathematics of Networks Chapter 7. Trees A tree is a graph that –Is connected –Has no circuits Tree.

Geometric characterization of nodal domains Y. Elon, C. Joas, S. Gnutzman and U. Smilansky Non-regular surfaces and random wave ensembles General scope.

MATH 310, FALL 2003 (Combinatorial Problem Solving) Lecture 10, Monday, September 22.

Resolving the isospectrality of the dihedral graphs Ram Band, Uzy Smilansky A graph G is made of V vertices and B bonds and a connectivity matrix C ij.

Eigenvectors of random graphs: nodal domains James R. Lee University of Washington Yael Dekel and Nati Linial Hebrew University TexPoint fonts used in.

1 Entropy Waves, The Zigzag Graph Product, and New Constant-Degree Expanders Omer Reingold Salil Vadhan Avi Wigderson Lecturer: Oded Levy.

The Erdös-Rényi models

Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,

An introduction to expander families and Ramanujan graphs

Spectral Graph Theory and Applications Advanced Course WS2011/2012 Thomas Sauerwald He Sun Max Planck Institute for Informatics.

5.1  Routing Problems: planning and design of delivery routes.  Euler Circuit Problems: Type of routing problem also known as transversability problem.

Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.

7.1 and 7.2: Spanning Trees. A network is a graph that is connected –The network must be a sub-graph of the original graph (its edges must come from the.

Spectral graph theory Network & Matrix Computations CS NMC David F. Gleich.

Fan Chung University of California, San Diego The PageRank of a graph.

S+S+ S-S- 5. Scattering Approach (alternative secular equation)

10 December, 2008 CIMCA2008 (Vienna) 1 Statistical Inferences by Gaussian Markov Random Fields on Complex Networks Kazuyuki Tanaka, Takafumi Usui, Muneki.

Theory of impedance networks: A new formulation F. Y. Wu FYW, J. Phys. A 37 (2004)

Lecture 14: Graph Theory I Discrete Mathematical Structures: Theory and Applications.

Theory of electric networks: The two-point resistance and impedance F. Y. Wu Northeastern University Boston, Massachusetts USA.

Workshop on Optimization in Complex Networks, CNLS, LANL (19-22 June 2006) Application of replica method to scale-free networks: Spectral density and spin-glass.

Reflexivity in some classes of multicyclic treelike graphs Bojana Mihailović, Zoran Radosavljević, Marija Rašajski Faculty of Electrical Engineering, University.

Math – Graphs of Functions 1. Graph of a function: the graph of all the function’s ordered pairs 2.

Artur Czumaj DIMAP DIMAP (Centre for Discrete Maths and it Applications) Computer Science & Department of Computer Science University of Warwick Testing.

MAT 2720 Discrete Mathematics Section 8.2 Paths and Cycles

Photo : Jean-François Dars Anne Papillault

Properties of Growing Networks Geoff Rodgers School of Information Systems, Computing and Mathematics.

Graphs, Vectors, and Matrices Daniel A. Spielman Yale University AMS Josiah Willard Gibbs Lecture January 6, 2016.

Random Processes Gaussian and Gauss-Markov processes Power spectrum of random processes and white processes.

Spectral and Wavefunction Statistics (I) V.E.Kravtsov, Abdus Salam ICTP.

Math 1411 Chapter 1: Limits and Their Properties 1.5 Infinite Limits.

Presented by Alon Levin

A Tutorial on Spectral Clustering Ulrike von Luxburg Max Planck Institute for Biological Cybernetics Statistics and Computing, Dec. 2007, Vol. 17, No.

1 Entropy Waves, The Zigzag Graph Product, and New Constant-Degree Expanders Omer Reingold Salil Vadhan Avi Wigderson Lecturer: Oded Levy.

Expanders and Ramanujan Graphs Mike Krebs, Cal State LA For slideshow: click “Research and Talks” from

Properties and applications of spectra for networks 章忠志复旦大学计算机科学技术学院 Homepage:

EXAMPLE FORMULA DEFINITION 1.

Random Walk for Similarity Testing in Complex Networks

Intrinsic Data Geometry from a Training Set

Hongfang Wang and Edwin R. Hancock Department of Computer Science

Eigenvalues of a Graph Scott Grayson.

Reconstruction on trees and Phylogeny 1

Lecture 15: Graph Theory II

3. Spectral statistics. Random Matrix Theory in a nut shell.

4.a The random waves model

geometric representations of graphs

Walks, Paths, and Circuits

Enumeration problems of networks

3.3 Network-Centric Community Detection

Decision Maths Graphs.

Discrete Mathematics Lecture 12: Graph Theory

Properties and applications of spectra for networks

2. The trace formula Purpose: express the spectral density in terms of “periodic orbits”

Algorithms Lecture # 27 Dr. Sohail Aslam.

Warm Up – Tuesday Find the critical times for each vertex.

第八届全国复杂网络学术会议 Spectra of transition matrix for networks: Computation and applications 章忠志复旦大学计算机科学技术学院 Homepage:

Presentation transcript:

The discrete Laplacian on d-regular graphs : Combinatorics, Random Matrix Theory and Random Waves Work done with Yehonatan Elon, Idan Oren, and Amit Godel Chemnitz, July 2011 Uzy Smilansky Trace formulae and spectral statistics for discrete Laplacians on regular graphs (I, II) I. Idan Oren, Amit Godel and Uzy Smilansky J. Phys. A: Math. Theor. 42 (2009) II Idan Oren and Uzy Smilansky J. Phys. A: Math. Theor. 43 (2010) Y. Elon, Eigenvectors of the discrete Laplacian on regular graphs – a statistical approach J. Phys A. 41 (2008) Y. Elon, Gaussian waves on the regular tree arXiv: v2 (2009) Y. Elon and U Smilansky Level sets percolation on regular graphs. J. Phys. A: Math. Theor. 43 (2010)

PLAN 1.Introduction Definitions The G(n,d) ensemble – combinatorial and spectral properties. 2.The trace formula for d-regular graphs Bartholdi’s identity Derivation of the trace formula. d-regular quantum graphs. 3.Spectral statistics and combinatorics. The spectral formfactor - a bridge to RMT 4.Eigenvectors A random waves model Nodal domains Percolation of level sets. 5.Trace formula for arbitrary graphs open problems

1. Introduction e’e’ e t-cycle: A non back tracking walk which starts and ends at the The same vertex (edge).

Examples: 3= Tree graph Complete graph d=4 regular graph

d-regular graphs : Graphs where all the vertices have the same degree. Examples: 1.Complete graphs 2.Lattices 3.d-regular infinite trees. d-regular graphs are an expanding family.

The discrete Laplacian and its spectrum

Spectral properties of d-regular graphs The spectral density