World's Best Scientists 2026 revealed!

Research.com Recognitions

  • 2015 - Fellow of the American Mathematical Society For contributions to theory and applications of Markov chains and to probabilistic analysis of algorithms.

Overview

James Allen Fill is affiliated with Johns Hopkins University in the United States. Their research spans the fields of Mathematics and Computer Science, with a focus on several subfields including Mathematical Physics, Artificial Intelligence, Statistics and Probability, Management Science and Operations Research, and Computational Theory and Mathematics.

The scientist's work primarily addresses topics such as stochastic processes and statistical mechanics, Bayesian methods and mixture models, Markov chains and Monte Carlo methods, mathematical dynamics and fractals, statistical methods and inference, probability and risk models, and algorithms and data compression.

Recent publications by James Allen Fill include:

  • The Pareto record frontier (2020, Electronic Journal of Probability)
  • The sum of powers of subtree sizes for conditioned Galton-Watson trees (2022, Electronic Journal of Probability)
  • Breaking multivariate records (2023, Electronic Journal of Probability)
  • Breaking bivariate records (2020, Combinatorics Probability Computing)
  • Special Issue on Analysis of Algorithms (2020, Algorithmica)

The scientist frequently publishes in the following venues:

  • arXiv (Cornell University)
  • Electronic Journal of Probability
  • Combinatorics Probability Computing
  • Algorithmica
  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Coauthorship is an important aspect of their research, with frequent collaborators including:

  • Svante Janson
  • Ao Sun
  • Daniel Q. Naiman
  • Wei-Chun Hung
  • Mark Daniel Ward

In 2015, James Allen Fill was recognized as a Fellow of the American Mathematical Society for contributions to the theory and applications of Markov chains and the probabilistic analysis of algorithms.

Best Publications

  • Reversible Markov Chains and Random Walks on Graphs

    David Aldous;James Allen Fill

  • An interruptible algorithm for perfect sampling via Markov chains

    James Allen Fill

  • Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process

    James Allen Fill

  • Strong Stationary Times Via a New Form of Duality

    Persi Diaconis;James Allen Fill

  • Continuum percolation with steps in the square or the disc

    Paul Balister;Béla Bollobás_aff n;Mark Walters_aff n

  • Analysis of Top To Random Shuffles

    Persi Diaconis;James Allen Fill;Jim Pitman

  • Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models

    James Allen Fill;Edward R. Scheinerman;Karen B. Singer-Cohen

  • The Moore--Penrose Generalized Inverse for Sums of Matrices

    James Allen Fill;Donniell E. Fishkind

  • On the distribution for the duration of a randomized leader election algorithm

    James Allen Fill;Hosam M. Mahmoud;Wojciech Szpankowski

  • Extension of Fill's perfect rejection sampling algorithm to general chains

    James Allen Fill;Motoya Machida;Duncan J. Murdoch;Jeffrey S. Rosenthal

  • An Exact Formula for the Move-to-Front Rule for Self-Organizing Lists

    James Allen Fill

  • Quicksort asymptotics

    James Allen Fill;Svante Janson

  • Singularity analysis, Hadamard products, and tree recurrences

    James Allen Fill;Philippe Flajolet;Nevin Kapur

  • On Hitting Times and Fastest Strong Stationary Times for Skip-Free and More General Chains

    James Allen Fill

  • The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof

    James Allen Fill

  • Strong stationary duality for continuous-time Markov chains. Part I: Theory

    James Allen Fill

  • Limits and rates of convergence for the distribution of search cost under the move-to-front rule

    James Allen Fill

  • On the distribution of binary search trees under the random permutation model

    James Allen Fill

  • Total Path Length for Random Recursive Trees

    Robert P. Dobrow;James Allen Fill

  • Percolation, First-Passage Percolation and Covering Times for Richardson's Model on the $n$-Cube

    James Allen Fill;Robin Pemantle

Frequent Co-Authors

Svante Janson
Svante Janson Uppsala University
Jeffrey S. Rosenthal
Jeffrey S. Rosenthal University of Toronto
Persi Diaconis
Persi Diaconis Stanford University
Jim Pitman
Jim Pitman University of California, Berkeley
Philippe Flajolet
Philippe Flajolet French Institute for Research in Computer Science and Automation - INRIA
Robin Pemantle
Robin Pemantle University of Pennsylvania
Oliver Riordan
Oliver Riordan University of Oxford
Wojciech Szpankowski
Wojciech Szpankowski Purdue University West Lafayette
Béla Bollobás
Béla Bollobás University of Memphis
David B. Wilson
David B. Wilson Washington University in St. Louis

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to various interdisciplinary career paths that combine analytical skills with business acumen. For those interested in leadership roles, pursuing an fastest online mba can provide strategic management expertise alongside quantitative insights, accelerating career growth without long-term study commitments.

Finance is another popular avenue where mathematical skills are indispensable. Graduates can enhance their credentials by enrolling in an online masters in finance, which offers affordable ways to gain advanced knowledge in financial modeling, investment analysis, and risk management.

For entrepreneurs and business professionals seeking to elevate their credentials, the cheapest dba online options provide an accessible path to earn a Doctorate in Business Administration. This degree blends research with practical leadership skills, ideal for those aiming to influence business strategies through data-driven decisions.

Additionally, the digital economy demands expertise in marketing analytics. Pursuing an ms in digital marketing degree cost tuition fees program can be a cost-effective way to gain skills in data analysis and digital strategy, paving the way for high-paying roles in marketing and beyond.

Best Scientists Citing James Allen Fill

Trending Scientists

Recently Published Articles