基本信息
浏览量:468
职业迁徙
个人简介
My research interests are in Probabilistic Combinatorics and its application to Theoretical Computer Science and Operations Research. Much of my work has focused on the properties of random graphs and I have recently completed a book on the subject: Introduction to Random Graphs by A.M. Frieze and M. Karoński, Cambridge University Press, 2015.
My research has focused on finding the threshold for the occurrence of various properties in several models of a random graph. In addition I have studied the expected performance of algorithms on random data, often a random graph. I have worked on the use of Markov Chains as a computational tool. I worked on the problem of estimating the volume of a convex body in a large number of dimensions.
Together with my colleagues, Martin Dyer and Ravi Kannan, I was able to produce the first randomized approximation scheme for this problem. I have also worked on the problem of estimating the number of proper k-colorings of a graph or hypergraph.
I have several papers on random walks in graphs. I have studied the cover time of many models of random graphs and have used random walks to find edge/vertex disjoint paths in expander graphs.
I am currently working on extending much of my work on random graphs to random hypergraphs and to random matroids.
My research has focused on finding the threshold for the occurrence of various properties in several models of a random graph. In addition I have studied the expected performance of algorithms on random data, often a random graph. I have worked on the use of Markov Chains as a computational tool. I worked on the problem of estimating the volume of a convex body in a large number of dimensions.
Together with my colleagues, Martin Dyer and Ravi Kannan, I was able to produce the first randomized approximation scheme for this problem. I have also worked on the problem of estimating the number of proper k-colorings of a graph or hypergraph.
I have several papers on random walks in graphs. I have studied the cover time of many models of random graphs and have used random walks to find edge/vertex disjoint paths in expander graphs.
I am currently working on extending much of my work on random graphs to random hypergraphs and to random matroids.
研究兴趣
论文共 526 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
SIAM J. Discret. Math.no. 1 (2024): 867-882
SIAM JOURNAL ON DISCRETE MATHEMATICSno. 1 (2024): 867-882
arxiv(2023)
引用0浏览0引用
0
0
arXiv (Cornell University) (2023)
引用0浏览0引用
0
0
arXiv (Cornell University) (2023)
引用0浏览0引用
0
0
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn