|
|
Ben Morris
Home page:
http://www.math.ucdavis.edu/~morris/
Position: Associate Professor
Year joining UC Davis: 2005
Degree: Ph.D. Statistics, 2000, University of California, Berkeley
Refereed publications: Via
Math Reviews
Recent publications: Via
math arXiv
Education
University of California, Berkeley, Mathematics and Statistics, A.B., 1995
University of California, Berkeley, Statistics, Ph.D. 2000
Collaborators
Yuval Peres (UC Berkeley), Alistair Sinclair (UC Berkeley)
Synergistic Activities
I worked at an event at Microsoft Corporation called Techfest. My task was
to explain the relevance of mathematics to members of product groups.
Selected Publications
- B. Morris and A. Sinclair. Random Walks on Truncated Cubes and Sampling 0-1
Knapsack Solutions. SIAM Journal on Computing 34 (2004), pp. 195-226.
- B. Morris. Improved Bounds for Sampling Contingency Tables.
Random Structures and Algorithms 21 (2002), pp. 135-146.
- B. Morris. The Components of the Wired Spanning Forest are Recurrent. Probability Theory and Related Fields 125 (2003), pp. 259-265.
- B. Morris and Y. Peres. Evolving sets, mixing and heat kernel bounds.
Probability Theory and Related Fields 133 (2005), pp. 245-266.
- B. Morris. The mixing time for simple exclusion. To appear in
Annals of Applied Probability. Expected in May 2006 issue.
Last updated: unknown
|
|