Related papers: An Oriented Competition model on Z_{+}^2
We consider two competing first passage percolation processes started from uniformly chosen subsets of a random regular graph on $N$ vertices. The processes are allowed to spread with different rates, start from vertex subsets of different…
A stochastic birth-death competition model for particles with excluded volume is proposed. The particles move, reproduce, and die on a regular lattice. While the death rate is constant, the birth rate is spatially nonlocal and implements…
We study a geometrically constrained coalescence model derived from spin systems. Given two probability distributions $\mathbb{P}_R$ and $\mathbb{P}_B$ on the positive reals with finite means, colour the real line alternately with red and…
The current paper is devoted to the study of two species competition systems of the form \begin{equation*} \begin{cases} u_t(t,x)= \mathcal{A} u+u(a_1(t,x)-b_1(t,x)u-c_1(t,x)v),\quad x\in\RR\cr v_t(t,x)= \mathcal{A} v+…
A tight-binding model for $e_g$ orbitals on a square lattice is investigated. We consider only the nearest-neighbor hopping and the model is characterized by two hopping parameters, $t_1$ and $t_2$. There are Dirac points in the electronic…
We present a new approach, called a lazy matching, to the problem of on-line matching on bipartite graphs. Imagine that one side of a graph is given and the vertices of the other side are arriving on-line. Originally, incoming vertex is…
We study online competitive algorithms for the \emph{line chasing problem} in Euclidean spaces $\reals^d$, where the input consists of an initial point $P_0$ and a sequence of lines $X_1,X_2,...,X_m$, revealed one at a time. At each step…
We describe a class of parity- and time-reversal-invariant topological states of matter which can arise in correlated electron systems in 2+1-dimensions. These states are characterized by particle-like excitations exhibiting exotic braiding…
The problem of online matching with stochastic rewards is a generalization of the online bipartite matching problem where each edge has a probability of success. When a match is made it succeeds with the probability of the corresponding…
It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…
Suppose that red and blue points form independent homogeneous Poisson processes of equal intensity in $R^d$. For a positive (respectively, negative) parameter $\gamma$ we consider red-blue matchings that locally minimize (respectively,…
We say that a digraph $D$ is competitive if any pair of vertices has a common out-neighbor in $D$ and that a graph $G$ is competitively orientable if there exists a competitive orientation of $G$. The notion of competitive digraphs arose…
Infinitely many particles of two types ("plus" and "minus") jump randomly along the one-dimensional lattice $\mathbf{Z}_{\varepsilon}=\varepsilon\mathbf{Z}$. Annihillations occur when two particles of different time occupy the same site.…
We study the following microscopic model of infection or epidemic reaction: red and blue particles perform independent nearest-neighbor continuous-time symmetric random walks on the integer lattice $\mathbb{Z}$ with jump rates $D_R$ for red…
Consider several independent Poisson point processes on R^d, each with a different colour and perhaps a different intensity, and suppose we are given a set of allowed family types, each of which is a multiset of colours such as red-blue or…
Including an extra reactant in the Gray-Scott reaction-diffusion model, the dynamical competition between different chemical species during the Turing pattern formation can lead to species territory invasion phenomenon among different…
Optical vortices arise as phase singularities of the light fields and are of central interest in modern optical physics. In this paper, some existence theorems are established for stationary vortex wave solutions of a general class of…
Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a \emph{color}. While the answer to an orthogonal point reporting query contains all points in the…
We consider a mixture of a two-component Fermi gas and a single-component dipolar Bose gas in a square optical lattice and reduce it into an effective Fermi system where the Fermi-Fermi interaction includes the attractive interaction…
A discrete-time totally asymmetric simple exclusion process on a lattice with open boundaries is considered. There are particles of different types. The type of a particle is characterized by the probability that a particle moves to a…