Abstract / Description of output
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 always stay in a cluster S . Moreover, we initiate the study of the local mixing time and the almost stable distribution, by analyzing Dirichlet eigenvalues in graphs. We prove that the Dirichlet eigenvalues of any connected subset S can be used to bound the ϵ-uniform mixing time, which improves the previous best-known result. We further present two applications of our results. The first is a polynomial-time algorithm for finding clusters with an improved approximation guarantee, while the second is the significance ordering of vertices in a cluster.
| Original language | English |
|---|---|
| Title of host publication | Algorithms and Computation - 25th International Symposium, ISAAC 2014, Jeonju, Korea, December 15-17, 2014, Proceedings |
| Publisher | Springer |
| Pages | 621-632 |
| Number of pages | 12 |
| ISBN (Electronic) | 978-3-319-13075-0 |
| ISBN (Print) | 978-3-319-13074-3 |
| DOIs | |
| Publication status | E-pub ahead of print - 8 Nov 2014 |
| Event | The 25th International Symposium on Algorithms and Computation (ISAAC 2014) - Jeonju Traditional Culture Center, Jeonju, Korea, Republic of Duration: 15 Dec 2014 → 17 Dec 2014 http://tcs.postech.ac.kr/isaac2014/ |
Conference
| Conference | The 25th International Symposium on Algorithms and Computation (ISAAC 2014) |
|---|---|
| Abbreviated title | ISAAC 2014 |
| Country/Territory | Korea, Republic of |
| City | Jeonju |
| Period | 15/12/14 → 17/12/14 |
| Internet address |