By the same authors

Graph Drawing using Quantum Commute Time

Research output: Contribution to conferencePaper

Author(s)

Department/unit(s)

Conference

Conference19th International Conference on Pattern Recognition (ICPR 2008)
CityTampa
Conference date(s)8/12/0811/12/08

Publication details

DatePublished - 2008
Number of pages4
Original languageEnglish

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.

Bibliographical note

19th International Conference on Pattern Recognition (ICPR 2008), Tampa, FL, DEC 08-11, 2008

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations