Related papers: Minimal matchings of point processes
We propose two solution concepts for matchings under preferences: robustness and near stability. The former strengthens while the latter relaxes the classic definition of stability by Gale and Shapley (1962). Informally speaking, robustness…
In this paper, we establish a $C^{1,\alpha}$-regularity theorem for almost-minimizers of the functional $\mathcal{F}_{\varepsilon,\gamma}=P-\gamma P_{\varepsilon}$, where $\gamma\in(0,1)$ and $P_{\varepsilon}$ is a nonlocal energy…
Consider a unit-intensity point process $\Pi$ on the vertex set $V$ of a transitive non-amenable unimodular graph. We study invariant matchings between $\Pi$ and $V$ having small typical matching distances. When $\Pi$ is either a Poisson…
Given a graph on $n$ vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length $n$ visiting each vertex once and with pairwise different colours on the edges. Similarly (for even $n$) a rainbow…
Consider a measure $\mu_\lambda = \sum_x \xi_x \delta_x$ where the sum is over points $x$ of a Poisson point process of intensity $\lambda$ on a bounded region in $d$-space, and $\xi_x$ is a functional determined by the Poisson points near…
The Dirichlet form associated with the intrinsic gradient on Poisson space is known to be quasi-regular on the complete metric space $\ddot\Gamma=$ $\{Z_+$-valued Radon measures on $\IR^d\}$. We show that under mild conditions, the set…
The maximum matching problem on random graphs is studied analytically by the cavity method of statistical physics. When the average vertex degree \mth{c} is larger than \mth{2.7183}, groups of max-matching patterns which differ greatly from…
A matching is compatible to two or more labeled point sets of size $n$ with labels $\{1,\dots,n\}$ if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to…
An edge-colouring of a graph $G$ is said to be colour-balanced if there are equally many edges of each available colour. We are interested in finding a colour-balanced perfect matching within a colour-balanced clique $K_{2nk}$ with a…
This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…
Given a source of iid samples of edges of an input graph $G$ with $n$ vertices and $m$ edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in $G$? Moreover, is it possible to obtain…
We study the property of hitting points for a class of $\mathbb{R}^d$-valued continuous Gaussian random fields on $\mathbb{R}^N$ with stationary increments, i.i.d. coordinates, and a regularly varying variance function $\sigma$ of index…
Let each point of a homogeneous Poisson process on $\RR$ independently be equipped with a random number of stubs (half-edges) according to a given probability distribution $\mu$ on the positive integers. We consider schemes based on…
A path-matching of order $p$ is a vertex disjoint union of nontrivial paths spanning $p$ vertices. Burr and Roberts, and Faudree and Schelp determined the 2-color Ramsey number of path-matchings. In this paper we study the multicolor Ramsey…
Let $\Omega$ be an open, possibly unbounded, set in Euclidean space $\R^m$ with boundary $\partial\Omega,$ let $A$ be a measurable subset of $\Omega$ with measure $|A|$, and let $\gamma \in (0,1)$. We investigate whether the solution…
Given a set of $n$ points $P$ in the plane, each colored with one of the $t$ given colors, a color-spanning set $S\subset P$ is a subset of $t$ points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
It is well known that one can map certain properties of random matrices, fermionic gases, and zeros of the Riemann zeta function to a unique point process on the real line. Here we analytically provide exact generalizations of such a point…
We study a stable partial matching $\tau$ of the (possibly randomized) $d$-dimensional lattice with a stationary determinantal point process $\Psi$ on $\mathbb{R}^d$ with intensity $\alpha>1$. For instance, $\Psi$ might be a Poisson…
The two-dimensional one-component plasma, i.e. the system of point-like charged particles embedded in a homogeneous neutralizing background, is studied on the surface of a cylinder of finite circumference, or equivalently in a semiperiodic…