Peter Doyle

Doyle and Snell: `Random Walks and Electric Networks' (pdf) (ps) (source) Nerd Sniping
Grinstead and Snell's Introduction to Probability (pdf) (ps) (source)
Tetra and Didi, the cosmic spectral twins (pdf) (ps) (source)
Division by three (pdf) (ps) (source)
The knee-jerk mapping (pdf) (ps) (source)
Riffles, ruffles, and the turning algebra (pdf) (ps) (source)
Electric currents in infinite networks (pdf) (ps) (source)
Frustration solitaire (pdf) (ps) (source)
The number of Latin rectangles (pdf) (ps) (source)
Application of Rayleigh's short-cut method to Polya's recurrence problem (pdf) (ps) (source)
A 27-vertex graph that is vertex-transitive and edge-transitive but not 1-transitive (pdf) (ps) (source) picture
J. Laurie Snell: `The Engel algorithm for an absorbing Markov chain' (pdf) (ps) (source)

Isospectral hyperbolic surfaces have matching geodesics (pdf) (ps)
Solving equations through the ages (pdf) (ps)
Some planar isospectral domains (pdf) (ps) (more examples)
The Evil Twin strategy for a football pool (pdf) (ps)
Random walks on weighted graphs, and applications to on-line algorithms (extended abstract) (pdf) (ps)
Random walks on weighted graphs, and applications to on-line algorithms (pdf) (ps)
On the evolution of islands (pdf) (ps)
The match set of a random permutation has the FKG property (pdf) (ps)
Solving the quintic by iteration (pdf) (ps) (MACSYMA input) (MACSYMA output)
On the bass note of a Schottky group (pdf) (ps)
Random walk on the Speiser graph of a Riemann surface (pdf) (ps)
On deciding whether a surface is parabolic or hyperbolic (pdf) (ps)
Non-sexist solution of the menage problem (pdf) (ps)

Trace Formula Lite (pdf) (ps) (source)
Solution to Montmort's `Problême du Treize' (pdf) (ps) (source) (accompanying Mathematica notebook)
Energy for Markov chains (pdf) (ps) (source)
Lower bounds for lowest eigenvalues (pdf) (ps) (source)

Peter Doyle
Math Department
Dartmouth College
Hanover, NH 03755

doyle@math.dartmouth.edu