Publications

Coauthors


* Other coauthors will only be added if there is collaboration on two or more papers with Dr. Diaconis, except for the coauthors previously on his page.

David Aldous

David Aldous, Department of Statistics , University of California at Berkeley
e-mail: aldous AT stat DOT berkeley DOT edu


  1. Shuffling Cards and Stopping Times. With D. Aldous, Amer. Math'l Monthly, 93 5:333-348. (1986). [PDF]

  2. Strong Uniform Times and Finite Random Walks, Advances in Applied Math., 8 69-97 (1987)

  3. Hammersley's Interacting Particle Process and Longest Increasing Subsequences. With D. Aldous. Prob. Theory Related Fields 103 199-213. (1995). Abstract [PDF] [PostScript]

  4. Longest Increasing Subsequences: From Patience Sorting to the Baik-Dieft-Johansson Theorem. With D. Aldous, Bull. Amer. Math. Soc. 36 413-32. (1999). [PDF] [PostScript]

  5. The Asymmetric One-Dimensional Constrained Ising Model: Rigorous Results. With D. Aldous. Jour. Statist. Physics. 107 945-975. (2002). [PDF] [PostScript]

Louis Billera

top

Louis J. Billera, Department of Mathematics, Cornell University
e-mail: billera AT math DOT cornell DOT edu


  1. Random Walks and Plane Arrangements in Three Dimensions. With Kenneth Brown. Amer. Math. Monthly, 106 6:502-24. [PDF]

  2. A Geometric Interpretation of the Metropolis-Hastings Algorithm. With L. Billera,. Statis. Sci., 16 4:335-339. [PDF] [PostScript]

S. Boyd

top



  1. Fastest Mixing of Markov Chain on a Graph and a Connection to a Maximum Variance Unfolding Problem. With J. Sun, S. Boyd and L. Xiao. SIAM Review, 48(4):681-699. (2006). [PDF]

  2. Fastest Mixing of Markov Chain on Graphs With Symmetries. With P. Parrilo, S. Boyd and L. Xiao. (2006). [PDF]

  3. Fastest Mixing Markov Chain on a Path. With S. Boyd and L. Xiao. American Mathematics Monthly (2006). [PDF]

  4. Symmetry Analysis of Reversible Markov Chains. With S. Boyd, P. Parrilo, L. Xiao. Journal of Internet Mathematics 2 31-72. [PDF]

  5. Fastest Mixing Markov Chain on a Graph. (2004). With S. Boyd and L. Xiao. SIAM Review 46(4):667-689. [PDF]

Kenneth Brown

top

Kenneth Brown, Department of Mathematics, Cornell University
e-mail: kbrown at math DOT cornell DOT edu


  1. Random Walks and Hyperplane Arrangements, Ann. Probab., 26 4:1813-54. (1998). [PDF]

  2. Random Walks and Plane Arrangements in Three Dimensions, with Louis Billera Amer. Math. Monthly, 106 6:502-24. (1999). [PDF]

Dan Bump

top

Dan Bump, Department of Mathematics, Stanford University



  1. Unitary Correlations and the Fejer Kernel. With Joseph Keller. Mathematical Physics, Analysis and Geometry, 5, 101-123.(2002). [PDF] [PostScript]

  2. Toeplitz Minors. Jour. Combin. Th. (A) 97 2:252-271. (2002). [PDF]

Fan R. K. Chung

top

Fan Chung, Department of Mathematics , University of California, San Diego
e-mail: fan AT ucsd DOT edu


  1. On the Permanents of Complements of the Direct Sum of Identity Matrices, with Ron Graham and C. L. Mallows , Advances in Applied Math., 2 121-137. (1981). [PDF]

  2. Random Walks Arising in Random number Generation, with Ron Graham , Ann. Prob., 15 3: 1148-1165.(1987). [PDF](1987)

  3. Universal Cycles for Combinatorial Structures, with Ron Graham , Discrete Math, 110 1-3:43-59. (1992). [PDF]

  4. Combinatorics for the East Model, with Ron Graham and Fan Chung, Adv. Appl. Math. 27 192-206. (2001). [PDF]

Steven Evans

top

