基本信息
浏览量:0
职业迁徙
个人简介
Fill’s research on Markov chains has focused on rates of convergence to stationarity, hitting times, and perfect simulation. He co-authored work introducing and developing strong stationary duality (SSD), a powerful technique for bounding mixing times for Markov chains, and he has written several papers applying SSD and other techniques to probabilistic analysis of self-organizing data structures for dynamic file maintenance. In addition, he created two general algorithms, “Fill’s algorithm” and “Randomness Recycler,” that modify existing Markov chain Monte Carlo algorithms to produce samples perfectly from a desired (stationary) distribution.
Fill is a leader in the analysis of algorithms (AofA) community. He is known for a series of papers with Svante Janson of Uppsala University giving an in-depth analysis of the QuickSort sorting algorithm, the AofA revolution he has led by providing more realistic analyses of key-comparison algorithms such as QuickSort and QuickSelect in terms of symbol-comparison counts, and his fundamental work with the late Philippe Flajolet and Nevin Kapur on the singularity analysis of Hadamard products of generating functions. All told, he has written more than 25 AofA-related papers.
Fill has made research contributions on a variety of additional topics, including large deviation probabilities, small deviations, percolation, and first-passage percolation, random graphs, minimal spanning trees, Radon transforms, projection pursuit, matrix analysis, partially ordered sets, applied game theory, partitions, and mathematical problems in music.
Current interests include the geometry and simulation of multivariate (Pareto) records.
Fill is a Fellow of the American Mathematical Society and of the Institute of Mathematical Statistics, and a member of the American Statistical Association, the Association for Computing Machinery, and the Mathematical Association of America. He also is the long-standing editor-in-chief of the Journal of Theoretical Probability and has been an associate editor for the Annals of Applied Probability, the Electronic Journal of Probability, and Electronic Communications in Probability. A guest editor and referee for numerous other publications, Fill is a two-time recipient of the Professor Joel Dean Award for Excellence in Teaching for the Department of Applied Mathematics and Statistics at Johns Hopkins.
Fill is a leader in the analysis of algorithms (AofA) community. He is known for a series of papers with Svante Janson of Uppsala University giving an in-depth analysis of the QuickSort sorting algorithm, the AofA revolution he has led by providing more realistic analyses of key-comparison algorithms such as QuickSort and QuickSelect in terms of symbol-comparison counts, and his fundamental work with the late Philippe Flajolet and Nevin Kapur on the singularity analysis of Hadamard products of generating functions. All told, he has written more than 25 AofA-related papers.
Fill has made research contributions on a variety of additional topics, including large deviation probabilities, small deviations, percolation, and first-passage percolation, random graphs, minimal spanning trees, Radon transforms, projection pursuit, matrix analysis, partially ordered sets, applied game theory, partitions, and mathematical problems in music.
Current interests include the geometry and simulation of multivariate (Pareto) records.
Fill is a Fellow of the American Mathematical Society and of the Institute of Mathematical Statistics, and a member of the American Statistical Association, the Association for Computing Machinery, and the Mathematical Association of America. He also is the long-standing editor-in-chief of the Journal of Theoretical Probability and has been an associate editor for the Annals of Applied Probability, the Electronic Journal of Probability, and Electronic Communications in Probability. A guest editor and referee for numerous other publications, Fill is a two-time recipient of the Professor Joel Dean Award for Excellence in Teaching for the Department of Applied Mathematics and Statistics at Johns Hopkins.
研究兴趣
论文共 65 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
CoRR (2024)
引用0浏览0EI引用
0
0
ELECTRONIC JOURNAL OF PROBABILITY (2023)
引用0浏览0引用
0
0
ELECTRONIC JOURNAL OF PROBABILITY (2023)
引用0浏览0引用
0
0
COMBINATORICS PROBABILITY & COMPUTINGno. 1 (2021): 105-123
ELECTRONIC JOURNAL OF PROBABILITY (2019)
引用3浏览0EI引用
3
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn