Related papers: Fixed speed competition on the configuration model…
Locally finding a solution to symmetry-breaking tasks such as vertex-coloring, edge-coloring, maximal matching, maximal independent set, etc., is a long-standing challenge in distributed network computing. More recently, it has also become…
We propose a random graph model with preferential attachment rule and \emph{edge-step functions} that govern the growth rate of the vertex set. We study the effect of these functions on the empirical degree distribution of these random…
We determine the asymptotic spreading speed of an invasive species, which invades the territory of a native competitor, governed by a diffusive competition model with a free boundary in a spherically symmetric setting. This free boundary…
A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…
We study a competitive stochastic growth model called chase-escape in which red particles spread to adjacent uncolored sites and blue only to adjacent red sites. Red particles are killed when blue occupies the same site. If blue has rate-1…
We consider the single-conflict coloring problem, a graph coloring problem in which each edge of a graph receives a forbidden ordered color pair. The task is to find a vertex coloring such that no two adjacent vertices receive a pair of…
The notions of bounded expansion and nowhere denseness not only offer robust and general definitions of uniform sparseness of graphs, they also describe the tractability boundary for several important algorithmic questions. In this paper we…
Graph parameters such as the clique number, the chromatic number, and the independence number are central in many areas, ranging from computer networks to linguistics to computational neuroscience to social networks. In particular, the…
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…
We study front propagation when an invading species competes with a resident; we assume nearest-neighbor preemptive competition for resources in an individual-based, two-dimensional lattice model. The asymptotic front velocity exhibits…
We study network robustness under correlated failures modeled by colors, where each color represents a class of edges or vertices that may fail simultaneously. An edge-colored graph is said to be edge-color-avoiding $k$-edge-connected if it…
We investigate the spreading behavior of two invasive species modeled by a Lotka-Volterra diffusive competition system with two free boundaries in a spherically symmetric setting. We show that, for the weak-strong competition case, under…
In this paper, we study orthogonal colourings of random geometric graphs. Two colourings of a graph are orthogonal if they have the property that when two vertices receive the same colour in one colouring, then those vertices receive…
We introduce a model of a preferential attachment based random graph which extends the family of models in which condensation phenomena can occur. Each vertex has an associated uniform random variable which we call its location. Our model…
A necessary and sufficient condition for a random walk in a finite directed graph subject to a road coloring to be measurable with respect to the driving random road colors is proved to be that the road coloring is synchronizing. For this,…
Diameter, radius and eccentricities are fundamental graph parameters, which are extensively studied in various computational settings. Typically, computing approximate answers can be much more efficient compared with computing exact…
We present a deterministic distributed algorithm in the LOCAL model that finds a proper $(\Delta + 1)$-edge-coloring of an $n$-vertex graph of maximum degree $\Delta$ in $\mathrm{poly}(\Delta, \log n)$ rounds. This is the first nontrivial…
A graph is \textit{locally irregular} if the neighbors of every vertex $v$ have degrees distinct from the degree of $v$. \textit{locally irregular edge-coloring} of a graph $G$ is an (improper) edge-coloring such that the graph induced on…
We prove several results on approximate decompositions of edge-coloured quasirandom graphs into rainbow spanning structures. More precisely, we say that an edge-colouring of a graph is locally $\ell$-bounded if no vertex is incident to more…
In this paper, we study a two stream species Lotka-Volterra competition patch model with the patches aligned along a line. The two species are supposed to be identical except for the diffusion rates. For each species, the diffusion rates…