Sciweavers

Share
ICPR
2008
IEEE

Graph drawing using quantum commute time

11 years 12 months ago
Graph drawing using quantum commute time
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.
David Emms, Edwin R. Hancock, Richard C. Wilson
Added 30 May 2010
Updated 30 May 2010
Type Conference
Year 2008
Where ICPR
Authors David Emms, Edwin R. Hancock, Richard C. Wilson
Comments (0)
books