Home
Focus Groups
Staff
Contact
Links




















Stanford Home

Students



Ali Rejali Probability Theory and Additive Number Theoretic Functions (Stanford)
Richard Greer Consistent Nonparametric Estimation of Best Linear Classification Rules - Solving Inconsistent Systems of Linear Equalities. (Stanford)
Arif Zaman Finite Forms of de Finett's Theorem of Markov Chains. (Stanford)
Hani Doss Bayesian Nonparametric Estimation of Location. (Stanford)
Douglas Critchlow The Metric Method for Partially Ranked Data. (Harvard)
Peter Matthews The Waiting Time to Cover a Group in Random Walk. (Stanford)
Richard Deveaux The Mixture of Normal Regression Problems. (Stanford)
Alex McMillan Robustness of the James-Stein Estimator. (Stanford)
Andrew Greenhalgh Probability Measures with Subgroup Invariance Properties. (Stanford)
Daniel Rockmore Fast Fourier analysis for finite groups. (Harvard)
Robin Pemantle Random Walk with Reinforcement. (MIT)
Martin Hildebrand Rates of Convergence of Some Random Procession Finite Groups. (Harvard)
Anil Gangolli Convergence Bounds for Markov Chains and Applications to Sampling Schemes. (Stanford)
Eric Belsley Rates of Convergence of Markov Chains Related to Association Schemes. (Harvard)
Jeffrey Rosenthal Rates of Convergence for Gibbs Sampler and other Markov Chains. (Harvard)
Carl Dou Studies of Random Walks on Groups and Random Graphs. (MIT)
David Maslen Fast Transforms and Sampling for Compact Groups. (Harvard)
Eric Rains Topics in Probability Compact Lie Groups. (Harvard)
Francis Su Measuring Rates of Convergence of Random Walks on Groups. (Harvard)
David Steinstaltz Socks and Boxes: Variations on Bernoulli's Marriage Problem. (Harvard)
Brad Mann A berry_Esseen Theorem for Markov Chains. (Harvard)
Farid Bassiri Random Walks on Groups with Multiplicity Two. (Harvard)
Jeffrey Silver Rates of Convergence in the Metropolis Algorithm. (Harvard)
Nathan Lulov Random Walk on Involutions. (Harvard)
Jason Fulman Probability in the Classical Groups over Finite Fields. (Harvard)
Igor Pak Random Walk on Groups: Strong Uniform Time Approach. (Harvard)
Kelly Wieand Eigenvalue Distributions of Random Matrices in the Permutation Group and Compact Lie Groups. (Harvard)
Elizabeth Wilmer Rate of Convergence for some Non-reversible Markov Chains. (Harvard)
Asya Taken Monte Carlo Goodness of Fit Tests of Discrete Data. (Stanford)
Thomas Yan A Rigorous Analysis of the Creutz Demon Algorithm for the Microcanonical, One-dimensional Ising Model. (Cornell)
Jay-Calvin Uyemura-Reyes Random Walk, Semi-direct Products and Card Shuffling. (Stanford)
Marc Coram Bayesian Non-parametric Discrimanent Analysis. (Stanford)
Arnab Chakrabourty An Attempt at optical character recognition for the Bengali Language (Stanford)
Sourav Chatterjee Concentration Inequalities with Exchangeable Pairs (Stanford)
Joseph Blitzstein From Characterization to Algorithm (Stanford)
Elizabeth Meckes An Infinitesimal Version of SteinÕs Method (Stanford)
Daniel Ford The Alpha Model for Phylogenetic Trees (Stanford)
Julia Salzman Spectral Analysis for Discrete Data using Markov Chains (Stanford)
Geir Helliloid Enumerative Theory of Automorphisims of Finite p-Groups (Stanford)

Contact |  Directories |  Maps &  Directions
Copyright 2003 Stanford University. All Rights Reserved. Stanford, CA 94305, (650) 723-2300 Terms of Use Copyright Complaints