Related papers: Phase transition for Minesweeper
Zonotopes are widely used for over-approximating forward reachable sets of uncertain linear systems for verification purposes. In this paper, we use zonotopes to achieve more scalable algorithms that under-approximate backward reachable…
We study the graph alignment problem over two independent Erd\H{o}s-R\'enyi graphs on $n$ vertices, with edge density $p$ falling into two regimes separated by the critical window around $p_c=\sqrt{\log n/n}$. Our result reveals an…
This paper discusses the problem of efficiently solving parity games where player Odd has to obey an additional 'strong transition fairness constraint' on its vertices -- given that a player Odd vertex $v$ is visited infinitely often, a…
Sudoku is a widely popular $\mathcal{NP}$-Complete combinatorial puzzle whose prospects for studying human computation have recently received attention, but the algorithmic hardness of Sudoku solving is yet largely unexplored. In this…
We investigate the nonequilibrium dynamics and loss of coherence in a quantum impurity system using the spinless resonant level model subject to sudden quenches of the hybridization between the impurity and the metal. The survival…
Mineral precipitation and dissolution processes in a porous medium can alter the structure of the medium at the scale of pores. Such changes make numerical simulations a challenging task as the geometry of the pores changes in time in an…
We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…
We study a generalisation of B\"uchi-Landweber games to the timed setting. The winning condition is specified by a non-deterministic timed automaton with epsilon transitions and only Player I can elapse time. We show that for fixed number…
Weighted timed games are two-player zero-sum games played in a timed automaton equipped with integer weights. We consider optimal reachability objectives, in which one of the players, that we call Min, wants to reach a target location while…
Temporal graphs are a popular modelling mechanism for dynamic complex systems that extend ordinary graphs with discrete time. Simply put, time progresses one unit per step and the availability of edges can change with time. We consider the…
In the corrupted compass model on a vertex-transitive graph, a neighbouring edge of every vertex is chosen uniformly at random and opened. Additionally, with probability $p$, independently for every vertex, every neighbouring edge is…
We study diffusion of hardcore particles on a one dimensional periodic lattice subjected to a constraint that the separation between any two consecutive particles does not increase beyond a fixed value $(n+1);$ initial separation larger…
The discontinuous dependence of the properties of a quantum game on its entanglement has been shown up to be very much like phase transitions viewed in the entanglement-payoff diagram [J. Du et al., Phys. Rev. Lett, 88, 137902 (2002)]. In…
Multiphase flow in porous media occurs in several disciplines including petroleum reservoir engineering, petroleum systems' analysis, and CO$_2$ sequestration. While simulations often use a fully implicit discretization to increase the time…
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…
We study variants of regular infinite games where the strict alternation of moves between the two players is subject to modifications. The second player may postpone a move for a finite number of steps, or, in other words, exploit in his…
We solve the classical "Game of Pure Strategy" using linear programming. We notice an intricate even-odd behavior in the results of our computations, that seems to encourage odd or maximal bids.
In this paper, we study a two-stage stochastic version of the assignment game, which is a fundamental cooperative game. Given an initial setting, the set of players may change in the second stage according to some probability distribution,…
Probabilistic timed automata are a suitable formalism to model systems with real-time, nondeterministic and probabilistic behaviour. We study two-player zero-sum games on such automata where the objective of the game is specified as the…
We investigate the quantum phase transition in the random transverse-field Ising model under the influence of Ohmic dissipation. To this end, we numerically implement a strong-disorder renormalization-group scheme. We find that Ohmic…