Piyush Srivastava पीयूष श्रीवास्तव

In August 2014, I submitted my dissertation at UC Berkeley. Since September 2014, I am a postdoctoral scholar at the Center for the Mathematics of Information in the department of Computing and Mathematical Sciences at Caltech. I am broadly interested in randomized algorithms (and especially in connections between phase transitions and the computational complexity of counting and sampling problems). My research advisor at UC Berkeley was Alistair Sinclair.

Before coming to Berkeley, I did my undergraduate studies in computer science at IIT Kanpur.

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


  1. Alistair Sinclair, Leonard Schulman and Piyush Srivastava. Symbolic integration and the complexity of computing averages.
  2. Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič and Yitong Yin. Spatial mixing and the connective constant: Optimal bounds.
  3. Alistair Sinclair, Piyush Srivastava, and Yitong Yin. Spatial mixing and approximation algorithms for graphs with bounded connective constant.
  4. Alistair Sinclair, Piyush Srivastava. Lee-Yang theorems and the complexity of computing averages.
  5. Narendra M. Dixit, Piyush Srivastava and Nisheeth K. Vishnoi. A finite population model of molecular evolution
  6. Alistair Sinclair, Piyush Srivastava, and Marc Thurley. Approximation algorithms for two-state anti-ferromagnetic spin systems.



  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.

Older Manuscripts


Valid CSS! Valid HTML5!