Related papers: Phase coexistence and finite-size scaling in rando…
We study the effects of a probabilistic refractory period in the collective behavior of coupled discrete-time excitable cells (SIRS-like cellular automata). Using mean-field analysis and simulations, we show that a synchronized phase with…
We study the competition between a random potential and a commensurate potential on interacting fermionic and bosonic systems using a variety of methods. We focus on one dimensional interacting fermionic systems but higher dimensional…
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previously, analogous algorithms have been known -- e.g.~[Fischer,…
Quantum phase transitions driven by electronic correlations are central to understanding the physics of graphene and related two-dimensional materials. A paradigmatic example is the semimetal-to-Mott-insulator transition on the honeycomb…
For a large number of random constraint satisfaction problems, such as random k-SAT and random graph and hypergraph coloring, there are very good estimates of the largest constraint density for which solutions exist. Yet, all known…
The poset cover problem seeks a minimum set of partial orders whose linear extensions cover a given set of linear orders. Recognizing its NP-completeness, we devised a non-trivial reduction to the Boolean satisfiability problem using a…
Shape-constrained optimization arises in a wide range of problems including distributionally robust optimization (DRO) that has surging popularity in recent years. In the DRO literature, these problems are usually solved via reduction into…
This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…
The degree of randomness, or partial order, present in two-dimensional supramolecular arrays of isophthalate tetracarboxylic acids is shown to vary due to subtle chemical changes such as the choice of solvent or small differences in…
We consider two independent Erd\H{o}s-R\'enyi random graphs, with possibly different parameters, and study two isomorphism problems, a graph embedding problem and a common subgraph problem. Under certain conditions on the graph parameters…
The random $k$-XORSAT problem is a random constraint satisfaction problem of $n$ Boolean variables and $m=rn$ clauses, which a random instance can be expressed as a $G\mathbb{F}(2)$ linear system of the form $Ax=b$, where $A$ is a random $m…
We study the order-disorder transition in two-dimensional incompressible systems of motile particles with alignment interactions through extensive numerical simulations of the incompressible Toner-Tu (ITT) field theory and a detailed…
We study the large-$N$ limit of adjoint fermion one-matrix models. We find one-cut solutions of the loop equations for the correlators of these models and show that they exhibit third order phase transitions associated with $m$-th order…
A semi-grand-canonical Monte Carlo algorithm is employed in conjunction with the bond fluctuation model to investigate the critical properties of an asymmetric binary (AB) polymer mixture. By applying the equal peak-weight criterion to the…
We study the critical behavior for percolation on inhomogeneous random networks on $n$ vertices, where the weights of the vertices follow a power-law distribution with exponent $\tau \in (2,3)$. Such networks, often referred to as…
We analyze the problem of supervised learning of ferromagnetic phase transitions from the statistical physics perspective. We consider two systems in two universality classes, the two-dimensional Ising model and two-dimensional Baxter-Wu…
Using Monte-Carlo simulations on large lattices, we study the effects of changing the parameter $u$ (the ratio of the adsorption and desorption rates) of the raise and peel model. This is a nonlocal stochastic model of a fluctuating…
Given a CNF formula $F$, we present a new algorithm for deciding the satisfiability (SAT) of $F$ and computing all solutions of assignments. The algorithm is based on the concept of \emph{cofactors} known in the literature. This paper is a…
We present a novel application of the Kramers-Wannier duality on one of the most important problems of computer science, the Boolean satisfiability problem (SAT). More specifically, we focus on sharp-SAT or equivalently #SAT - the problem…
We study a model for a quantum critical point in two spatial dimensions between a semimetallic phase, characterized by a stable quadratic Fermi node, and an ordered phase, in which the spectrum develops a band gap. The quantum critical…