Related papers: An Oriented Competition model on Z_{+}^2
We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, $n$ not necessary disjoint points of a metric space $M$ are given, and are to be matched on-line with $n$ points of $M$ revealed one by one.…
We consider a directed variant of the negative-weight percolation model in a two-dimensional, periodic, square lattice. The problem exhibits edge weights which are taken from a distribution that allows for both positive and negative values.…
We introduce a 2-dimensional lattice model of granular matter. We use a combination of proof and simulation to demonstrate an order/disorder phase transition in the model, to which we associate the granular phenomenon of random close…
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…
The irreversible growth of a binary mixture under far-from-equilibrium conditions is studied in three-dimensional confined geometries of size $L_x \times L_y \times L_z$, where $L_z \gg L_x = L_y$ is the growing direction. A competing…
A simple d-dimensional lattice model is proposed, incorporating some degree of frustration and thus capable of describing some aspects of molecular orientation in covalently bound molecular solids. For d=2 the model is shown to be…
This study concerns the two-body scattering of particles in a one-dimensional periodic potential. A convenient ansatz allows for the separation of center-of-mass and relative motion, leading to a discrete Schr\"odinger equation in the…
We propose an experimental scheme to simulate and detect the properties of time-reversal invariant topological insulators, using cold atoms trapped in one-dimensional bichromatic optical lattices. This system is described by a…
We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…
This paper is concerned with a nonlocal diffusion Lotka-Volterra type competition model that consisting of a native species and an invasive species in a one-dimensional habitat with free boundaries. We prove the well-posedness of the system…
In this work, we consider the spatial-temporal multi-species competition model. A mathematical model is described by a coupled system of nonlinear diffusion-reaction equations. We use a finite volume approximation with semi-implicit time…
Consider the following simple coloring algorithm for a graph on $n$ vertices. Each vertex chooses a color from $\{1, \dotsc, \Delta(G) + 1\}$ uniformly at random. While there exists a conflicted vertex choose one such vertex uniformly at…
In this paper, we present improved algorithms for the $(\Delta+1)$ (vertex) coloring problem in the Congested-Clique model of distributed computing. In this model, the input is a graph on $n$ nodes, initially each node knows only its…
We consider the problem of learning a Gaussian graphical model in the case where the observations come from two dependent groups sharing the same variables. We focus on a family of coloured Gaussian graphical models specifically suited for…
We suggest a new mean field method for studying the thermodynamic competition between magnetic and superconducting phases in a two-dimensional square lattice. A partition function is constructed by writing microscopic interactions that…
Given a graph, an edge coloring assigns colors to edges so that no pairs of adjacent edges share the same color. We are interested in edge coloring algorithms under the W-streaming model. In this model, the algorithm does not have enough…
We study online bipartite edge coloring, with nodes on one side of the graph revealed sequentially. The trivial greedy algorithm is $(2-o(1))$-competitive, which is optimal for graphs of low maximum degree, $\Delta=O(\log n)$ [BNMN IPL'92].…
The large spacing phase of the infinite random matrix chain, which represents the strongly coupled two-dimensional O(2) model on a random planar lattice, is explored. A class of solutions valid for large lattice spacings is constructed. It…
We study the competition between two different topological orders in three dimensions by considering the X-cube model and the three-dimensional toric code. The corresponding Hamiltonian can be decomposed into two commuting parts, one of…
Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white neighbor force these white vertices to become blue. Here we…