Abstract
In this paper we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has been shown to be robust to errors in edge weight structure and to lead to spectral clustering algorithms with improved performance. We analyse the quantum commute times with reference to their classical counterpart. Specifically, we explore the graph embeddings that preserve commute-time.
| Original language | English |
|---|---|
| Pages | 3743-3746 |
| Number of pages | 4 |
| Publication status | Published - 2008 |
| Event | 19th International Conference on Pattern Recognition (ICPR 2008) - Tampa Duration: 8 Dec 2008 → 11 Dec 2008 |
Conference
| Conference | 19th International Conference on Pattern Recognition (ICPR 2008) |
|---|---|
| City | Tampa |
| Period | 8/12/08 → 11/12/08 |