Optimal Bounds for Noisy Sorting

02/24/2023
by   Yuzhou Gu, et al.
0

Sorting is a fundamental problem in computer science. In the classical setting, it is well-known that (1± o(1)) nlog_2 n comparisons are both necessary and sufficient to sort a list of n elements. In this paper, we study the Noisy Sorting problem, where each comparison result is flipped independently with probability p for some fixed p∈ (0, 1/2). As our main result, we show that (1± o(1)) ( 1/I(p) + 1/(1-2p) log_2 (1-p/p)) nlog_2 n noisy comparisons are both necessary and sufficient to sort n elements with error probability o(1) using noisy comparisons, where I(p)=1 + plog_2 p+(1-p)log_2 (1-p) is capacity of BSC channel with crossover probability p. This simultaneously improves the previous best lower and upper bounds (Wang, Ghaddar and Wang, ISIT 2022) for this problem. For the related Noisy Binary Search problem, we show that (1± o(1)) ((1-δ)log_2(n)/I(p) + 2 log_2 (1/δ)/(1-2p)log_2(1-p/p)) noisy comparisons are both necessary and sufficient to find the predecessor of an element among n sorted elements with error probability δ. This extends the previous bounds of (Burnashev and Zigangirov, 1974), which are only tight for δ = 1/n^o(1).

READ FULL TEXT
research
02/03/2022

Noisy Sorting Capacity

Sorting is the task of ordering n elements using pairwise comparisons. I...
research
06/11/2022

Lower Bounds for Sorting 16, 17, and 18 Elements

It is a long-standing open question to determine the minimum number of c...
research
03/12/2018

Sorting by Swaps with Noisy Comparisons

We study sorting of permutations by random swaps if each comparison give...
research
04/20/2018

Optimal Sorting with Persistent Comparison Errors

We consider the problem of sorting n elements in the case of persistent ...
research
09/07/2023

Noisy Computing of the 𝖮𝖱 and 𝖬𝖠𝖷 Functions

We consider the problem of computing a function of n variables using noi...
research
04/27/2020

Batched Predecessor and Sorting with Size-Priced Information in External Memory

In the unit-cost comparison model, a black box takes an input two items ...
research
03/15/2018

Pivot Sampling in QuickXSort: Precise Analysis of QuickMergesort and QuickHeapsort

QuickXSort is a strategy to combine Quicksort with another sorting metho...

Please sign up or login with your details

Forgot password? Click here to reset