Related papers: Phase transition for Minesweeper
We are interested in studying the stationary solutions and phase transitions of aggregation equations with degenerate diffusion of porous medium-type, with exponent $1 < m < \infty$. We first prove the existence of possibly infinitely many…
Topological phase transitions challenge conventional paradigms in many-body physics by separating phases that are locally indistinguishable yet globally distinct. Using a quantum simulator of interacting erbium atoms in an optical lattice,…
Conway's cellular automaton Game of LIFE has been conjectured to be a critical (or quasicritical) dynamical system. This criticality is generally seen as a continuous order-disorder transition in cellular automata (CA) rule space. LIFE's…
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Effects of a corrupt source on the dynamics of simultaneous move strategic games are analyzed both for classical and quantum settings. The corruption rate dependent changes in the payoffs and strategies of the players are observed. It is…
We study stochastic two-player turn-based games in which the objective of one player is to ensure several infinite-horizon total reward objectives, while the other player attempts to spoil at least one of the objectives. The games have…
We explore nonadiabatic quantum phase transitions in an Ising spin chain with a linearly time-dependent transverse field and two different spins per unit cell. Such a spin system passes through critical points with gapless excitations,…
In the paper it is proven that the two-players turn-based stochastic game "Risk or Safety" has a unique solution. Both players need to play the same strategy if they want to maximize their winning chances. An analytical method based on the…
In this paper it is shown that given a sufficient number of (noisy) random binary linear equations, the Learning from Parity with Noise (LPN) problem can be solved in essentially cube root time in the number of unknowns. The techniques used…
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…
Despite the widespread use and success of machine-learning techniques for detecting phase transitions from data, their working principle and fundamental limits remain elusive. Here, we explain the inner workings and identify potential…
Quantum game theory is a rapidly evolving subject that extends beyond physics. In this research work, a schematic picture of quantum game theory has been provided with the help of the famous game Prisoners' Dilemma. It has been considered…
We study algorithmic problems in multi-stage open shop processing systems that are centered around reachability and deadlock detection questions. We characterize safe and unsafe system states. We show that it is easy to recognize system…
Heuristic methods for solution of problems in the NP-Complete class of decision problems often reach exact solutions, but fail badly at "phase boundaries", across which the decision to be reached changes from almost always having one value…
We consider concurrent games played on graphs. At every round of a game, each player simultaneously and independently selects a move; the moves jointly determine the transition to a successor state. Two basic objectives are the safety…
We study a random matrix model for the statistical properties of the purity of a bipartite quantum system at a finite (fictitious) temperature. This enables us to write the generating function for the cumulants, for both balanced and…
The computer-assisted modeling of re-entrant production lines, and, in particular, simulation scalability, is attracting a lot of attention due to the importance of such lines in semiconductor manufacturing. Re-entrant flows lead to…
Sharp quantum phase transitions typically require a large system with many particles. Here we show that for a frustrated fully-connected Ising spin network represented by trapped atomic ions, the competition between different spin orders…
A generalized version of the fidelity susceptibility of single-band and multi-orbital Hubbard models is systematically studied using single-site dynamical mean-field theory in combination with a hybridization expansion continuous-time…
We study the effectiveness of iterated elimination of strictly-dominated actions in random games. We show that dominance solvability of games is vanishingly small as the number of at least one player's actions grows. Furthermore,…