# Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle

Abstract : Consider a set $S$ of points in the plane in convex position, where each point has an integer label from $\{0,1,\ldots,n-1\}$. This naturally induces a labeling of the edges: each edge $(i,j)$ is assigned label $i+j$, modulo $n$. We propose the algorithms for finding large non―crossing $\textit{harmonic}$ matchings or paths, i. e. the matchings or paths in which no two edges have the same label. When the point labels are chosen uniformly at random, and independently of each other, our matching algorithm with high probability (w.h.p.) delivers a nearly―perfect matching, a matching of size $n/2 - O(n^{1/3}\ln n)$.
Keywords :
Document type :
Conference papers
Domain :

Cited literature [7 references]

https://hal.inria.fr/hal-01184038
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Wednesday, August 12, 2015 - 3:52:20 PM
Last modification on : Tuesday, December 19, 2017 - 1:16:02 PM
Long-term archiving on: : Friday, November 13, 2015 - 11:40:38 AM

### File

Publisher files allowed on an open archive

### Citation

József Balogh, Boris Pittel, Gelasio Salazar. Near―perfect non-crossing harmonic matchings in randomly labeled points on a circle. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.17-26, ⟨10.46298/dmtcs.3366⟩. ⟨hal-01184038⟩

Record views