Photograph

I work at the School of Technology and Computer Science at the Tata Institute of Fundamental Research.

I am broadly interested in applications of probabilistic ideas in computer science. Before coming to TIFR, I studied at IIT Kanpur and UC Berkeley and was a post-doctoral scholar at Caltech.

Email: piyush.srivastava (at) tifr (dot) res (dot) in.

Notes Service

Papers

Click here for a list categorized by subjects.

  1. On complex roots of the independence polynomial.
     with Ferenc Bencs, Péter Csikvári, and Jan Vondrák. [arXiv]. Preprint.

  2. Universal lower bound for learning causal DAGs with atomic interventions.
     with Vibhor Porwal (first author) and Gaurav Sinha. Extended abstract in proceedings of AISTATS 2022 (oral presentation section). [arXiv]. Extended version (May 2022) of AISTATS 2022 paper which appeared in the proceedings under the title “Almost universal lower bound for learning causal DAGs with atomic interventions”.

  3. On the mixing time of coordinate Hit-and-Run.
     with Hariharan Narayanan. [arXiv].
     Combinatorics, Probability and Computing. August 2021.

  4. Condition number bounds for causal inference.
     with Spencer Gordon, Vinayak Kumar, and Leonard J. Schulman. Extended abstract in proceedings of UAI 2021.

  5. Correlation decay and partition function zeros: Algorithms and phase transitions.
     with Jingcheng Liu and Alistair Sinclair. Extended abstract in proceedings of FOCS 2019. [arXiv]. Invited to the FOCS 2019 special issue of SIAM J. Comput.

  6. Online codes for analong signals.
     with Leonard J. Schulman. [arXiv].
     IEEE Trans. Inf. Theory, 65 (10), pp. 6633–6649. May 2019.

  7. Fisher zeros and correlation decay in the Ising model.
     with Jingcheng Liu and Alistair Sinclair. Extended abstract in proceedings of ITCS 2019. [arXiv].
     J. Math. Phys., 20 (103304), 2019.

  8. Computing the independence polynomial: from the tree threshold down to the roots.
     with Nicholas J. A. Harvey and Jan Vondrák. Extended abstract in proceedings of SODA 2018. [arXiv].

  9. Exact recovery in the Ising blockmodel.
     with Quentin Berthet and Philippe Rigollet. [arXiv].
     Ann. Stat. 47 (4), pp. 1805–1834. May 2019.

  10. The Ising Partition Function: Zeros and Deterministic Approximation.
     with Jingcheng Liu and Alistair Sinclair. Extended abstract in proceedings of FOCS 2017. [arXiv].
     Journal of Statistical Physics. Online December 2018.

  11. Stability of causal inference. [Conference version] (Erratum for conference version).
     with Leonard J. Schulman. Extended abstract in proceedings of UAI 2016.

  12. Evolutionary dynamics in finite populations mix rapidly.
     with Ioannis Panageas and Nisheeth K. Vishnoi. Extended abstract in proceedings of SODA 2016. [Preprint].

  13. Symbolic integration and the complexity of computing averages.
     with Leonard J. Schulman and Alistair Sinclair. Extended abstract in proceedings of FOCS 2015. [Preprint].

  14. Spatial mixing and the connective constant: Optimal bounds.
     with Alistair Sinclair, Daniel Štefankovič and Yitong Yin. Extended abstract in proceedings of SODA 2015. [arXiv].
     Probability Theory & Related Fields. Online July 2016.

  15. Spatial mixing and approximation algorithms for graphs with bounded connective constant.
     with Alistair Sinclair and Yitong Yin. Extended abstract in proceedings of FOCS 2013. [arXiv].

  16. Lee-Yang theorems and the complexity of computing averages.
     with Alistair Sinclair. Extended abstract in proceedings of STOC 2013. [arXiv].
     Comm. Math. Phys. 329 (3), pp. 827–858. August 2014.

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

  18. Approximation algorithms for two-state anti-ferromagnetic spin systems.
     with Alistair Sinclair and Marc Thurley. Extended abstract in proceedings of SODA 2012. [arXiv].
     J. Stat. Phys. 155 (4), pp. 666–686. March 2014.

Dissertation

Notes

Click here for details of these notes.

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

  2. A simplified proof of a Lee-Yang type theorem. July, 2014. [arXiv].

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

  4. Inferring graphical structures. May, 2013.

Service

Conference program committees: [FOCS 2021] [ITCS 2020] [FSTTCS 2018]