相关论文: An Oriented Competition model on Z_{+}^2

We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent tau in (2,3). In this model two colors spread with a fixed but not…

We survey partial geometric designs and investigate their concurrences of points. The concurrence matrix of a design, which encodes the concurrences of pairs of points, can be used in the classification of designs in some extent. An…

We analyze the bifurcation phenomenon for the following two-component competition system: \begin{equation*} \begin{cases} -\Delta u_1=\mu u_1(1-u_1)-\beta \alpha u_1u_2,& \text{in}\ B_1\subset \mathbb{R}^N, -\Delta u_2=\sigma…

Given two sets $R$ and $B$ of $n$ points in the plane, we present efficient algorithms to find a two-line linear classifier that best separates the "red" points in $R$ from the "blue" points in $B$ and is robust to outliers. More precisely,…

The East model is a one-dimensional, non-attractive interacting particle system with Glauber dynamics, in which a flip is prohibited at a site $x$ if the right neighbour $x+1$ is occupied. Starting from a configuration entirely occupied on…

The one-dimensional nearest-neighbor totally asymmetric simple exclusion process can be constructed in the same space as a last-passage percolation model in Z^2. We show that the trajectory of a second class particle in the exclusion…

We investigate the long term behavior for a class of competition-diffusion systems of Lotka-Volterra type for two competing species in the case of low regularity assumptions on the data. Due to the coupling that we consider the system…

The physical properties of arbitrary half-integer spins F = N - 1/2 fermionic cold atoms loaded into a one-dimensional optical lattice are investigated by means of a conformal field theory approach. We show that for attractive interactions…

We study a system of particles in two dimensions interacting via a dipolar long-range potential $D/r^3$ and subject to a square-lattice substrate potential $V({\bf r})$ with amplitude $V$ and lattice constant $b$. The isotropic interaction…

Within the framework of Relativistic Schroedinger Theory (an alternative form of quantum mechanics for relativistic many-particle systems) it is shown that a general N-particle system must occur in one of two forms: either as a ``positive''…

We study the following local-to-global phenomenon: Let $B$ and $R$ be two finite sets of (blue and red) points in the Euclidean plane $\mathbb{R}^2$. Suppose that in each "neighborhood" of a red point, the number of blue points is at least…

Resource competition is a fundamental interaction in natural communities.However little is known about competition in spatial environments where organisms are able to regulate resource distributions. Here, we analyze the competition of two…

A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…

Let $T$ be a $C^{1}$ competitive map on a rectangular region $R\subset \mathbb{R}^{2}$. The main results of this paper give conditions which guarantee the existence of an invariant curve $C$, which is the graph of a continuous increasing…

Vizing's theorem states that any graph of maximum degree $\Delta$ can be properly edge colored with at most $\Delta+1$ colors. In the online setting, it has been a matter of interest to find an algorithm that can properly edge color any…

We consider the Constrained-degree percolation model in random environment on the square lattice. In this model, each vertex $v$ has an independent random constraint ${\kappa}_v$ which takes the value $j\in \{0,1,2,3\}$ with probability…

We consider independent edge percolation models on Z, with edge occupation probabilities p_<x,y> = p if |x-y| = 1, 1 - exp{- beta / |x-y|^2} otherwise. We prove that oriented percolation occurs when beta > 1 provided p is chosen…

Vizing's theorem states that any $n$-vertex $m$-edge graph of maximum degree $\Delta$ can be edge colored using at most $\Delta + 1$ different colors [Vizing, 1964]. Vizing's original proof is algorithmic and shows that such an edge…

We consider a bichromatic two-center problem for pairs of points. Given a set $S$ of $n$ pairs of points in the plane, for every pair, we want to assign a red color to one point and a blue color to the other, in such a way that the value…

Given a set R of red points and a set B of blue points in the plane, the Red-Blue point separation problem asks if there are at most k lines that separate R from B, that is, each cell induced by the lines of the solution is either empty or…