18 citations · 55 across the 13 of their papers we have counts for
17 papers
Negative Correlations for Forests and the Random Cluster Model
Recep Altar Çiçeksiz, Mohan Ravichandran
We study negative edge correlation for two well-known models in statistical physics, the arboreal gas and the random-cluster model. We show that after the edges and …
Deterministic Approximation Algorithms for Volumes of Spectrahedra
Mahmut Levent Doğan, Jonathan Leake, Mohan Ravichandran
We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method g…
Chainlink Polytopes and Ehrhart-Equivalence
Ezgi Kantarcı Oğuz, Cem Yalım Özel, Mohan Ravichandran
We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehr…
Quasipolynomial-time algorithms for Gibbs point processes
Matthew Jenssen, Marcus Michelen, Mohan Ravichandran
We demonstrate a quasipolynomial-time deterministic approximation algorithm for the partition function of a Gibbs point process interacting via a finite-range stable potential. Thi…
Rank Polynomials of Fence Posets are Unimodal
Ezgi Kantarcı Oğuz, Mohan Ravichandran
We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distributive lattices of lower ideals of fence posets are unimodal. We do this by introdu…
Approximation algorithms for the random-field Ising model
Tyler Helmuth, Holden Lee, Will Perkins +2
Approximating the partition function of the ferromagnetic Ising model with general external fields is known to be #BIS-hard in the worst case, even for bounded-degree graphs, and i…