Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs.
Pavel KolevHe SunPublished in: ISAAC (2014)
Keyphrases
- random walk
- directed graph
- graph clustering
- nodes of a graph
- link prediction
- spectral methods
- hyper graph
- laplacian matrix
- graph laplacian
- clustering algorithm
- average degree
- markov chain
- markov random walk
- web graph
- transition probabilities
- graph structures
- graph mining
- covariance matrix
- transition probability matrix
- random walker
- stationary distribution
- community detection
- graph matching
- data points
- link structure
- graph model
- adjacency matrix
- search space