activity
20112026
most citedSpatial mixing and approximation algorithms for graphs with bounded connective constant

37 citations · 121 across the 18 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2022★ 1 cited

Sampling from convex sets with a cold start using multiscale decompositions

Hariharan Narayanan, Amit Rajaraman, Piyush Srivastava

Running a random walk in a convex body is a standard approach to sample approximately uniformly from the body. The requirement is that from a suitable init…

cs.DS2020★ 11 cited

On the mixing time of coordinate Hit-and-Run

Hariharan Narayanan, Piyush Srivastava

We obtain a polynomial upper bound on the mixing time of the coordinate Hit-and-Run random walk on an dimensional convex body, where is the number of…

cs.DS2017★ 25 cited

The Ising Partition Function: Zeros and Deterministic Approximation

Jingcheng Liu, Alistair Sinclair, Piyush Srivastava

We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (a…

cs.DS2016★ 4 cited

Computing the Independence Polynomial: from the Tree Threshold down to the Roots

Nicholas J. A. Harvey, Piyush Srivastava, Jan Vondrák

We study an algorithm for approximating the multivariate independence polynomial , with negative and complex arguments, an object that has strong connections to comb…

cs.DS2014

Spatial mixing and the connective constant: Optimal bounds

Alistair Sinclair, Piyush Srivastava, Daniel Štefankovič +1

We study the problem of deterministic approximate counting of matchings and independent sets in graphs of bounded connective constant. More generally, we consider the problem of ev…