Dissemin is shutting down on January 1st, 2025

Published in

2008 19th International Conference on Pattern Recognition

DOI: 10.1109/icpr.2008.4761274

Links

Tools

Export citation

Search in Google Scholar

Graph Drawing using Quantum Commute Time

Proceedings article published in 2008 by David Emms ORCID, Edwin R. Hancock, Richard C. Wilson
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.