220 likes | 229 Vues
Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research One Microsoft Way, Redmond, WA 98052 lovasz@microsoft.com. Adjacency matrix:. Laplacian:. Matrices associated with graphs. (all graphs connected). Adjacency matrix:. Laplacian:.
E N D
Eigenvalues and geometric representations of graphs László Lovász Microsoft Research One Microsoft Way, Redmond, WA 98052 lovasz@microsoft.com
Adjacency matrix: Laplacian: Matrices associated with graphs (all graphs connected)
Adjacency matrix: Laplacian:
eigenvalues of adjacency matrix eigenvalues of Laplacian Eigenvalues and eigenvectors
-1 1 1.481 1.193 0 0 1 1 1 1 -1 1.481 -1 1 -1 Eigenvalues and eigenvectors
average degree maximum degree If G is regular of degree d, then The largest eigenvalue
Wilf The largest eigenvalue chromatic number maximum clique
not used! The largest eigenvalue
G bipartite 1 -1 1 1 1 -1 1 1 1 -1 1 1 The smallest eigenvalue
Proof uses only 0 entries: can replace 1’s by anything G k-colorable Hoffman The smallest eigenvalue maximizing we get: Polynomial time computable!
Computing semidefinite optimization problem
Transition matrix (of random walk): Another matrix associated with graphs Adjacency matrix: Laplacian: (Not much difference if graph is regular.)
Random walks How long does it take to get completely lost?
Sampling by random walk S: large and complicated set (all lattice points in convex body all states of a physical system all matchings in a graph...) Want: uniformly distributed random element from S Applications: - statistics - simulation - counting - numerical integration - optimization - card shuffling...
One general method for sampling: random walks (+rejection sampling, lifting,…) Want: sample from setV Construct regular connected non-bipartite graph with node set V Walk for Tsteps ???????????? mixing time Output the final node
5 4 5 4 2 3 3 2 1 1 Given: poset Step: - pick randomly label i<n; - interchange i and i+1 if possible Node: compatible linear order Example: random linear extension of partial order
in random walk: in sequence of independent samples: conductance: Conductance frequency of stepping from S to V \S Edge-density in cut
Jerrum - Sinclair Conductance and eigenvalue gap eigenvalues of transition matrix up to a constant factor
Jerrum - Sinclair Conductance and eigenvalue gap eigenvalues of transition matrix
G connected l1has multiplicity1 eigenvector is all-positive Frobenius-Perron What about the eigenvectors? eigenvalues of A
Van der Holst are connected. What about the eigenvectors? eigenvalues of A