Dirichlet Eigenvalues, Local Random Walks, and Analyzing Clusters in Graphs

ALGORITHMS AND COMPUTATION, ISAAC 2014, pp. 621-632, 2014.

Cited by: 2|Views5


A cluster S in a massive graph G is characterised by the property that its corresponding vertices are better connected with each other, in comparison with the other vertices of the graph. Modeling, finding and analyzing clusters in massive graphs is an important topic in various disciplines. In this work we study local random walks that a...More



Get fulltext within 24h
Upload PDF

1.Your uploaded documents will be check within 24h, and coins will be credited to your account.

2.As the current system does not support cash withdrawal, you can add staff WeChat (AMxiaomai) to receive it as a red packet.

3.10 coins will be exchanged for 1 yuan.


Upload a single paper

for 5 coins

Wechat's Red Packet

Upload 50 articles

for 280 coins

Wechat's Red Packet

Upload 200 articles

for 1200 coins

Wechat's Red Packet

Upload 500 articles

for 3000 coins

Wechat's Red Packet

Upload 1000 articles

for 7000 coins

Wechat's Red Packet
Your rating :