Elchanan Mossel

Professor

Research Areas

• Biosystems & Computational Biology (BIO)
• Theory (THY)

Teaching Schedule (Spring 2013)

• CS C281B. Advanced Topics in Learning and Decision Making, MW 4:00-5:30P, 3111 Etcheverry

Selected Publications

• M. Braverman, O. Etesami, and E. Mossel, "Mafia: A theoretical study of players and coalitions in a partial information environment," Annals of Applied Probability, vol. 18, no. 3, pp. 825-846, 2008.
• E. Mossel, "Gaussian bounds for noise correlation of functions and tight analysis of long codes," in Proc. 49th Annual IEEE Symp. on Foundations of Computer Science (FOCS 2008), Los Alamitos, CA: IEEE Computer Society, 2008, pp. 156-165.
• A. Bogdanov, E. Mossel, and S. Vadhan, "The complexiity of distinguishing Markov random fields," in Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, A. Goel, K. Jansen, J. D. P. Rolim, and R. Rubinfeld, Eds., Lecture Notes in Computer Science, Vol. 5171, Berlin, Germany: Springer-Verlag, 2008, pp. 331-342.
• G. Bresler, E. Mossel, and A. sly, "Reconstruction of Markov random fields from samples: Some easy observations and algorithms," in Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques, A. Goel, K. Jansen, J. D. P. Rolim, and R. Rubinfeld, Eds., Lecture Notes in Computer Science, Vol. 5171, Berlin, Germany: Springer-Verlag, 2008, pp. 343-356.
• A. Montanari and E. Mossel, "Smooth compression, Gallager bound and nonlinear sparse-graph codes," in Proc. 2008 IEEE Intl. Symp. on Information Theory (ISIT '08), Piscataway, NJ: IEEE Press, 2008, pp. 2474-2478.
• P. Austrin and E. Mossel, "Approximation resistant predicates from pairwise independence," in Proc. 23rd Annual IEEE Conf. on Computational Complexity (CCC 2008), Los Alamitos, CA: IEEE Computer Society, 2008, pp. 249-258.
• F. A. Matsen, E. Mossel, and M. Steel, "Mixed-up trees: The structure of phylogenetic mixtures," Bulletin of Mathematical Biology, vol. 70, no. 4, pp. 1115-1139, May 2008.
• E. Mossel and A. Sly, "Rapid mixing of Gibbs sampling on graphs that are sparse on average," in Proc. 19th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2008), Philadelphia, PA: Society for Industrial and Applied Mathematics, 2008, pp. 238-247.
• M. Braverman and E. Mossel, "Noisy sorting without resampling," in Proc. 19th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2008), Philadelphia, PA: Society for Industrial and Applied Mathematics, 2008, pp. 268-276.
• S. Khot, G. Kindler, E. Mossel, and R. O'Donnell, "Optimal inapproximability for MAX-CUT and other 2-variable CSPs?," SIAM J. Computing, vol. 37, no. 1, pp. 319-357, 2007.
• E. Mossel and S. Roch, "On the submodularity of influence in social networks," in Proc. 39th Annual ACM Symp. on Theory of Computing (STOC 2007), New York, NY: The Association for Computing Machinery, Inc., 2007, pp. 128-134.
• E. Mossel and S. Roch, "Slow emergence of cooperation for win-stay lose-shift on trees," Machine Learning, vol. 62, no. 1-2, pp. 7-22, May 2007.
• E. Mossel, "Distorted metrics on trees and phylogenetic forests," IEEE/ACM Trans. Computational Biology and Informatics, vol. 4, no. 1, pp. 108-116, Jan. 2007.
• E. Mossel and E. Vigoda, "Limitations of Markov chain Monte Carlo algorithms for Bayesian inference of phylogeny," Annals of Applied Probability, vol. 16, no. 4, pp. 2215-2234, 2006.
• E. Mossel and S. Roch, "Learning nonsingular phylogenies and hidden Markov models," Annals of Applied Probability, vol. 16, no. 2, pp. 583-614, 2006.
• K. Chen, A. Fiat, H. Kaplan, M. Levy, J. Matousek, E. Mossel, J. Pach, M. Sharir, S. Smorodinsky, U. Wagner, and E. Welzl, "Online conflict-free coloring for intervals," SIAM J. Computing, vol. 36, no. 5, pp. 1342-1359, 2006.
• E. Mossel, R. O'Donnell, O. Regev, J. E. Steif, and B. Sudakov, "Non-interactive correlation distillation, inhomogeneous Markov chains, and the reverse Bonami-Beckner inequality," Israel J. Mathematics, vol. 154, no. 1, pp. 299-336, Dec. 2006.
• U. Feige, E. Mossel, and D. Vilenchik, "Complete convergence of message passing algorithms for some satisfiability problems," in Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, J. Diaz, K. Jansen, J. D. P. Rolim, and U. Zwick, Eds., Lecture Notes in Computer Science, Vol. 4110, Berlin, Germany: Springer-Verlag, 2006, pp. 339-350.
• E. Mossel, A. Shpilka, and L. Trevisan, "On epsilon-based generators in NC^0," Random Structures and Algorithms, vol. 29, no. 1, pp. 56-81, Aug. 2006.
• O. Haggstrom, G. Kalai, and E. Mossel, "A law of large numbers for weighted majority," Advances in Applied Mathematics, vol. 37, no. 1, pp. 112-123, July 2006.