Steven Evans, Department of Statistics, University of California, Berkeley
e-mail: evans AT stat DOT berkeley DOT edu


  1. Immanants and Finite Point Processes. With S. Evans, Jour. Combin. Th. Series A 91 1-2: 305-321. [PDF] [PostScript]

  2. Linear Functionals of Eigenvalues of Random Matrices, with Steve Evans, Trans. Amer. Math. Soc. 353 7:2615-33. (2001). [PDF]

  3. A Different Construction of Gaussian Fields from Markov Chains: Dirichlet Covariances. With Steve Evans. Ann. Inst. Henri Poincare , 38 6:863-878. (2002). [PDF]

James Allen Fill

top

Jim Fill, Department of Mathematical Sciences, Johns Hopkins University
e-mail: jimfill AT jhu DOT edu


  1. Examples for the Theory of Strong Stationary Dualty with Countable State Spaces, Prob. Engin. Info. Sci., 4 157-180. (1990).

  2. Strong Stationary Times via a New Form of Duality, Ann. Prob., , 18 4:1483-1522. (1990). [PDF]

  3. Analysis of Top to Random Shuffles, with Jim Pitman, Combinatorics, Probability Computing, 1 135-155. (1992). [PDF]

David Freedman

top

David Freedman Department of Statistics, UC Berkeley
e-mail: freedman AT stat DOT berekely DOT edu


  1. On Rounding Percentages. JASA, 74 366:359-364. (1979). [PDF]

  2. de Finetti's Theorem for Markov Chains Ann. Prob., 8 115-130. (1980). [PDF]

  3. Finite Exchangeable Sequences. Ann. Prob. , 8 745-764. (1980). [PDF]

  4. de Finetti's Generalizations of Exchangeability, Studies in Inductive Logic and Probability, Vol. II, (R. Jeffrey, ed.), (1980)

  5. On the Statistics of Vision: the Julesz Conjecture, J. Math'l Psychology , 24 2:112-138. (1981). [PDF]

  6. On the Histogram as a Density Estimator: L_2 Theory, Z. Wahr. verw. Gebiete, 57 453-476. (1981).

  7. On the Maximum Deviation Between the Histogram and the Underlying Density, Z. Wahr. verw. Gebiete, 58 139-167 (1981)

  8. The Persistence of Cognitive Illusions: A Rejoinder to L. J. Cohen, Behavioral and Brain Sci., 4 333-334. (1981).

  9. On the Maximum Difference Between the Empirical and Expected Histograms for Sums, Pacific J. Math., 100 2:287-327. (1982). [PDF]

  10. On the Difference Between the Empirical Histogram and the Normal curve for Sums, Part II, Pacific J. Math, 100 2:359-371 (1982). [PDF]

  11. On the Mode of an Empirical Histogram for Sums, Pacific J. Math, 100 2:373-385.(1982). [PDF]

  12. de Finetti's Theorem for Symmetric Location Families, with D. Freedman, Ann. Stat., 10 1:84-189. (1982). [PDF]

  13. On Inconsistent M -Estimator, Ann. Stat., 10 2:454-461. (1982). [PDF]

  14. Bayes Rules for Location Problems, Statistical Decision Theory and Related Topics III , S. Gupta, J. Berger (ed.), 315-327 (1982)

  15. On Inconsistent Bayes Estimates in the Discrete case, Ann. Stat., 11 4:1109-1118. (1983). [PDF]

  16. Frequency Properties of Bayes Rules, In Scientific Inference, Data Analysis, and Robustness, G. Box, T. Leonard, C. F. Wu (eds.). Academic Press, New York, 105-115 (1983)

  17. Partial Exchangeability and sufficiency, Proc. IndianStat. Inst. Golden Jubilee Int'l Conf. Stat.: Applications and New Directions , J. K. Ghosh and J. Roy (eds.), Indian Statistical Institute, Calcutta, 205-236. (1984).

  18. Asymptotics of Graphical Projection Pursuit, Ann. Stat., 12 3:793-815. (1984). [PDF]

  19. On Inconsistent Bayes' Estimates of Location, Ann. Stat., 14 1:68-87. [PDF]

  20. On the Consistency of Bayes Estimate, Ann. Stat., 14 1:1-26. (1986). [PDF]

  21. An Elementary Proof of Stirling's Formula, Amer. Math'l Monthly, 93 123-125. (1986).

  22. A dozen de Finetti-style Results in Search of a Theory. Ann. Inst. Henri Poincaré, Probabilités et Statistiques, 23Sup.2:397-423, (1987).

  23. Conditional Limit Theorems for Exponential Families with Uniform Asymptotic Estimates and Applications to de Finetti's Theorem, J. Theoretical Prob., 1 381-410 (1988)

  24. On Merging of Probabilities, with A. D'Aristotile Sankhya, Series A, 50 363-380. (1988).

  25. On the Uniform Consistency of Bayes Estimates for Multinomial Probabilities, Ann. Stat., 18 3:1317-1327. (1990). [PDF]

  26. Cauchy's Equation and de Finetti's Theorem, Jour. Statist., 17 235-250. (1990).

  27. NonParametric Binary Regression with Random Covariates. With D. Freedman. Prob. and Math. Stat., 15 243-273. (1993). [PDF]

  28. Non-Parametric Binary Bayesian Regression: A Bayesian Approach. With D. Freedman, Ann. Stat., 21 2108-2137. (1993). [PDF]

  29. Consistency of Bayes Estimates for Nonparametric Regression: A Review. In D. Pollard, et al. (eds), Festschrift for Lucien LeCam, pp. 157-66, New York: Springer-Verlag (1997).

  30. Consistency of Bayes Estimates for Nonparametric Regression: Normal Theory, Bernoulli 4 411-44. (1998). [PDF]

  31. Iterated Random Functions, SIAM Review 41 1:45-76. (1999). [PDF]

  32. The Markov moment Problem and de Finetti's Theorem Part I. With David Freedman. Math. Zeitschrift, 247 1:183-199 (2004). [PDF]

  33. The Markov Moment Problem and de Finetti's Theorem Part II. With David Freedman. Math, Zeitschrift. 247 1:201-212. (2004). [PDF]

