James Allen Fill (Jim Fill)
	Professor of Applied Mathematics and Statistics
	Professor of Computer Science
	Department of Applied Mathematics and Statistics
	(formerly Department of Mathematical Sciences)
	The Johns Hopkins University
	Baltimore, MD 21218-2682
	Office:   Whitehead Hall 306-F
	Phone:   (410) 516-7219
	FAX:   (410) 516-7459
	E-mail:   jimfill@jhu.edu

Research Interests

Probability, stochastic processes (esp. Markov chains), random structures and algorithms

Education

• Ph.D. Statistics, University of Chicago, 1980

• M.S. Statistics, University of Chicago, 1979

• B.S. Mathematics and Statistics, University of Illinois, 1976

Monograph

• David J. Aldous and I are writing a book, Reversible Markov Chains and Random Walks on Graphs. Follow the title link for more information.

Selected Recent Technical Reports Available [in Portable Document Format (pdf)]

• The Space Requirement of m-ary Search Trees: Distributional Asymptotics for m ≥ 27. Coauthor: Nevin Kapur. (Last revised May, 2004.) Technical Report, Department of Applied Mathematics and Statistics, The Johns Hopkins University. Invited submission in May, 2004 to Proceedings of the 7th Iranian Statistical Conference.

• Exact Expectations of Minimal Spanning Trees for Graphs with Random Edge Weights. Coauthor: J. Michael Steele. (Last revised April, 2004.) Technical Report, Department of Applied Mathematics and Statistics, The Johns Hopkins University. Submitted in April, 2004 to Proceedings of the Symposium "Stein's Method and Applications: A Program in Honor of Charles Stein".

• Asymptotic Analysis via Mellin Transforms for Small Deviations in $L^2$-norm of Integrated Brownian Sheets. Coauthor: Fred Torcaso. (Last revised March, 2004.) Probability Theory and Related Fields (2004), to appear.

• The Number of Bit Comparisons Used by Quicksort: An Average-case Analysis. Coauthor: Svante Janson. (Last revised October, 2003.) Refereed extended abstract, pages 293-300 in Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA04), 2004.

• Limiting Distributions for Additive Functionals on Catalan Trees. Coauthor: Nevin Kapur. (Last revised April, 2004.) Theoretical Computer Science (2004), to appear.

• Singularity Analysis, Hadamard Products, and Tree Recurrences. Coauthors: Philippe Flajolet and Nevin Kapur. (Last revised June, 2003.) Journal of Computational and Applied Mathematics (2004), to appear.

• Transfer Theorems and Asymptotic Distributional Results for m-ary Search Trees. Coauthor: Nevin Kapur. (Last revised January, 2004.) Random Structures & Algorithms (2004), to appear.

• Speeding Up the FMMR Perfect Sampling Algorithm: A Case Study Revisited. Coauthor: Robert P. Dobrow. (Last revised June, 2003.) Random Structures & Algorithms 23:434-452 (2003).

• Interruptible Exact Sampling in the Passive Case. Coauthor: Keith Crank. (Last revised October, 2002.) Special International Workshop on Applied Probability issue, Methodology and Computing in Applied Probability 4:359-376 (2002).

• Quicksort Asymptotics, with an unpublished Appendix. Coauthor: Svante Janson. (Last revised May, 2002.) Special issue on Analysis of Algorithms, Journal of Algorithms 44:4-28 (2002).

• Approximating the Limiting Quicksort Distribution. Coauthor: Svante Janson. (Last revised August, 2001.) Special issue on Analysis of Algorithms, Random Structures & Algorithms 19:376-406 (2001).

• Realizable Monotonicity and Inverse Probability Transform. Coauthor: Motoya Machida. (Last revised September, 2000.) Refereed article, to apppear in Proceedings of Distributions with Given Marginals and Statistical Modelling (eds.: C. M. Cuadras, J. Fortiana, and J. Rodriguez-Lallena), published in 2001 by Kluwer Academic Publishers.

• The Randomness Recycler: A New Technique for Perfect Sampling. Coauthor: Mark Huber. (Last revised August, 2000.) Refereed extended abstract, pages 503-511 in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000. The Randomness Recycler Approach to Perfect Sampling. Coauthor: Mark Huber. (Last revised April, 2001.) Short paper presented at the Invited Papers Meeting on Perfect Simulation, 53rd Session of the International Statistical Institute, Seoul, Korea, in August, 2001.

• Mixing Times for Markov Chains on Wreath Products and Related Homogeneous Spaces. Coauthor: Clyde H. Schoolfield, Jr. (Last revised June, 2000.) Electronic Journal of Probability 6, Paper No. 11, 1-22 (electronic) (2001).

• Perfect Simulation from the Quicksort Limit Distribution. Coauthors: Luc Devroye and Ralph Neininger. (Last revised June, 2000.) Electronic Communications in Probability 5:95-99 (electronic) (2000).

• A Characterization of the Set of Fixed Points of the Quicksort Transformation. Coauthor: Svante Janson. (Last revised June, 2000.) Electronic Communications in Probability 5:77-84 (electronic) (2000).

• Smoothness and Decay Properties of the Limiting Quicksort Density Function. Coauthor: Svante Janson. (Last revised June, 2000.) Refereed article, pages 53-64 in Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities (eds.: D. Gardy and A. Mokkadem), a volume in the series Trends in Mathematics, Birkhäuser Verlag, 2000.

• Extension of Fill's Perfect Rejection Sampling Algorithm to General Chains. Coauthors: Motoya Machida, Duncan J. Murdoch, and Jeffrey S. Rosenthal. Refereed extended abstract (a user-friendly version; last revised September, 1999): pages 37-52 in Monte Carlo Methods (ed.: N. Madras), Fields Institute Communications 26, American Mathematical Society, 2000. Full paper (version including technical details; last revised July, 2000): Random Structures & Algorithms 17:290-316 (2000).

• Stochastic Monotonicity and Realizable Monotonicity. Coauthor: Motoya Machida. (Last revised November, 2000.) Annals of Probability 29:938-978 (2001).

• The Moore-Penrose Generalized Inverse for Sums of Matrices. Coauthor: Donniell E. Fishkind. (Last revised September, 1998.) SIAM Journal on Matrix Analysis and Applications 21:629-635 (1999).

• An Interruptible Algorithm for Perfect Sampling via Markov Chains. (Last revised February, 1998.) Annals of Applied Probability 8:131-162 (1998).

• Department Home page.

Last modified July 9, 2004 by Jim Fill