Photograph I am a postdoctoral scholar at the Center for the Mathematics of Information in the department of Computing and Mathematical Sciences at Caltech.

Before coming to Caltech, I was a student at UC Berkeley, where I submitted my dissertation in August 2014. Even before that, I did my undergraduate studies in computer science at IIT Kanpur.

Email: piyushsr (at) cs (dot) berkeley (dot) edu, piyushs (at) caltech (dot) edu.


Click here for a list categorized by subjects.

  1. Evolutionary dynamics in finite populations mix rapidly.
     Ioannis Panageas, Piyush Srivastava and Nisheeth K. Vishnoi. SODA 2016.

  2. Symbolic integration and the complexity of computing averages.
     Leonard J. Schulman, Alistair Sinclair and Piyush Srivastava. FOCS 2015. [Preprint].

  3. Spatial mixing and the connective constant: Optimal bounds.
     Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič and Yitong Yin. SODA 2015. [arXiv].

  4. Spatial mixing and approximation algorithms for graphs with bounded connective constant.
     Alistair Sinclair, Piyush Srivastava and Yitong Yin. FOCS 2013. [arXiv].

  5. Lee-Yang theorems and the complexity of computing averages.
     Alistair Sinclair and Piyush Srivastava. STOC 2013. [arXiv].
     Comm. Math. Phys. 329 (3), pp. 827–858. August 2014.

  6. A finite population model of molecular evolution.
     Narendra M. Dixit, Piyush Srivastava, and Nisheeth K. Vishnoi.
     J. Comp. Biol. 19 (10), pp. 1176–1202. October 2012.

  7. Approximation algorithms for two-state anti-ferromagnetic spin systems.
     Alistair Sinclair, Piyush Srivastava, and Marc Thurley. SODA 2012. [arXiv].
     J. Stat. Phys. 155 (4), pp. 666–686. March 2014.



Click here for details of these notes.

  1. Approximating the hard core partition function with negative activities. April, 2015.

  2. The Lee-Yang theory of phase transitions. October, 2013.

  3. Inferring graphical structures, with Di Wang. May, 2013.