SearcharxivSearch

arXiv · 2111.05842

Reply to Comment on "TVOR: Finding Discrete Total Variation Outliers among Histograms"

Abstract

In this paper, we respond to a critique of one of our papers previously published in this journal, entitled "TVOR: Finding Discrete Total Variation Outliers among Histograms". Our paper proposes a method for smoothness outliers detection among histograms by using the relation between their discrete total variations (DTV) and their respective sample sizes. In this response, we demonstrate point by point that, contrary to its claims, the critique has not found any mistakes or problems in our paper, either in the used datasets, methodology, or in the obtained top outlier candidates. On the contrary, the critique's claims can easily be shown to be mathematically unfounded, to directly contradict the common statistical theorems, and to go against well established demographic terms. Exactly this is done in the reply here by providing both theoretical and experimental evidence. Additionally, due to critique's complaint, a more extensive research on top outlier candidate, i.e. the Jasenovac list is conducted and in order to clear any of the critique's doubts, new evidence of its problematic nature unseen in other lists are presented. This reply is accompanied by additional theoretical explanations, simulations, and experimental results that not only confirm the earlier findings, but also present new data. The source code is at https://github.com/DiscreteTotalVariation/TVOR.

Explore related subjects

Keep this discovery

BibTeXRIS

Nikola Banić, Neven Elezović. 2021-11-10. Reply to Comment on "TVOR: Finding Discrete Total Variation Outliers among Histograms". https://arxiv.org/abs/2111.05842

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM