相关论文: The structure of Chip Firing Games and related mod…
First cycle games (FCG) are played on a finite graph by two players who push a token along the edges until a vertex is repeated, and a simple cycle is formed. The winner is determined by some fixed property Y of the sequence of labels of…
We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…
We study the spatial structure of a granular material, N particles subject to inelastic mutual collisions, when it is stirred by a bidimensional smooth chaotic flow. A simple dynamical model is introduced where four different time scales…
The cornerstone underpinning deep learning is the guarantee that gradient descent on an objective converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, where there are multiple…
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…
The Abelian Sandpile Model is a discrete diffusion process defined on graphs (Dhar \cite{DD90}, Dhar et al. \cite{DD95}) which serves as the standard model of \textit{self-organized criticality}. The transience class of a sandpile is…
We study finite particle systems on the one-dimensional integer lattice, where each particle performs a continuous-time nearest-neighbour random walk, with jump rates intrinsic to each particle, subject to an exclusion interaction which…
Rock-scissors-paper game, as the simplest model of intransitive relation between competing agents, is a frequently quoted model to explain the stable diversity of competitors in the race of surviving. When increasing the number of…
A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest…
Markov chains are an important example for a course on stochastic processes because simple board games can be used to illustrate the fundamental concepts. For example, a looping board game (like Monopoly) consists of all recurrent states,…
We show that the probability distribution of the residence-times of sand grains in sandpile models, in the scaling limit, can be expressed in terms of the survival probability of a single diffusing particle in a medium with absorbing…
We study a family of models for an $N_1 \times N_2$ matrix worth of Ising spins $S_{aB}$. In the large $N_i$ limit we show that the spins soften, so that the partition function is described by a bosonic matrix integral with a single…
Deep learning is built on the foundational guarantee that gradient descent on an objective function converges to local minima. Unfortunately, this guarantee fails in settings, such as generative adversarial nets, that exhibit multiple…
We introduce a one-dimensional sandpile model which incorporates particle inertia. The inertial dynamics are governed by a new parameter which, as it passes through a threshold value, alters the toppling dynamics in such a way that the…
A neural network is a powerful tool that can uncover hidden laws beyond human intuition. However, it often appears as a black box due to its complicated nonlinear structures. By drawing upon the Gutzwiller mean-field theory, we can showcase…
We propose a generalization of the graphical chip-firing model allowing for the redistribution dynamics to be governed by any invertible integer matrix while maintaining the long term critical, superstable, and energy minimizing behavior of…
The number of quantifiers needed to express first-order properties is captured by two-player combinatorial games called multi-structural (MS) games. We play these games on linear orders and strings, and introduce a technique we call…
There are many combinatorial games in which a move can terminate the game, such as a checkmate in chess. These moves give rise to diverse situations that fall outside the scope of the classical normal play structure. To analyze these games,…
We consider a two-dimensional model of three species in rock-paper-scissors competition and study the self-organisation of the population into fascinating spiraling patterns. Within our individual-based metapopulation formulation, the…
We introduce and study Maker/Breaker-type positional games on random graphs. Our main concern is to determine the threshold probability $p_{F}$ for the existence of Maker's strategy to claim a member of $F$ in the unbiased game played on…