Related papers: A Phase Transition in Minesweeper
This paper first analyzes the resolution complexity of two random CSP models (i.e. Model RB/RD) for which we can establish the existence of phase transitions and identify the threshold points exactly. By encoding CSPs into CNF formulas, it…
Graph games provide the foundation for modeling and synthesizing reactive processes. In the synthesis of stochastic reactive processes, the traditional model is perfect-information stochastic games, where some transitions of the game graph…
We study a one-dimensional ladder of two coupled XXZ spin chains and identify several distinct gapless symmetry-enriched critical phases. These have the same unbroken symmetries and long-wavelength description, but cannot be connected…
Recently, it was shown that there is a phase transition in the community detection problem. This transition was first computed using the cavity method, and has been proved rigorously in the case of $q=2$ groups. However, analytic…
I study a dimer model on the square lattice with nearest-neighbor exclusion as the only interaction. Detailed simulations using tomographic entropic sampling show that as the chemical potential is varied, there is a strongly discontinuous…
We analyze the dynamical (in)stability of nematic liquid crystals in the presence of external magnetic fields and Rapini-Papoular surface potential. The P-HAN transition is investigated using a simplified 3D Ericksen-Leslie system. We find…
We consider a system of clusters made of elementary building blocks, monomers, and evolving via collisions between diffusing monomers and immobile composite clusters. In our model, the cluster-monomer collision can lead to the attachment of…
Identifying quantum phase transitions poses a significant challenge in condensed matter physics, as this requires methods that both provide accurate results and scale well with system size. In this work, we demonstrate how relaxation…
Itemset mining is one of the most studied tasks in knowledge discovery. In this paper we analyze the computational complexity of three central itemset mining problems. We prove that mining confident rules with a given item in the head is…
Fortification-interdiction games are tri-level adversarial games where two opponents act in succession to protect, disrupt and simply use an infrastructure for a specific purpose. Many such games have been formulated and tackled in the…
The game of SET is a popular card game in which the objective is to form Sets using cards from a special deck. In this paper we study single- and multi-round variations of this game from the computational complexity point of view and…
A phase transition, like the one already found on Boolean satisfiability problem by Kirkpatrick and Selman, is found on max clique problem on ER graphs. Although number of the datapoints is limited, the transition seems to obey finite size…
In Petri net synthesis we ask whether a given transition system $A$ can be implemented by a Petri net $N$. Depending on the level of accuracy, there are three ways how $N$ can implement $A$: an embedding, the least accurate implementation,…
An average-time game is played on the infinite graph of configurations of a finite timed automaton. The two players, Min and Max, construct an infinite run of the automaton by taking turns to perform a timed transition. Player Min wants to…
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
We extend our study of phase transitions in the generalization behaviour of multilayer perceptrons with non-overlapping receptive fields to the problem of the influence of noise, concerning e.g. the input units and/or the couplings between…
We propose a flexible convex relaxation for the phase retrieval problem that operates in the natural domain of the signal. Therefore, we avoid the prohibitive computational cost associated with "lifting" and semidefinite programming (SDP)…
We study the following game on a finite graph $G = (V, E)$. At the start, each edge is assigned an integer $n_e \ge 0$, $n = \sum_{e \in E} n_e$. In round $t$, $1 \le t \le n$, a uniformly random vertex $v \in V$ is chosen and one of the…
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…
We revisit the complexity of deciding, given a {\it bimatrix game,} whether it has a {\it Nash equilibrium} with certain natural properties; such decision problems were early known to be ${\mathcal{NP}}$-hard~\cite{GZ89}. We show that…