In this talk we will discuss a new result about the double-dimer model: under certain conditions, the partition function for double-dimer configurations of a planar bipartite graph satisfies an elegant recurrence, related to the Desnanot-Jacobi identity from linear algebra. A similar identity for the number of dimer configurations (or perfect matchings) of a graph was established nearly 20 years ago by Kuo and others and has applications to random tiling theory and the theory of cluster algebras. This work was motivated in part by the potential for applications in these areas. Speaker(s): Helen Jenne (University of Oregon)