Home

Publications

Research

In the News

Available
Positions

Links

Personal


Wales
Group

Cambridge
Cluster
Database

Disconnectivity
Forest

 

Erdös Numbers

Here is my previous best path that would have give me an Erdös Number of six. And here are the papers that make these connections:
  • P. Erdös, R.J. McEliece, H.R. Taylor, Pacific J. Math. 37, 45-46 (1971)
    Ramsey bounds for graph products.
  • R.J. McEliece, D.J.C. MacKay and J.F. Cheng, IEEE J. Sel. Area Comm. 16, 140-152 (1998)
    Turbo decoding as an instance of Pearl's "belief propagation" algorithm
  • M.N. Gibbs, D.J.C. MacKay, IEEE T. Neural Networ. 11 1458-1464 (2000)
    Variational Gaussian process classifiers
  • D.F.R. Brown, M.N. Gibbs and D.C. Clary, J. Chem. Phys. 105, 7597-7604 (1996)
    Combining ab initio computations, neural networks, and diffusion Monte Carlo: An efficient method to treat weakly bound molecules
  • J.K. Gregory, D.J. Wales and D.C. Clary, J. Chem. Phys., 102, 1592-1596 (1995)
    Reaction path zero point energy from diffusion Monte Carlo calculations
  • J.P.K. Doye and D.J. Wales, J. Chem. Soc., Far. Trans. 88, 3295-3304 (1992)
    Systematic investigation of the structures and rearrangements of six-atom clusters bound by a model anisotropic potential 
Back to my best path with an Erdös Number of three.

For more information see