Zobrazeno 1 - 10
of 109
pro vyhledávání: '"Galanis, Andreas"'
We consider the problem of sampling from the ferromagnetic $q$-state Potts model on the random $d$-regular graph with parameter $\beta>0$. A key difficulty that arises in sampling from the model is the existence of a metastability window $(\beta_u,\b
Externí odkaz:
http://arxiv.org/abs/2410.14409
We consider the problem of sampling from the Ising model when the underlying interaction matrix has eigenvalues lying within an interval of length $\gamma$. Recent work in this setting has shown various algorithmic results that apply roughly when $\g
Externí odkaz:
http://arxiv.org/abs/2407.07645
We consider the problem of estimating the parameters of a Markov Random Field with hard-constraints using a single sample. As our main running examples, we use the $k$-SAT and the proper coloring models, as well as general $H$-coloring models; for al
Externí odkaz:
http://arxiv.org/abs/2311.03332
We consider the performance of Glauber dynamics for the random cluster model with real parameter $q>1$ and temperature $\beta>0$. Recent work by Helmuth, Jenssen and Perkins detailed the ordered/disordered transition of the model on random $\Delta$-r
Externí odkaz:
http://arxiv.org/abs/2305.13239
Autor:
Galanis, Andreas
A recent line of works established a remarkable connection for antiferromagnetic 2-spin systems, including the Ising and hard-core models, showing that the computational complexity of approximating the partition function for graphs with maximum degre
Externí odkaz:
http://hdl.handle.net/1853/52211
Autor:
Chen, Zongchen, Galanis, Andreas, Goldberg, Leslie Ann, Guo, Heng, Herrera-Poyatos, Andrés, Mani, Nitya, Moitra, Ankur
We give a nearly linear-time algorithm to approximately sample satisfying assignments in the random $k$-SAT model when the density of the formula scales exponentially with $k$. The best previously known sampling algorithm for the random $k$-SAT model
Externí odkaz:
http://arxiv.org/abs/2206.15308
We study the computational complexity of estimating local observables for Gibbs distributions. A simple combinatorial example is the average size of an independent set in a graph. In a recent work, we established NP-hardness of approximating the aver
Externí odkaz:
http://arxiv.org/abs/2206.11606
Autor:
Coja-Oghlan, Amin, Galanis, Andreas, Goldberg, Leslie Ann, Ravelomanana, Jean Bernoulli, Stefankovic, Daniel, Vigoda, Eric
We study the performance of Markov chains for the $q$-state ferromagnetic Potts model on random regular graphs. It is conjectured that their performance is dictated by metastability phenomena, i.e., the presence of "phases" (clusters) in the sample s
Externí odkaz:
http://arxiv.org/abs/2202.05777
Spectral independence is a recently-developed framework for obtaining sharp bounds on the convergence time of the classical Glauber dynamics. This new framework has yielded optimal $O(n \log n)$ sampling algorithms on bounded-degree graphs for a larg
Externí odkaz:
http://arxiv.org/abs/2111.04066
Recent developments in approximate counting have made startling progress in developing fast algorithmic methods for approximating the number of solutions to constraint satisfaction problems (CSPs) with large arities, using connections to the Lovasz L
Externí odkaz:
http://arxiv.org/abs/2107.05486