Submitted and Working Papers

  • M. Bayati, M. A. Erdogdu, and A. Montanari, Estimating LASSO risk and noise level, Working paper.
    Preliminary version appeared in NIPS 2013.

Journal Papers

Refereed Conference Papers

  • N. Baker, M. Bayati, R. Torguson, K. Mack, H. Rappaport, E. Horvitz, R. Waksman, Identifying Patients at High Risk for Readmission following Treatment for Acute Myocardial Infarction: a Data-Centric Approach, American Heart Association Conference, Chicago 2014.
  • H. Bastani, J. Goh, M. Bayati, and S. Zenios, Evidence of Strategic Upcoding in Medicare Claims Data, Wharton Empirical Workshop, 2014.
  • E. Ang, M. Aratow, M. Bayati, S. Kwasnick, and E Plambeck, Forecasting Emergency Department Wait Times, MSOM SIG Conference on Healthcare Operations Management, 2014.
  • M. Bayati, M. Lelarge and A. Montanari, Universality in Polytope Phase Transitions and Iterative Algorithms ISIT 2012
  • Y. Kanoria, M. Bayati, C. Borgs, J. Chayes, and A. Montanari, Fast Convergence of Natural Bargaining Dynamics on Exchange Networks, ACM-SIAM Symposium on Discrete Algorithms, SODA 2011
  • Bayati, J. Bento and A. Montanari, The LASSO risk: asymptotic results and real world examples, NIPS 2010
  • M. Bayati, and A. Montanari, The dynamics of message passing on dense graphs, with applications to compressed sensing, ISIT 2010
  • M. Bayati, D. Gamarnik, and P. Tetali, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, ACM Symposium on Theory of Computing, STOC 2010
  • M. Bayati, M.Gerritsen, D. Gleich, A. Saberi, and Y. Wang, Algorithms for Large, Sparse Network Alignment, Proceedings of IEEE International Conference on Data Mining, ICDM 2009
  • M. Bayati, A. Montanari, and A. Saberi, Generating random graphs with large girth, ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, Implementation details in Information Theory Workshop version, ITW 2009
    Software (by Raghu Keshavan and Sewoong Oh)
  • M. Bayati, J. H. Kim and A. Saberi, A sequential algorithm for generating random graphs, International workshop on Randomization and Computation, RANDOM 2007
  • M. Bayati, D. Gamarnik, D. Katz, C. Nair and P. Tetali, Simple deterministic approximation algorithms for counting matchings, ACM Symposium on Theory of Computing, STOC 2007, Longer version
  • M. Bayati, B. Prabhakar, D. Shah and M. Sharma, Iterative Scheduling Algorithms, IEEE Conference on Computer Communications, INFOCOM 2007
  • M. Bayati, Chandra Nair, A rigorous proof of the cavity method for counting matchings, Allerton conference on communication, control and computing, ALLERTON 2006
  • M. Bayati, D. Shah and M. Sharma, A simpler max-product maximum weight matching algorithm and the auction algorithm, IEEE International Symposium on Information Theory, ISIT 2006
  • M. Bayati, M. Squillante and M. Sharma, Optimal scheduling in multi-server queuing network, ACM SIGMETRICS/Performance, SIGMETRICS 2006
  • N. Kumar, S. Nabar, M. Bayati, A. Keshavarzian, Achieving stability in networks of input queued switches using a local online scheduling policy, IEEE Global Communications Conference, GLOBECOM 2005
  • M. Bayati, D. Shah and M. Sharma, Maximum weight matching via max-product belief propagation, IEEE International Symposium on Information Theory, ISIT 2005
  • M. Bayati, N. Beheshti, Stability of the maximum size matching in input queued switches, Allerton conference on communication, control and computing, ALLERTON 2004


  • M. Bayati, M. Braverman, M. Gillam, and E. Horvitz, - Health Care Policy Development and Execution , 2010
  • M. Bayati, M. Braverman, S. Kale and Y. Makarychev, Predicting web-advertisement click success by using head-to-head ratings, 2009
  • M. Bayati, A. Braunstein, C. Borgs, J. Chayes and R. Zecchina, Network analysis with Steiner Trees, 2008 (awarded)