基本信息
浏览量:540
职业迁徙
个人简介
Elchanan Mossel works in probability, combinatorics and inference. His interests include combinatorical statistics, discrete Fourier analysis, randomized algorithms, computational complexity, Markov random fields, social choice, game theory, evolution, and the mathematical foundations of deep learning. His research in discrete function inequalities, isoperimetry, and hypercontractiviting led to the proof that Majority is Stablest and confirmed that optimality of the Goemans-Williamson MAX-CUT algorithm under the unique games conjecture from computational complexity. His work on the reconstruction problem on trees provides optimal algorithms and bounds for phylogenetic reconstruction in molecular biology and has led to sharp results in the analysis of Gibbs samplers from statistical physics and inference problems on graphs. His research has resolved open problems in computational biology, machine learning, social choice theory, and economics.
研究兴趣
论文共 305 篇作者统计合作学者相似作者
按年份排序按引用量排序主题筛选期刊级别筛选合作者筛选合作机构筛选
时间
引用量
主题
期刊级别
合作者
合作机构
arxiv(2024)
引用0浏览0引用
0
0
CoRR (2024)
引用0浏览0EI引用
0
0
arxiv(2024)
引用0浏览0引用
0
0
arxiv(2023)
引用0浏览0引用
0
0
arxiv(2023)
引用0浏览0引用
0
0
CoRR (2023): 30:1-30:14
加载更多
作者统计
合作学者
合作机构
D-Core
- 合作者
- 学生
- 导师
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn