
Sampling Colorings and Independent Sets of Random Regular Bipartite Graphs in the NonUniqueness Region
For spin systems, such as the qcolorings and independentset models, ap...
read it

On Mixing of Markov Chains: Coupling, Spectral Independence, and Entropy Factorization
For general spin systems, we prove that a contractive coupling for any l...
read it

The SwendsenWang Dynamics on Trees
The SwendsenWang algorithm is a sophisticated, widelyused Markov chain...
read it

Rapid Mixing for Colorings via Spectral Independence
The spectral independence approach of Anari et al. (2020) utilized recen...
read it

Understanding Diversity based Pruning of Neural Networks – Statistical Mechanical Analysis
Deep learning architectures with a huge number of parameters are often c...
read it

Hardness of Identity Testing for Restricted Boltzmann Machines and Potts models
We study identity testing for restricted Boltzmann machines (RBMs), and ...
read it

The complexity of approximating averages on boundeddegree graphs
We prove that, unless P=NP, there is no polynomialtime algorithm to app...
read it

Improved Strong Spatial Mixing for Colorings on Trees
Strong spatial mixing (SSM) is a form of correlation decay that has play...
read it

Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models
We study the identity testing problem in the context of spin systems or ...
read it

The complexity of approximating the matching polynomial in the complex plane
We study the problem of approximating the value of the matching polynomi...
read it

Sampling in Uniqueness from the Potts and RandomCluster Models on Random Regular Graphs
We consider the problem of sampling from the Potts model on random regul...
read it

On Counting Perfect Matchings in General Graphs
Counting perfect matchings has played a central role in the theory of co...
read it

Inapproximability of the independent set polynomial in the complex plane
We study the complexity of approximating the independent set polynomial ...
read it

Structure Learning of Hcolorings
We study the structure learning problem for graph homomorphisms, commonl...
read it

Rapid Mixing SwendsenWang Sampler for Stochastic Partitioned Attractive Models
The Gibbs sampler is a particularly popular Markov chain used for learni...
read it

On The Projection Operator to A Threeview Cardinality Constrained Set
The cardinality constraint is an intrinsic way to restrict the solution ...
read it

Subset Selection for Gaussian Markov Random Fields
Given a Gaussian Markov random field, we consider the problem of selecti...
read it
Daniel Stefankovic
is this you? claim profile