Related papers: Poisson Matching
The decreasing enumeration of the points of a Poisson random measure whose mean measure has finite survival function on the positive half-axis can be represented as a non-increasing function of the jump times of a standard Poisson process.…
We apply the Stein-Chen method to problems from extreme value theory. On the one hand, the Stein-Chen method for Poisson approximation allows us to obtain bounds on the Kolmogorov distance between the law of the maximum of i.i.d. random…
Stable matching is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley. In this paper, we provide a new upper bound on…
Consider an unlimited homogeneous medium disturbed by points generated via Poisson process. The neighborhood of a point plays an important role in spatial statistics problems. Here, we obtain analytically the distance statistics to $k$th…
We consider a model of a discrete time "interacting particle system" on the integer line where infinitely many changes are allowed at each instance of time. We describe the model using chameleons of two different colours, {\it viz}., red…
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…
Suppose each of $n$ men and $n$ women is located at a point in a metric space. A woman ranks the men in order of their distance to her from closest to farthest, breaking ties at random. The men rank the women similarly. An interesting…
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…
We study the Reaching Stable Marriage via Divorces (DivorceSM) problem of deciding, given a Stable Marriage instance and an initial matching $M$ , whether there exists a stable matching which is reachable from $M$ by divorce operations as…
We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…
We consider a $d$-dimensional random field $u=(u(x), x\in D)$ that solves a system of elliptic stochastic equations on a bounded domain $D\subset \mathbb{R}^k$, with additive white noise and spatial dimension $k=1,2,3$. Properties of $u$…
We investigate Maxwell-Chern-Simons theory on a three-dimensional noncommutative spacetime endowed with a constant spacelike Poisson structure. By exploiting the residual rotational symmetry, we construct exact classical solutions…
Let $[\mathcal{P}]$ be the points of a Poisson process on $\mathbb{R}^d$ and $F$ a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set…
The paper introduces a Poisson-type problem on a mixed-dimensional structure combining a Euclidean domain and a lower-dimensional self-similar component touching a compact surface (interface). The lower-dimensional piece is a so-called…
Suppose one desires to randomly sample a pair of objects such as socks, hoping to get a matching pair. Even in the simplest situation for sampling, which is sampling with replacement, the innocent phrase "the distribution of the color of a…
For $N\in\mathbb{N}$, let $\pi_N$ be the law of the number of fixed points of a random permutation of $\{1, 2, ..., N\}$. Let $\mathcal{P}$ be a Poisson law of parameter 1.A classical result shows that $\pi_N$ converges to $\mathcal{P}$ for…
The notion of $r$-crossing and $r$-nesting of a complete matching was introduced and a symmetry property was proved by Chen et al. [Trans. Amer. Math. Soc. 359 (2007) 1555-1575]. We consider random matchings of large size and study their…
In multi-parameter persistence, the matching distance is defined as the supremum of weighted bottleneck distances on the barcodes given by the restriction of persistence modules to lines with a positive slope. In the case of finitely…
We consider the stability of matchings when individuals strategically submit preference information to a publicly known algorithm. Most pure Nash equilibria of the ensuing game yield a matching that is unstable with respect to the…
We study the optimization of the stable marriage problem. All individuals attempt to optimize their own satisfaction, subject to mutually conflicting constraints. We find that the stable solutions are generally not the globally best…