Related papers: Phase transition for Minesweeper
We revisit a time-dependent, oval-shaped billiard to investigate a phase transition from bounded to unbounded energy growth. In the static case, the phase space exhibits a mixed structure. The chaotic sea in the static scenario leads to…
In this paper we extend the investigation into the transition from sure to probabilistic sniping as introduced in Menkveld and Zoican \cite{mz2017}. In that paper, the authors introduce a stylized version of a competitive game in which high…
We solve a one-dimensional sandpile problem analytically in a thick flow regime when the pile evolution may be described by a set of linear equations. We demonstrate that, if an income flow is constant, a space periodicity takes place while…
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimization problem on a set of words defined by seven classes of…
We present three very simple variants of the classic Heads or Tails game using chips, each of which contributes to our understanding of the Bitcoin protocol. The first variant addresses the issue of temporary Bitcoin forks, which occur when…
We have studied the phase transition of the contact process near a multiple junction of $M$ semi-infinite chains by Monte Carlo simulations. As opposed to the continuous transitions of the translationally invariant ($M=2$) and semi-infinite…
We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks whether a cell q will eventually become unstable after adding…
Two standard algorithms for approximately solving two-player zero-sum concurrent reachability games are value iteration and strategy iteration. We prove upper and lower bounds of 2^(m^(Theta(N))) on the worst case number of iterations…
Petri games are a multi-player game model for the automatic synthesis of distributed systems, where the players are represented as tokens on a Petri net and are grouped into environment players and system players. As long as the players…
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 this work we study on a 2-dimensional square lattice a recent version of the Naming Game, an agent-based model used for describing the emergence of linguistic structures. The system is open-ended and agents can invent new words all along…
Mean-payoff games on timed automata are played on the infinite weighted graph of configurations of priced timed automata between two players, Player Min and Player Max, by moving a token along the states of the graph to form an infinite…
Infinite games where several players seek to coordinate under imperfect information are deemed to be undecidable, unless the information is hierarchically ordered among the players. We identify a class of games for which joint winning…
Computing tight over-approximation of reach sets of a controlled uncertain dynamical system is a common practice in verification of safety-critical cyber-physical systems (CPS). While several algorithms are available for this purpose, they…
We generalize the original majority-vote model by incorporating an inertia into the microscopic dynamics of the spin flipping, where the spin-flip probability of any individual depends not only on the states of its neighbors, but also on…
Large systems of linear equations are ubiquitous in science. Quite often, e.g. when considering population dynamics or chemical networks, the solutions must be non-negative. Recently, it has been shown that large systems of random linear…
The analogue of a Mott-Hubbard transition is discussed, which appears at an incommensurate filling in a model of a two-dimensional plane, randomly tiled with CuO_4 `molecules', simulating the copper-oxide planes of high-T_c superconductors.…
An exactly solvable reaction-diffusion model consisting of first-class particles in the presence of a single second-class particle is introduced on a one-dimensional lattice with periodic boundary condition. The number of first-class…
Nonogram is a popular combinatorial puzzle (similar in nature to Sudoku or Minesweeper) in which a puzzle solver must determine if there exists a setting of the puzzle parameters that satisfy a given set of constraints. It has long been…
The matrix scaling problem, particularly the Sinkhorn-Knopp algorithm, has been studied for over 60 years. In practice, the algorithm often yields high-quality approximations within just a few iterations. Theoretically, however, the…