Mark Kempton

activity

20162026

most citedRelationships between cycle spaces, gain graphs, graph coverings, fundamental groups, path homology, and graph curvature

5 citations · 22 across the 23 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.CO2016

Perfect state transfer on graphs with a potential

Mark Kempton, Gabor Lippner, Shing-Tung Yau

In this paper we study quantum state transfer (also called quantum tunneling) on graphs when there is a potential function on the vertex set. We present two main results. First, we…

math.CO2016

A non-backtracking Polya's theorem

Mark Kempton

Pólya's random walk theorem states that a random walk on a $d$ -dimensional grid is recurrent for $d = 1, 2$ and transient for $d \geq 3$ . We prove a version of Pólya's random walk theore…

math.CO2016★ 1 cited

Non-backtracking random walks and a weighted Ihara's theorem

Mark Kempton

We study the mixing rate of non-backtracking random walks on graphs by looking at non-backtracking walks as walks on the directed edges of a graph. A result known as Ihara's Theore…