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 at Caltech. I am broadly interested in randomized algorithms (and especially in connections between phase transitions and sampling). 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.

CV (February, 2014).


Papers

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

Dissertation


Notes

  1. The Lee-Yang Theory of Phase Transitions.

Older Manuscripts


Teaching


Valid CSS! Valid HTML5!