Related papers: Formation of an interface by competitive erosion
We study a graph-theoretic model of interface dynamics called $Competitive\, Erosion$. Each vertex of the graph is occupied by a particle, which can be either red or blue. New red and blue particles are emitted alternately from their…
We study the following one-dimensional model of annihilating particles. Beginning with all sites of $\mathbb{Z}$ uncolored, a blue particle performs simple random walk from $0$ until it reaches a nonzero red or uncolored site, and turns…
The emergent dynamics in phase-separated mixtures of isometric active and passive Brownian particles is studied numerically in two dimensions. A novel steady-state of well-defined traveling fronts is observed, where the interface between…
Chase-escape is a competitive growth process in which red particles spread to adjacent empty sites according to a rate-$\lambda$ Poisson process while being chased and consumed by blue particles according to a rate-$1$ Poisson process.…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
Particles bound to an interface interact because they deform its shape. The stresses that result are fully encoded in the geometry and described by a divergence-free surface stress tensor. This stress tensor can be used to express the force…
Diffusion in an evolving environment is studied by continuos-time Monte Carlo simulations. Diffusion is modelled by continuos-time random walkers on a lattice, in a dynamic environment provided by bubbles between two one-dimensional…
In this article we study the interface generated by the collision between two cristals growing layer by layer on a one-dimensional substrate through random decomposition of particles. We relate this interface with the notion of beta-path in…
The competition interface between two growing ``Young clusters'' (diagrams), in a two-dimensional random cone, is mapped to the path of a second-class particle in the one-dimensional totally asymmetric simple exclusion process. Using the…
A competition process on $\mathbb{Z}^d$ is considered, where two species compete to color the sites. The entities are driven by branching random walks. Specifically red (blue) particles reproduce in discrete time and place offspring…
Coalition formation over graphs is a well studied class of games whose players are vertices and feasible coalitions must be connected subgraphs. In this setting, the existence and computation of equilibria, under various notions of…
We consider a two-type oriented competition model on the first quadrant of the two-dimensional integer lattice. Each vertex of the space may contain only one particle of either Red type or Blue type. A vertex flips to the color of a…
Soft interfaces can mediate interactions between particles bound to them. The force transmitted through the surface geometry on a particle may be expressed as a closed line integral of the surface stress tensor around that particle. This…
We study the competition interface between two growing clusters in a growth model associated to last-passage percolation. When the initial unoccupied set is approximately a cone, we show that this interface has an asymptotic direction with…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
Non-equilibrium self-organized patterns formed by particles interacting through competing range interaction are driven over a substrate by an external force. We show that, with increasing driving force, the pre-existed static patterns…
The dynamics of sharp interfaces separating two non-hydrostatically stressed solids is analyzed using the idea that the rate of mass transport across the interface is proportional to the thermodynamic potential difference across the…
This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At each time step the second player guesses a vertex, winning if…
We study the dynamics of flow-networks in porous media using a pore-network model. First, we consider a class of erosion dynamics assuming a constitutive law depending on flow rate, local velocities, or shear stress at the walls. We show…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…