Jason Fulman

top

Jason Fulman, USC Research Computing Facility


  1. Carries, Shuffling, and Symmetric Function. With J. Fulman. (2009). Submitted. [PDF]

  2. Carries, Shuffling,and An Amazing Matrix. With J. Fulman. (2008). [PDF] arXiv:0902.0179

  3. On Fixed Points of Permutation. With. J. Fulman and R. Guralnick. (2007). To appear in Journal of Algebraic Combinatorics [PDF]

Ronald L. Graham

top

Ronald L. Graham, Department of Computer Science and Engineering, University of California, San Diego
e-mail: graham AT ucsd DOT edu


  1. Spearman's Footrule as a Measure of Disarray, with R. Graham. J. Royal Stat'l Soc. B 39 262-8.[PDF]

  2. The Analysis of Sequential Experiments with Feedback to Subjects, with R. Graham, Ann. Stat., 9 3-23.[PDF]

  3. On the Permanents of Complements of the Direct Sum of Identity Matrices, with F. R. K. Chung , R. L. Graham and C. L. Mallows. Advances in Applied Math., 2 121-137. [PDF]

  4. The Mathematics of Perfect Shuffles, with R. L. Graham and W. M. Kantor, Advances in Applied Math., 4 175-196. [PDF]

  5. The Radon Transform on Z^k_2 , with R. L. Graham, Pacific J. Math, 118 323-345. [PDF]

  6. Random Walks Arising in Random Number Generation, with F. R. K. Chung and R. L. Graham, Ann. Prob., 15 1148-1165.[PDF]

  7. Asymptotic Analysis of a Random Walk on a Hypercube with Many Dimensions, with R. L. Graham and J. A. Morrison, Random Structures and Algorithms, 1 51-72. [PDF]

  8. Universal Cycles for Combinatorial Structures, with F. Chung, R. Graham, Discrete Math, 110 43-59. [PDF]

  9. An Affine Walk on the Hypercube, with R.L. Graham, Quat. Jour. Analysis, 41 215-235. [PDF]

  10. Binomial Coefficient Codes Over GF(2), with R.L. Graham, Discrete Math., 106/107 181-188. [PDF]

  11. Primitive Partition Identities, with Ron Graham and Bernd Sturmfels, Conbinatorics - Paul Erdos is eighty , D. Miklos, V. Sos, T. Szoni (eds.), 43-56. Bolyai Society Mathematical Studies,2, Budapest, 173-192. [PDF]

  12. The Graph of Generating Sets of an Abelian Group, with R. L. Graham, Colloquium Math., 31-8. [PDF]

  13. Statistical Problems Involving Permutation with Restricted Positions. With R. L. Graham and S. Holmes. In State of the Artin Probability and Statistics. M.de Gunst, C. Klaassen, A. Van der Vaart, ed. Inst. Math. Statis. Hayward. 195-222. [PDF] [PostScript]

  14. Combinatorics for the East Model, with Ron Graham and F. R. K. Chung , Adv. Appl. Math. 27 192-206. [PDF]

  15. The Solutions to Elmsley's Problems; with R. Graham. Mathematics magazine (2006). [PDF]

  16. Products of Universal Cycles; with R. Graham. To appear in AGathering for Gardner, Edited by E. Demain (2005). [PDF]

