Follow
James Allen Fill
James Allen Fill
Professor of Applied Mathematics and Statistics, The Johns Hopkins University
Verified email at jhu.edu - Homepage
Title
Cited by
Cited by
Year
Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
JA Fill
The annals of applied probability, 62-87, 1991
4031991
Reversible Markov chains and random walks on graphs
D Aldous, J Fill
3851995
Strong stationary times via a new form of duality
P Diaconis, JA Fill
The Annals of Probability 18 (4), 1483-1522, 1990
3141990
An interruptible algorithm for perfect sampling via Markov chains
JA Fill
Proceedings of the twenty-ninth annual ACM symposium on Theory of computing …, 1997
3081997
Reversible markov chains and random walks on graphs, 2002. Unfinished monograph, recompiled 2014
D Aldous, JA Fill
246*2002
Reversible Markov chains and random walks on graphs, 2002
D Aldous, J Fill
Unfinished monograph, recompiled 2002, 2014
1432014
Analysis of top to random shuffles
P Diaconis, JA Fill, J Pitman
Combinatorics, probability and computing 1 (2), 135-155, 1992
1201992
Random intersection graphs when m=ω(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models
JA Fill, ER Scheinerman, KB Singer‐Cohen
Random Structures & Algorithms 16 (2), 156-176, 2000
1142000
The Moore--Penrose Generalized Inverse for Sums of Matrices
JA Fill, DE Fishkind
SIAM Journal on Matrix Analysis and Applications 21 (2), 629-635, 2000
1082000
An exact formula for the move-to-front rule for self-organizing lists
JA Fill
Journal of Theoretical Probability 9 (1), 113-160, 1996
981996
Extension of Fill's perfect rejection sampling algorithm to general chains
JA Fill, M Machida, DJ Murdoch, JS Rosenthal
Random Structures & Algorithms 17 (3‐4), 290-316, 2000
952000
On the distribution for the duration of a randomized leader election algorithm
JA Fill, HM Mahmoud, W Szpankowski
The Annals of Applied Probability, 1260-1283, 1996
941996
Singularity analysis, Hadamard products, and tree recurrences
JA Fill, P Flajolet, N Kapur
Journal of Computational and Applied Mathematics 174 (2), 271-313, 2005
822005
Quicksort asymptotics
JA Fill, S Janson
Journal of Algorithms 44 (1), 4-28, 2002
792002
On the distribution of search cost for the move‐to‐front rule
JA Fill, L Holst
Random Structures & Algorithms 8 (3), 179-186, 1996
711996
Percolation, first-passage percolation and covering times for Richardson's model on the n-cube
JA Fill, R Pemantle
The Annals of Applied Probability, 593-629, 1993
691993
On hitting times and fastest strong stationary times for skip-free and more general chains
JA Fill
Journal of Theoretical Probability 22 (3), 587-600, 2009
682009
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
JA Fill
Journal of Theoretical Probability 22 (3), 543-557, 2009
672009
On the distribution of binary search trees under the random permutation model
JA Fill
Random Structures & Algorithms 8 (1), 1-25, 1996
641996
Stochastic monotonicity and realizable monotonicity
JA Fill, M Machida
Annals of probability, 938-978, 2001
632001
The system can't perform the operation now. Try again later.
Articles 1–20