Related papers: Poisson Matching
We study point processes that consist of certain centers of point tuples of an underlying Poisson process. Such processes arise in stochastic geometry in the study of exceedances of various functionals describing geometric properties of the…
Computational difficulty of quadratic matching and the Gromov-Wasserstein distance has led to various approximation and relaxation schemes. One of such methods, relying on the notion of distance profiles, has been widely used in practice,…
A limit theorem for the largest interpoint distance of $p$ independent and identically distributed points in $\mathbb{R}^n$ to the Gumbel distribution is proved, where the number of points $p=p_n$ tends to infinity as the dimension of the…
Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In…
The aim of the present article is to introduce a concept which allows to generalise the notion of Poissonian pair correlation, a second-order equidistribution property, to higher dimensions. Roughly speaking, in the one-dimensional setting,…
The stable matching problem has been the subject of intense theoretical and empirical study since the seminal 1962 paper by Gale and Shapley. The number of stable matchings for different systems of preferences has been studied in many…
Bounds of the accuracy of the normal approximation to the distribution of a sum of independent random variables are improved under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second.…
We study the extremal process associated with the Discrete Gaussian Free Field on the square lattice and elucidate how the conformal symmetries manifest themselves in the scaling limit. Specifically, we prove that the joint process of…
We show that the Mallows measure on permutations of $1,\ldots,n$ arises as the law of the unique Gale-Shapley stable matching of the random bipartite graph conditioned to be perfect, where preferences arise from a total ordering of the…
From each point of a Poisson point process start growing a balloon at rate 1. When two balloons touch, they pop and disappear. Is every point contained in balloons infinitely often or not? We answer this for the Euclidean space, the…
We study uncoordinated matching markets with additional local constraints that capture, e.g., restricted information, visibility, or externalities in markets. Each agent is a node in a fixed matching network and strives to be matched to…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
We study stable matchings that are robust to preference changes in the two-sided stable matching setting of Gale and Shapley[GS62]. Given two instances $A$ and $B$ on the same set of agents, a matching is said to be robust if it is stable…
The goal of Point Distance Solving Problems is to find 2D or 3D placements of points knowing distances between some pairs of points. The common guideline is to solve them by a numerical iterative method (\emph{e.g.} Newton-Raphson method).…
It is well-known that assumptions of monotonicity in size-bias couplings may be used to prove simple, yet powerful, Poisson approximation results. Here we show how these assumptions may be relaxed, establishing explicit Poisson…
We study stable matching problems with locality of information and control. In our model, each agent is a node in a fixed network and strives to be matched to another agent. An agent has a complete preference list over all other agents it…
A numerical scheme is described for accurately accommodating oblique, non-aligned, boundaries, on a three-dimensional cartesian grid. The scheme gives second-order accuracy in the solution for potential of Poisson's equation using compact…
We investigate stability of a solution of a hybrid system in the sense that the graphs of solutions from nearby initial conditions remain close and tend towards the graph of the given solution. In this manner, a small continuous-time…
Research regarding the stable marriage and roommate problem has a long and distinguished history in mathematics, computer science and economics. Stability in this context is predominantly core stability or one of its variants in which each…
We use Stein's method to establish the rates of normal approximation in terms of the total variation distance for a large class of sums of score functions of marked Poisson point processes on $\mathbb{R}^d$. As in the study under the weaker…