Susan Holmes

top

Susan Holmes, Department of Statistics, Stanford University
e-mail: susan AT stat DOT stanford DOT edu


  1. Analysis of a Non-Reversible Markov Chain Sampler, with Susan Holmes and Radford Neal, Ann. Appl. Probab. 10 726-52. [PostScript]

  2. Are There Still Things to Do in Bayesian Statistics?, Erkenntnis: Probability, Dynamics and Causality 45 145-58 (1997).

  3. A Bayesian Peek Into Feller I, with Susan Holmes, Sankhya A, 64 820-841. (2000). [PDF]

  4. Dynamical Bias in the Coin Toss. With Susan Holmes and Richard Montgomery. To appear in SIAM Review. [PDF]

  5. Gray Codes for Randomization Procedures, Statistics and Computing, 4 287-302. (1994). [PDF]

  6. Matchings and Phylogenetic Trees, with Susan Holmes. Proc. Nat. Acad. Sci. 95 14600-2. (1998). [PDF]

  7. Metrics on Compositions and Coincidences, with S. Janson, S.P. Lalley and R. Pemantle. In D. Aldous, R. Pemantle (eds), Random Discrete Structures, IMA Publications, Springer-Verlag, pp. 81-102 (1996).

  8. Random Walk on Trees and Matchings. With Susan Holmes. Electronic Jour. Probab. 7 Paper 6, 1-17. [PDF]

  9. Sequential Monte Carlo Methods for Statistical Analysis of Tables. Journal of the American Statistical Association, 100, 109-120. With Chen, Y., Holmes, S. and Liu, J.S. (2005). [PDF]

  10. Statistical Problems Involving Permutation with Restricted Positions. With R. L. Graham and S. Holmes. In State of the Artin Probability and Statistics. M.de Gunst, C. Klaassen, A. Van der Vaart, ed. Inst. Math. Statis. Hayward. 195-222. [PDF] [PostScript]

  11. Stein's Method for Markov Chains: First Examples. P. Diaconis and S. Holmes (EDS). Stein's Method: Expository Lectures and Applications pp 27-43. IMS, Beachwood, Ohio. (2004)

  12. Three Examples of the Markov Chain Monte Carlo Method, Discrete Probability and Algorithms, D. Aldous et al (eds). 43-56. Springer-Verlag, New York (1994). [PDF]

  13. Uses of Exchangeable Pairs in Monte Carlo Markov Chains. WithC. Stein, S. Holmes, G Reinert. In P. Diaconis, S. Holmes (EDS) Stein's Method: Expository Lectures and Applications pp 1-26. (2004)

  14. Horseshoes in Multidimensional Scaling and Kernel Methods. With S. Goel and S. Holmes. (2007). Ann. Appl. Stat. 2 (3):777-807. [PDF]

Svante Janson

top

Svante Janson, Department of Mathematics, Uppsala University
e-mail: svante DOT janson AT math DOT uu DOT se


  1. Threshold Graph Limits and Random Threshold Graphs. With S. Holmes and S. Janson. (2009). arXiv:0908.2448v1 [math.CO] [PDF]

  2. Graph Limits and Exchangeable Random Graphs. With S. Janson. (2008). Rendiconti di Matematica, Serie VII 28:33-61. [PDF]

  3. Metrics on Compositions and Coincidences, with S. Holmes, S.P. Lalley and R. Pemantle. In D. Aldous, R. Pemantle (eds), Random Discrete Structures, IMA Publications, Springer-Verlag, pp. 81-102 (1996).

K. Khare

top



  1. Gibbs sampling, exponential families and orthogonal polynomials. With K. Khare and L. Saloff-Coste.(2008). Statistical Science, 23(2):151-178. DOI: 10.1214/07-STS252.
  2. Rejoinder: Gibbs Sampling, Exponential Families and Orthogonal Polynomials. With K. Khare and L. Saloff-Coste. (2008). Statistical Science, 23(2):196-200. DOI:10.1214/08-STS252REJ

  3. Stochastic Alternating Projections. With K. Khare and L. Saloff-Coste. (2007). To appear in: t.b.a. [PDF]

Gilles Lebeau

