Locally computable approximations for spectral clustering and absorption times of random walks

Details Locally computable approximations for spectral clustering and absorption times of random walks Locally computable approximations for spectral clustering and absorption times of random walks

2008-10-22

arxiv.org/abs/0810.4061v1

Computer Science

Discrete Mathematics

21 pages, 8 figures

Scientific paper

We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms of absorption times of random walks from other vertices to the vertex of interest, and observe that these times are well approximated by the components of the principal eigenvector of the corresponding fundamental matrix of the graph's adjacency matrix. We further present a locally computable gradient-descent method to estimate this Dirichlet-Fiedler vector, based on minimising the respective Rayleigh quotient. Experimental evaluation shows that the approximations behave well and yield well-defined local clusters.

Affiliated with

Also associated with

No associations

Rating

Locally computable approximations for spectral clustering and absorption times of random walks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Locally computable approximations for spectral clustering and absorption times of random walks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Locally computable approximations for spectral clustering and absorption times of random walks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-416946