# David Galvin

**Associate Professor**

B.A., Peterhouse, University of Cambridge, 1995

Ph.D., Rutgers University, 2002

Email: dgalvin1@nd.edu

Office: 132 Hayes-Healy

Phone: (574) 631-4181

Fax: (574) 631-6579

For additional information see David Galvin’s Personal Page.

**Research Interests**

My research is in discrete probability, combinatorics and graph theory; in particular, the applications of combinatorial ideas to the study of phase transitions in statistical physics models, the efficiency of algorithms in theoretical computer science, and long-range correlations in discrete random structures.

**Selected Publications**

- D. Galvin, Bounding the partition function of spin systems,
*Electronic Journal of Combinatorics***13**(2006), R72. - D. Galvin and P. Tetali, Clow mixing of Glauber dynamics for the hard-core model on regular bipartite graphs,
*Random Structures & Algorithms***28**(2006), 427-443. - D. Galvin and J. Kahn, On phase transition in the hard-core model on \mathbb{Z}^d,
*Combinatorics, Probability and Computing***13**(2004), 137-164. - D. Galvin, On homomorphisms from the Hamming cube to \mathbb{Z},
*Israel Journal of Mathematics***138**(2003), 189-213.

Please direct questions and comments to: dgalvin1@nd.edu