top

  1. Geometric Analysis for the Metropolis Algorithm on Lipschitz Domains. With Gilles Lebeau, à Laurent Michael. Submitted. [PDF]

  2. Micro-local Analysis for the Metropolis Algorithm. With G. Lebeau. (2007). To appear in: Math. Z. [PDF]

Frederick Mosteller

top

Frederick Mosteller, Department of Statistics, Harvard University


  1. Second Order Terms for the Variances and Covariances of the Number of Prime Factors - Including the Square Free Case, J. Number Theory, 9 187-202. Joint with Hironari Onishi (1977). [PDF]

  2. Methods for studying Coincidences, Jour. Amer. Statist. Ann., 84 408:853-861. (1989). [PDF]

  3. Theories of Data Analysis: From Magical Thinking Through Classical Statistics, Exploring Data Tables, Trends and Shapes, D. Hoaglin, F. Mosteller, J. Tukey (eds.) Wiley, New York pp 1-36

P. Parrilo

top



  1. Fastest Mixing of Markov Chain on Graphs With Symmetries. With P. Parrilo, S. Boyd and L. Xiao. (2006). [PDF]

  2. Symmetry Analysis of Reversible Markov Chains. With S. Boyd, P. Parrilo, L. Xiao. Journal of Internet Mathematics 2 31-72. [PDF]

Jim Pitman

top

Jim Pitman, Department of Statistics , UC Berkeley
e-mail: pitman AT stat DOT Berkeley DOT edu


  1. Analysis of Top to Random Shuffles, with Jim Fill, Combinatorics, Probability Computing, 1 135-155 (1992)

  2. Riffle Shuffles, Cycles and Descents, with M. McGrath and Jim Pitman, Combinatorica, 15 11-29

Dan Rockmore

top

Dan Rockmore, Departments of Computer Science and Mathematics, Dartmouth College
e-mail: rockmore AT cs DOT dartmouth DOT edu


  1. Efficient Computation of the Fourier Transform on Finite Groups, with Dan Rockmore, Journ. Amer. Math. Soc., 31 297-332. (1990)

  2. Efficient Computation of Isotypic Projections for the Symmetric Group. L. Finkelstein and W. Kantor (eds.), DIMACS Series in Disc. Math. and Theor. Comp. Sci. 11 87-104. (1993) [PS]

Laurent Saloff-Coste

top

Laurent Saloff-Coste, Department ofMathematics, Cornell University
e-mail: lsc AT math DOT cornell DOT edu


  1. Comparison Techniques for Random Walk on Finite Groups. With L. Saloff-Coste, Ann. Prob., 21 4:2131-2156. [PDF]

  2. Comparison Theorems for Reversible Markov Chains. With L. Saloff-Coste, Ann. Appl. Prob, 3 3:696-730. [PDF]

  3. What Do We Know About the Metropolis Algorithm? With L. Saloff-Coste, Jour. Comp. System Sciences, 57 20-36. [PDF]

  4. Walks on Generating Sets of Groups, with Laurent Saloff-Coste, Inventiones Math., 134 251-300. [PDF]

  5. Nash Inequaltites for Finite Markov Chains. With L. Saloff-Coste, Journal of Theoretical Probability, 9 459-510. [PS]

  6. Walks on Generating Sets of Abelian Groups. With L. Saloff-Coste, Prob. Theory Related Fields, 105 393-421. [PDF]

  7. Logarithmic Sobolev Inequalities for Finite Markov Chains. With L. Saloff-Coste, Ann. Appl. Prob, 6 695-750. [PDF]

  8. Random Walks on Finite Groups: A Survey of Analytic Techniques, with Laurent Saloff-Coste, Prob. Meas. on Groups XI, H. Heyer (ed.), World Scientific Singapore, pp. 44-75. [PDF]

  9. The Cut-off Phenomena in Finite Markov Chains, Proc. Nat. Acad. Sci., 93 1659-1664. [PDF]

  10. Moderate Growth and Random Walk on Finite Groups, Geom. Func. Anal. 4 1-36 (1994).

  11. An Application of Harnack inequalities to Random Walk on Nilpotent Quotients, Jour. Fourier Analysis Applications, Kahane Special Issue, 189-207 (1995).

  12. Bounds for Kac's Master Equation, with Laurent Saloff-Coste, Communications Math. Phys., 209 729-55. [PDF]

  13. Gibbs Sampling, Exponential Families, and Coupling. With K. Khare and L. Saloff-Coste. (2007). To appear in: t.b.a. [PDF]

  14. Separation Cut-Offs for Death and Birth Chain; With Saloff-Coste, L. Ann. of Appl. Prob. 16 4: 2098-2122. (2005). [PDF]

  15. Stochastic Alternating Projections. With K. Khare and L. Saloff-Coste. (2007). To appear in: t.b.a. [PDF]

