73 citations · 73 across the 2 of their papers we have counts for
4 papers
Entropy landscape and non-Gibbs solutions in constraint satisfaction problems
L. Dall'Asta, A. Ramezanpour, R. Zecchina
We study the entropy landscape of solutions for the bicoloring problem in random graphs, a representative difficult constraint satisfaction problem. Our goal is to classify which t…
Simplifying Random Satisfiability Problem by Removing Frustrating Interactions
A. Ramezanpour, S. Moghimi-Araghi
How can we remove some interactions in a constraint satisfaction problem (CSP) such that it still remains satisfiable? In this paper we study a modified survey propagation algorith…
Elastic properties of small-world spring networks
A. Ramezanpour, S. M. Vaez Allaei
We construct small-world spring networks based on a one dimensional chain and study its static and quasistatic behavior with respect to external forces. Regular bonds and shortcuts…
Biased random satisfiability problems: From easy to hard instances
A. Ramezanpour, S. Moghimi-Araghi
In this paper we study biased random K-SAT problems in which each logical variable is negated with probability . This generalization provides us a crossover from easy to hard pr…