Related papers: Multicolour Poisson Matching
Given a finite set of red and blue points in $\Rspace^d$, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning…
We consider a fixed-point equation for a non-negative integer-valued random variable, that appears in branching processes with state-independent immigration. A similar equation appears in the analysis of a single-server queue with a…
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…
A $t$-tone coloring of a graph $G$ assigns to each vertex a set of $t$ colors such that any pair of vertices $u, v$ with distance $d$ can share at most $d-1$ colors. In this note, we prove several new results on $t$-tone coloring. For…
We study the cyclic color sequences induced at infinity by colored rays with apices being a given balanced finite bichromatic point set. We first study the case in which the rays are required to be pairwise disjoint. We derive a lower bound…
We study the connections existing between max-infinitely divisible distributions and Poisson processes from the point of view of functional analysis. More precisely, we derive functional identities for the former by using well-known results…
We propose and analyze a class of vectorial crystallization problems, with applications to crystallization of anisotropic molecules and collective behavior such as birds flocking and fish schooling. We focus on two-dimensional systems of…
List colouring is an influential and classic topic in graph theory. We initiate the study of a natural strengthening of this problem, where instead of one list-colouring, we seek many in parallel. Our explorations have uncovered a…
We study combinatorial indicators related to the characteristic phase transitions associated with coloring a graph optimally and finding a maximum independent set. In particular, we investigate the role of the acyclic orientations of the…
We consider the soft Boolean model, a model that interpolates between the Boolean model and long-range percolation, where vertices are given via a stationary Poisson point process. Each vertex carries an independent Pareto-distributed…
We study algorithmic matroid intersection coloring. Given $k$ matroids on a common ground set $U$ of $n$ elements, the goal is to partition $U$ into the fewest number of color classes, where each color class is independent in all matroids.…
We provide a generic scheme to separate the particles of a mixture by their physical properties like mass, friction or size. The scheme employs a periodically shaken two dimensional dissipative lattice and hinges on a simultaneous transport…
In this paper, we consider a number of results and seven conjectures on properly edge-coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prove new ones. In particular, we consider a family of…
The aim of change-point detection is to identify behavioral shifts within time series data. This article focuses on scenarios where the data is derived from an inhomogeneous Poisson process or a marked Poisson process. We present a…
We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute…
In this work we consider the primal mixed variational formulation of the Poisson equation with a line source. The analysis and approximation of this problem is non-standard as the line source causes the solutions to be singular. We start by…
Let G be a compact Lie group or a complex reductive affine algebraic group. We explore induced mappings between G-character varieties of surface groups by mappings between corresponding surfaces. It is shown that these mappings are…
The Poisson multinomial distribution (PMD) describes the distribution of the sum of $n$ independent but non-identically distributed random vectors, in which each random vector is of length $m$ with 0/1 valued elements and only one of its…
Max-infinitely divisible (max-id) processes play a central role in extreme-value theory and include the subclass of all max-stable processes. They allow for a constructive representation based on the pointwise maximum of random functions…
This paper studies sufficient conditions to obtain efficient distributed algorithms coloring graphs optimally (i.e.\ with the minimum number of colors) in the LOCAL model of computation. Most of the work on distributed vertex coloring so…