Concepedia

James Allen Fill

JA

48

Publications

3.4K

Citations

27

H-Index

1983

Active since

Affiliations

Johns Hopkins University(Current)

California Institute of Technology

Uppsala University

James Allen Fill is an author at Johns Hopkins University specializing in engineering, probability theory, and computer science.

Top concepts

EngineeringProbabilityComputer ScienceStatisticsCombinatorial OptimizationDiscrete MathematicsMathematical ProgrammingComputational ComplexityStochastic CalculusStochastic Processes

Publications per year

1983–2016

48

Publications

48

Reversible Markov Chains and Random Walks on Graphs

David Aldous, James Allen Fill · 2014 · 949 citations

Directed Graph, Engineering, Random Walks +5

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

James Allen Fill · The Annals of Applied Probability · 1991 · 336 citations · Full text

Spectral Theory, Engineering, Poisson Blockers Problem +13

Strong Stationary Times Via a New Form of Duality

Persi Diaconis, James Allen Fill · The Annals of Probability · 1990 · 268 citations · Full text

Stochastic Hybrid System, New Form, Strong Stationary Time +14

An interruptible algorithm for perfect sampling via Markov chains

James Allen Fill · The Annals of Applied Probability · 1998 · 176 citations · Full text

Sampling (Signal Processing), Engineering, Computational Complexity +16

Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models

James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen · Random Structures and Algorithms · 2000 · 112 citations

Geometric Graph Theory, Network Science, Graph Theory +13

Rows per page

1–5 of 48