相关论文: The structure of Chip Firing Games and related mod…

The infinite-bin model is a one-dimensional particle system on $\mathbb{Z}$ introduced by Foss and Konstantopoulos in relation with last passage percolation on complete directed acyclic graphs. In this model, at each integer time, a…

A nested occupancy scheme in random environment is a generalization of the classical Karlin infinite balls-in-boxes occupancy scheme in random environment (with random probabilities). Unlike the Karlin scheme in which the collection of…

The theory of Monotone Comparative Statics (MCS) has traditionally required a lattice structure, excluding certain multidimensional environments such as mixed-strategy games where this property fails. We show that this structure is not…

We analyze a cooperative game, where the cooperative act is not based on the previous behaviour of the co-player, but on the similarity between the players. This system has been studied in a mean-field description recently [A. Traulsen and…

Zero-sum stochastic games generalize the notion of Markov Decision Processes (i.e. controlled Markov chains, or stochastic dynamic programming) to the 2-player competitive case : two players jointly control the evolution of a state…

Social dilemmas concern a natural conflict between cooperation and self interests among individuals in large populations. The emergence of cooperation and its maintenance is the key for the understanding of fundamental concepts about the…

Conventional ordering transitions, described by the Landau paradigm, are characterized by the symmetries broken at the critical point. Within the constrained manifold occurring at low temperatures in certain frustrated systems,…

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…

We consider games played on the transtion graph of concurrent programs running under the Total Store Order (TSO) weak memory model. Games are frequently used to model the interaction between a system and its environment, in this case…

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $\lambda_A$ and $\lambda_B$, respectively,…

We study an interacting particle system of a finite number of labelled particles on the integer lattice, in which particles have intrinsic masses and left/right jump rates. If a particle is the minimal-label particle at its site when it…

We present a self-contained introduction to the theory of chip-firing games on metric graphs, as well as the more recent theory of tropical Prym varieties. We briefly discuss the connection between these notions and their algebraic…

We study a two-person game played on graphs based on the widely studied chip-firing game. Players Max and Min alternately place chips on the vertices of a graph. When a vertex accumulates as many chips as its degree, it fires, sending one…

We present an evolutionary self-governing model based on the numerical atomic rule $Z(a,b)=ab/\gcd(a,b)^2$, for $a,b$ positive integers. Starting with a sequence of numbers, the initial generation $Gin$, a new sequence is obtained by…

While 2D Gibbsian particle systems might exhibit orientational order resulting in a lattice-like structure, these particle systems do not exhibit positional order if the interaction between particles satisfies some weak assumptions. Here we…

The Z-domination game is a variant of the domination game in which each newly selected vertex $u$ in the game must have a not yet dominated neighbor, but after the move all vertices from the closed neighborhood of $u$ are declared to be…

We study Gibbs partitions that typically form a unique giant component. The remainder is shown to converge in total variation toward a Boltzmann-distributed limit structure. We demon- strate how this setting encompasses arbitrary weighted…

We consider restricted games on weighted graphs associated with minimum partitions. We replace in the classical definition of Myerson restricted game the connected components of any subgraph by the subcomponents corresponding to a minimum…

Line-breaking passes (LBPs) are crucial tactical actions in football, allowing teams to penetrate defensive lines and access high-value spaces. In this study, we present an unsupervised, clustering-based framework for detecting and…