Related papers: An Oriented Competition model on Z_{+}^2
In the two-type Richardson model on a graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, each vertex is at a given time in state $0$, $1$ or $2$. A $0$ flips to a $1$ (resp.\ $2$) at rate $\lambda_1$ ($\lambda_2$) times the number of…
A two-dimensional half-filled lattice gas model with nearest-neighbor attractive interaction is studied where particles are coupled to two thermal baths at different temperatures $T_1$ and $T_2$. The hopping of particles is governed by the…
We study a system of dipolar molecules confined in a two-dimensional trap and subject to an optical square lattice. The repulsive long-range dipolar interaction $D/r^3$ favors an equilateral triangular arrangement of the molecules, which…
We study the problem of chasing convex bodies online: given a sequence of convex bodies $K_t\subseteq \mathbb{R}^d$ the algorithm must respond with points $x_t\in K_t$ in an online fashion (i.e., $x_t$ is chosen before $K_{t+1}$ is…
Novel competing orders are found in spin 3/2 cold atomic systems in one-dimensional optical traps and lattices. In particular, the quartetting phase, a four-fermion counterpart of Cooper pairing, exists in a large portion of the phase…
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…
A model named `Colored Percolation' has been introduced with its infinite number of versions in two dimensions. The sites of a regular lattice are randomly occupied with probability $p$ and are then colored by one of the $n$ distinct colors…
We consider a two-dimensional system with two order parameters, one with O(2) symmetry and one with O($M$), near a point in parameter space where they couple to become a single O($2+M$) order. While the O(2) sector supports vortex…
In the setting of online algorithms, the input is initially not present but rather arrive one-by-one over time and after each input, the algorithm has to make a decision. Depending on the formulation of the problem, the algorithm might be…
The models introduced in this paper describe a uniform distribution of plant stems competing for sunlight. The shape of each stem, and the density of leaves, are designed in order to maximize the captured sunlight, subject to a cost for…
A stochastic model, describing the growth of two competing infections on $\mathbb{R}^d$, is introduced. The growth is driven by outbursts in the infected region, an outburst in the type 1 (2) infected region transmitting the type 1 (2)…
We investigate the structural and thermodynamic properties of a model of particles with $2$ patches of type $A$ and $10$ patches of type $B$. Particles are placed on the sites of a face centered cubic lattice with the patches oriented along…
We study models of spatial growth processes where initially there are sources of growth (indicated by the colour green) and sources of a growth-stopping (paralyzing) substance (indicated by red). The green sources expand and may merge with…
In the Colored Bin Packing problem a sequence of items of sizes up to $1$ arrives to be packed into bins of unit capacity. Each item has one of $c\geq 2$ colors and an additional constraint is that we cannot pack two items of the same color…
This paper is concerned with some spreading properties of monostable Lotka--Volterra two-species competition--diffusion systems when the initial values are null or exponentially decaying in a right half-line. Thanks to a careful…
Given a set R of n red points and a set B of m blue points, we study the problem of finding a rectangle that contains all the red points, the minimum number of blue points and has the largest area. We call such rectangle a maximum…
In multitype lattice gas models with hard-core interaction of Widom--Rowlinson type, there is a competition between the entropy due to the large number of types, and the positional energy and geometry resulting from the exclusion rule and…
We consider the following interacting particle system: There is a ``gas'' of particles, each of which performs a continuous time simple random walk on the d-dimensional lattice. These particles are called A-particles and move independently…
Given a set of $n$ red and $n$ blue points in the plane, we are interested in matching red points with blue points by straight line segments so that the segments do not cross. We develop a range of tools for dealing with the non-crossing…
A set of binary random variables indexed by a lattice torus is considered. Under a mixing hypothesis, the probability of any proposition belonging to the first order logic of colored graphs tends to 0 or 1, as the size of the lattice tends…