Learn More
We give a clustering algorithm for connection graphs, that is, weighted graphs in which each edge is associated with a d-dimensional rotation. The problem of interest is to identify subsets of small Cheeger ratio and which have a high level of consistency, i.e. that have small edge boundary and the rotations along any distinct paths joining two vertices are(More)
The College's 23rd annual Spring Research Conference (SRC) was held from 8 a.m. to 2 p.m. on Saturday, March 21. The SRC gives students, both undergraduate and graduate, a chance to present the results of their research from the previous year. Each student participant had twelve minutes to present his or her research, with three minutes afterward to answer(More)
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 show that for paths of length greater than three, there is no potential on the vertices of the path for which perfect state transfer between the endpoints can occur. In(More)
  • 1