Lecture: Diffusions and Random Walks as Robust Eigenvectors

نویسنده

  • Michael Mahoney
چکیده

Last time, we talked about electrical networks, and we saw that we could reproduce some of the things we have been doing with spectral methods with more physically intuitive techniques. These methods are of interest since they are typically more robust than using eigenvectors and they often lead to simpler proofs. Today, we will go into more detail about a similar idea, namely whether we can interpret random walks and diffusions as providing robust or regularized or stable analogues of eigenvectors. Many of the most interesting recent results in spectral graph methods adopt this approach of using diffusions and random walks rather than eigenvectors. We will only touch on the surface of this approach.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lecture : Basic Matrix Results ( 1 of 3 )

Today and next time, we will start with some basic results about matrices, and in particular the eigenvalues and eigenvectors of matrices, that will underlie a lot of what we will do in this class. The context is that eigenvalues and eigenvectors are complex (no pun intended, but true nonetheless) things and—in general—in many ways not so “nice.” For example, they can change arbitrarily as the ...

متن کامل

Lecture : Modeling graphs with electrical networks

So far, we have been adopting the usual approach to spectral graph theory: understand graphs via the eigenvectors and eigenvalues of associated matrices. For example, given a graph G = (V,E), we defined an adjacency matrix A and considered the eigensystem Av = λv, and we also defined the Laplacian matrix L = D−A and considered the Laplacian quadratic form xTLx− ∑ (ij)∈E(xi−xj). There are other ...

متن کامل

Probability on Groups: Random Walks and Invariant Diffusions, Volume 48, Number 9

968 NOTICES OF THE AMS VOLUME 48, NUMBER 9 W hat do card shuffling, volume growth, and Harnack inequalities have to do with each other? They all arise in the study of random walks on groups. Probability on groups is concerned with probability measures and random processes whose properties are dictated in part by an underlying group structure. It is a diverse area where one finds both sophistica...

متن کامل

Probability on groups: Random walks and invariant diffusions

Introduction What do card shuffling, volume growth, and Harnack inequalities have to do with each other? They all arise in the study of random walks on groups. Probability on groups is concerned with probability measures and random processes whose properties are dictated in part by an underlying group structure. It is a diverse area where one finds both sophisticated theories and the analysis o...

متن کامل

Random walks in a random environment ∗

Random walks as well as diffusions in random media are considered. Methods are developed that allow one to establish large deviation results for both the 'quenched' and the 'averaged' case.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015