English
Related papers

Related papers: Phase transition for Minesweeper

200 papers

Motivated by the similarity between adiabatic quantum algorithms and quantum phase transitions, we study the impact of decoherence on the sweep through a second-order quantum phase transition for the prototypical example of the Ising chain…

Quantum Physics · Physics 2013-05-29 Sarah Mostame , Gernot Schaller , Ralf Schützhold

We examine two-player games over finite weighted graphs with quantitative (mean-payoff or energy) objective, where one of the players additionally needs to satisfy a fairness objective. The specific fairness we consider is called 'strong…

Computer Science and Game Theory · Computer Science 2025-01-30 Ashwani Anand , Satya Prakash Nayak , Ritam Raha , Irmak Sağlam , Anne-Kathrin Schmuck

Bilevel programming problems are often found in practice. In this paper, we handle one such bilevel application problem from the domain of environmental economics. The problem is a Stakelberg game with multiple objectives at the upper…

Computer Science and Game Theory · Computer Science 2013-07-25 Ankur Sinha , Pekka Malo , Anton Frantsev , Kalyanmoy Deb

We realize an extensive numerical study of the Naming Game model with a noise term which accounts for perturbations. This model displays a non-equilibrium phase transition between an absorbing ordered consensus state, which occurs for small…

Physics and Society · Physics 2016-11-15 E. Brigatti , A. Hernández

A recently proposed exact algorithm for the maximum independent set problem is analyzed. The typical running time is improved exponentially in some parameter regions compared to simple binary search. The algorithm also overcomes the core…

Disordered Systems and Neural Networks · Physics 2017-08-02 Jun Takahashi , Satoshi Takabe , Koji Hukushima

We prove a deterministic exponential time upper bound for Quantum Merlin-Arthur games with k unentangled provers. This is the first non-trivial upper bound of QMA(k) better than NEXP and can be considered an exponential improvement, unless…

Quantum Physics · Physics 2016-11-29 Martin Schwarz

In this paper we investigate lossy channel games under incomplete information, where two players operate on a finite set of unbounded FIFO channels and one player, representing a system component under consideration operates under…

Logic in Computer Science · Computer Science 2013-03-05 Rayna Dimitrova , Bernd Finkbeiner

Reachability for piecewise affine systems is known to be undecidable, starting from dimension $2$. In this paper we investigate the exact complexity of several decidable variants of reachability and control questions for piecewise affine…

Computational Complexity · Computer Science 2017-01-18 Hugo Bazille , Olivier Bournez , Walid Gomaa , Amaury Pouly

Experimental quantum simulators have become large and complex enough that discovering new physics from the huge amount of measurement data can be quite challenging, especially when little theoretical understanding of the simulated model is…

Quantum Physics · Physics 2020-12-08 Alexander Lidiak , Zhexuan Gong

Many-variable differential equations with random coefficients provide powerful models for the dynamics of many interacting species in ecology. These models are known to exhibit a dynamical phase transition from a phase where population…

Statistical Mechanics · Physics 2025-02-19 Thibaut Arnoulx de Pirey , Guy Bunin

Random instances of constraint satisfaction problems such as k-SAT provide challenging benchmarks. If there are m constraints over n variables there is typically a large range of densities r=m/n where solutions are known to exist with…

Discrete Mathematics · Computer Science 2009-11-13 Amin Coja-Oghlan

In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…

Disordered Systems and Neural Networks · Physics 2009-10-31 Martin Weigt , Alexander K. Hartmann

The divisible sandpile starts with i.i.d. random variables ("masses") at the vertices of an infinite, vertex-transitive graph, and redistributes mass by a local toppling rule in an attempt to make all masses at most 1. The process…

Probability · Mathematics 2016-06-29 Lionel Levine , Mathav Murugan , Yuval Peres , Baris Evren Ugurcan

We examine the collective dynamics of disks moving through a square array of obstacles under cyclic square wave driving. Below a critical density we find that system organizes into a reversible state in which the disks return to the same…

Soft Condensed Matter · Physics 2024-04-23 C. Reichhardt , C. J. O. Reichhardt

In the framework of continuous time symmetric stochastic differential games in open loop strategies, we introduce a generalization of mean field game solution, called coarse correlated solution. This can be seen as the analogue of a coarse…

Probability · Mathematics 2024-12-20 Luciano Campi , Federico Cannerozzi , Markus Fischer

We report a dynamical phase transition from integrability to non-integrability in a simple oval-like billiard with boundary $R(\theta)=1+\epsilon\cos(p\theta)$. For $\epsilon=0$, the phase space is {\it foliated} by invariant curves…

Symmetry breaking has been a central theme in classifying quantum phases and phase transitions. Recently, this concept has been extended to the mixed states of open systems, attracting considerable attention due to the emergence of novel…

Strongly Correlated Electrons · Physics 2025-10-21 Yuxuan Guo , Sheng Yang , Xue-Jia Yu

The decay of metastable states is dominated by quantum tunneling at low temperatures and by thermal activation at high temperatures. The escape rate of a particle out of a square well is calculated within a semi-classical approximation and…

Mesoscale and Nanoscale Physics · Physics 2007-05-23 Denis A. Gorokhov , Rava A. da Silveira

The Value Problem for weighted timed games (wtgs) consists in determining, given a two-player weighted timed game with a reachability objective and a rational threshold, whether or not the value of the game exceeds the threshold. When…

Logic in Computer Science · Computer Science 2025-08-04 Isa Vialard

Admissibility has been studied for games of infinite duration with Boolean objectives. We extend here this study to games of infinite duration with quantitative objectives. First, we show that, un- der the assumption that optimal worst-case…

Logic in Computer Science · Computer Science 2016-11-29 Romain Brenguier , Guillermo A. Pérez , Jean-François Raskin , Ocan Sankur
‹ Prev 1 8 9 10 Next ›