Related papers: Phase transition for Minesweeper
A quantum phase transition that was recently observed in a high-mobility silicon MOSFET is analyzed in terms of a scaling theory. The most striking characteristic of the transition is a divergence of the thermopower, according to an inverse…
We investigate, using Monte Carlo simulations, the phase diagram of a system of hard rectangles of size $m\times mk$ on a square lattice when the aspect ratio $k$ is a non-integer. The existence of a disordered isotropic phase, a nematic…
The nonequilibrium phase transition in a system of diffusing, coagulating particles in the presence of a steady input and evaporation of particles is studied. The system undergoes a transition from a phase in which the average number of…
The phase diagram of a system of monodispersed hard rectangles of size $m\times m k$ on a square lattice is numerically determined for $m=2,3$ and aspect ratio $k= 1,2,\ldots, 7$. We show the existence of a disordered phase, a nematic phase…
We study the strategic considerations of miners participating in the bitcoin's protocol. We formulate and study the stochastic game that underlies these strategic considerations. The miners collectively build a tree of blocks, and they are…
A fast algorithm is presented for determining the linear complexity and the minimal polynomial of periodic sequences over GF(q) with period q n p m, where p is a prime, q is a prime and a primitive root modulo p2. The algorithm presented…
Dynamical mechanisms that can stabilize the coexistence or diversity in biology are generally of fundamental interest. In contrast to many two-strategy evolutionary games, games with three strategies and cyclic dominance like the…
Quantum phase transitions occur when the ground state of a quantum system undergoes a qualitative change when an external control parameter reaches a critical value. Here, we demonstrate a technique for studying quantum systems undergoing a…
We consider games played on graphs with the winning conditions for the players specified as weak-parity conditions. In weak-parity conditions the winner of a play is decided by looking into the set of states appearing in the play, rather…
We consider driven many-particle models which have a phase transition between an active and an absorbing phase. Like previously studied models, we have particle conservation, but here we introduce an additional symmetry - when two particles…
In mean-payoff games, the objective of the protagonist is to ensure that the limit average of an infinite sequence of numeric weights is nonnegative. In energy games, the objective is to ensure that the running sum of weights is always…
The single- and multi- processor cup games can be used to model natural problems in areas such as processor scheduling, deamortization, and buffer management. At the beginning of the single-processor cup game, $n$ cups are initially empty.…
In this note I will review some of the recent results that have been obtained in the probabilistic approach to the random satisfiability problem. At the present moment the results are only heuristic. In the case of the random…
In multi-agent environments in which coordination is desirable, the history of play often causes lock-in at sub-optimal outcomes. Notoriously, technologies with a significant environmental footprint or high social cost persist despite the…
I review recent developments in determining the QCD phase diagram by means of lattice simulations. Since the invention of methods to side-step the sign problem a few years ago, a number of additional variants have been proposed, and…
Restricted Boltzmann Machines are a class of undirected graphical models that play a key role in deep learning and unsupervised learning. In this study, we prove a phase transition phenomenon in the mixing time of the Gibbs sampler for a…
We study the problem of deciding the winner of reachability switching games for zero-, one-, and two-player variants. Switching games provide a deterministic analogue of stochastic games. We show that the zero-player case is NL-hard, the…
The circuit complexity of time-evolved pure quantum states grows linearly in time for an exponentially long time. This behavior has been proven in certain models, is conjectured to hold for generic quantum many-body systems, and is believed…
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, for the case where the players are restricted to finite-memory strategies. First, we describe a general framework, where…
Intransitivity is a property of connected, oriented graphs representing species interactions that may drive their coexistence even in the presence of competition, the standard example being the three species Rock-Paper-Scissors game. We…