Mehrdad Shahshahani

top

Mehrdad Shahshahani, Jet Propulsion Laboratory


  1. Generating a Random Permutation with Random tratnspositions, Z. Wahr. verw. Gebiete, 57 159-179 (1981)

  2. On Nonlinear Functions of Linear Combinations, SIAM, J. Sci. Stat. Comput., 5 175-191. (1984). [PDF]

  3. Products of Random Matrices and Computer image Generation, Contemporary Math., 50 173-182 (1986)

  4. Products of Random Matrices as they Arise in the study of Random Walks on Groups, Contemporary Math., 50 183-195. (1986).

  5. On Square Roots of the Uniform Distribution on Compact Groups, Proc. Amer. Math'l Society, 98 341-348. (1986). [PDF]

  6. Time to Reach Stationarity in the Bernoulli-Laplace Diffusion Model, SIAM J. Math'l Analysis, 18 208-218. (1987). [PDF]

  7. The Subgroup Algorithm for Generating Uniform Random Variables, Prob. in Eng. and Info. Sci., 1 15-32 (1987)

  8. On the Eigenvalues of Random Matrices, Jour. Appl. Prob, Special 31A, 49-62. (1994). [PDF]

Bernd Sturmfels

top

Bernd Sturmfels, Department of Mathematics , UC Berkeley
e-mail: bernd AT math DOT berkely DOT edu


  1. Primitive Partition Identities, with Ron Graham, Combinatorics - Paul Erdos is Eighty, Bolyai Society Mathematical Studies, Budapest, 2 173-92 (1996). [PDF]

  2. Algebraic Algorithms for Sampling from Conditional Distributions, Ann. Statist. 26 363-97 (1998). [PDF]

  3. Lattice Walks and Primary Decomposition, with D. Eisenbud and B. Sturmfels, Mathematical Essays in Honor of Gian-Carlo Rota, B. Sagan and R.P. Stanley (eds.), 173-94

L. Xiao

top



  1. Fastest Mixing of Markov Chain on a Graph and a Connection to a Maximum Variance Unfolding Problem. With J. Sun, S. Boyd and L. Xiao. SIAM Review, 48(4):681-699. (2006). [PDF]

  2. Fastest Mixing of Markov Chain on Graphs With Symmetries. With P. Parrilo, S. Boyd and L. Xiao. (2006). [PDF]

  3. Fastest Mixing Markov Chain on a Path. With S. Boyd and L. Xiao. American Mathematics Monthly (2006). [PDF]

  4. Symmetry Analysis of Reversible Markov Chains. With S. Boyd, P. Parrilo, L. Xiao. Journal of Internet Mathematics 2 31-72. [PDF]

  5. Fastest Mixing Markov Chain on a Graph. (2004). With S. Boyd and L. Xiao. SIAM Review 46(4):667-689. [PDF]

Don Ylvisaker

top

DonYlvisaker, Department of Statistics , UCLA
e-mail: ndy AT stat DOT ucla DOT edu


  1. Conjugate Priors for Exponential Families, Ann. Stat., 7 2:269-281. (1979) [PDF]

  2. Quantifying Prior Opinion, Bayesian Statistics 2. Proc. 2nd Valencia Int'l Meeting, 9-83. J. M. Bernardo, M. H. Degroot, D. V. Lindley, A. F. M. Smith (eds.) North-Holland, Amsterdam 133-156 (1985).

Sandy Zabell

top

Sandy Zabell, Department of Statistics , Northwestern University
e-mail: zabell AT math DOT nwu DOT edu


  1. Updating Subjective Probability, JASA, 77 380:822-830. (1982). [PDF]

  2. Some Alternatives to Bayes' Rule, Information and Group Decision Making, Proc. Second Univ. of Calif. Irvine Conf. Political Economy, B. Grofman, G. Owen (eds.) Jai Press, Greenwich, CT, 25-38. (1985).

  3. Closed Form Summation for Classical Distributions: Variations on a Theme of Demoivre. With S. Zabell, Statistical Sci., 61 3:284-302. (1991). [PDF]