 |  |  |  | Colin Mallows Research Scientist
 "I am overwhelmed at being chosen for the Wilks award. I take this as one more indication that I have been exceedingly lucky in my choice of career and collaborators." |
| HISTORY | I got my degrees in the 1950s from University College London, where I was inspired by F. N. David, N. L. Johnson, and E. S. Pearson. After two years in the British Army, I became a Lecturer at UCL, and spent a year at Princeton with George Box and Stu Hunter. In the 60s I worked with Herb Robbins at Columbia, and with Cuthbert Daniel. For 47 years (and counting) I have had the stimulation of Bell Labs and its descendants, collaborating with people like John Tukey, John Chambers, Martin Wilk, Ram Gnanadesikan, Jon Kettenring, Bill Cleveland, Trevor Hastie, Vijay Nair, Yehuda Vardi, Sid Dalal, Daryl Pregibon, and a steady stream of distinguished visitors. Not to mention many world-class mathematicians such as John Riordan, Steve Rice, Ron Graham, Larry Shepp, and Neil Sloane. I delivered the 1997 Fisher lecture on "The Zeroth Problem", and the 2004 Deming lecture. |
| RESEARCH | I am best-known for inventing the Cp statistic. I have published papers on the theory of assurance, covering designs, stable variables, ranking methods, robustness, smoothing, and stopping rules. I am proudest of a joint paper on Exchangeability and Data Analysis. For the last three years before retiring from AT&T in 2000 I worked on the problem of determining whether Telcos are delivering "parity" service. I have also published several papers on more mathematical topics, including Chebychev inequalities, coding theory, a sequence problem of John Conway, and a generalization of Descartes' circles theorem. |
| SELECTED PUBLICATIONS | A generalization of Apollonian packing of circles, Proc. of the 20th Canadian Conference on Computational Geometry, McGill University, Quebec, Canada (2008) (with Gerhard Guettler) Tukey's paper after 40 years, Technometrics (with discussion) (2006) How much assurance does a PIN provide?, Human Interactive Proofs, Lecture Notes in Computer Science 3517 (2005) (with J. Bentley) B-stability, J. Applied Probability (2005) (with L. A. Shepp) John Tukey at Bell Labs, Statistical Science (2003) Minimizing the expected minimum, Adv. Appl. Math. (2003) Parity: Implementing the telecommunications act of 1996, Statistical Science (with discussion) (2002) Beyond the Descartes circle theorem, Amer. Math. Monthly (2002) (with J. C. Lagarias and A. R. Wilks) An exercise in the real world of design and analysis, The American Statistician (2001) (with L. Denby and J. M. Landwehr) An adjusted, asymmetric two-sample t test, The American Statistician (2001) (with S. D. Balkin) Factor-covering designs for testing software, Technometrics (1998) (with S. R. Dalal) The zeroth problem, The American Statistician (1998) Covering designs for software testing, Proc. 28th Symp. Interface (1997) (with S. R. Dalal) Some statistical principles for massive data problems, Proc. Sect. Stat. Comp., ASA (1995) (with D. Pregibon) More comments on Cp, Technometrics (1995) QQ-plots are insensitive to correlations, Proc. Sect. Stat. Graphics, ASA (1993) (with A. E. Freeny) Smooth reduced-rank approximations, ISI Contributed Papers (1993) (with L. Denby) ATS methods: nonparametric regression for nongaussian data, J. Amer. Statist. Assoc. (1993) (with W. S. Cleveland and J. E. McRae) Exchangeability and data analysis, J. Roy. Statist. Soc. Ser. A (with discussion) (1993) (with D. R. Draper, J. S. Hodges, and D. Pregibon) Buying with exact confidence, Ann. Appl. Prob. (1992) (with S. R. Dalal) Conway's challenge sequence, Amer. Math. Monthly (1990) Correction, Amer. Math. Monthly (1992) Averaging subset regressions, ISI Contributed Papers (1989) (with L. Denby) When should one stop testing software?, J. Amer. Statist. Assoc. (1988) (with S. R. Dalal) A note on unbiased Bayes estimates, Amer. Statistician (1988) (with P. J. Bickel) A unique unbiased estimator with an interesting property, Amer. Statistician (1987) (with V. J. Nair) Augmented partial residuals, Technometrics (1986) Designing an auditing procedure, or how to keep bank managers on their toes, Math. Mag. (1984) (with N. J. A. Sloane) Data description, in Scientific Inference, Data Analysis, and Robustness, Eds. Box, Leonard, and Wu (1983) Bounds on the efficiency of estimates based on overlapping data, Biometrika (1982) (with Y. Vardi) An overview of techniques of data analysis, emphasizing its exploratory aspects, in Some Recent Advances in Statistics, Eds. deOliveria, J. T. and Epstein, B. (1981) (with J. W. Tukey) Some theory of nonlinear smoothers, Ann. Statist. (1980) Robust methods - some examples of their use, Amer. Statistician (1979)
Some realizability theorems in group testing, SIAM J. Appl. Math. (1979) (with F. K. Hwang and S. Lin) Two diagnostic displays for robust regression analysis, Technometrics (1977) (with L. Denby) A method for simulating stable random variables, J. Amer. Statist. Assoc. (1976) (with J. M. Chambers and B. W. Stuck) Corrections (1987), (1988) Upper bounds for modular forms, lattices, and codes, J. Algebra (1975) (with A. M. Odlyzko and N. J. A. Sloane) An upper bound for self-dual codes, Information and Control (1973) (with N. J. A. Sloane) On the invariants of a linear group of order 336, Proc. Cambridge Phil. Soc. (1973) (with N. J. A. Sloane) Some comments on Cp, Technometrics (1973) Reprinted in Technometrics (2000) Limit distributions of self-normalized sums, Ann. Prob. (1973) (with B. F. Logan, S. O. Rice, and L. A. Shepp) Bounds on distribution functions in terms of expectations of order-statistics, Ann. Prob. (1972) A note on asymptotic joint normality, Ann. Math. Statist. (1972) Generalizations of Gleason's theorem on weight enumerators of self-dual codes, IEEE Trans. Information Theory (1972) (with N. J. A. Sloane and F. J. MacWilliams) Systematic biases in panel surveys due to differential nonresponse, J. Amer. Statist. Assoc. (1970) (with W. H. Williams) Inequalities of Chebychev type involving conditional expectations, Ann. Math. Statist. (1969) (with D. Richter) The inversion enumerator for labelled trees, Bull. Amer. Math. Soc. 74 pp. 92-94 (1968) Linear processes are nearly Gaussian, J. Appl. Prob. (1967) On the stereoregularity of vinyl polymer chains, J. Chem. Phys. (1966) (with H. L. Frisch and F. A. Bovey) Some aspects of the random sequence, Ann. Math. Statist. (1965) (with D. E. Barton) Some problems of optimal sampling strategy, J. Math. Anal. and Appl. (1964) (with H. Robbins) A generalization of the Chebyshev inequalities, Proc. London Math. Soc. (1963) The randomization bases of the problem of the amalgamation of weighted means, J. Roy. Statist. Soc. Ser. B (1961) (with D. E. Barton) Latent vectors of random symmetric matrices, Biometrika (1961) The variance of Spearman's rho in normal samples, Biometrika (1961) (with F. N. David) Non-null ranking models, I, Biometrika (1957) Generalizations of Tchebycheff's inequalities, J. Roy. Statist. Soc. Ser. B (with discussion) (1956) Sequential discrimination, Sanhkya (1953)
|
|
|
| |