Consider a process in which information is transmitted from a given root node on a noisy tree network T. We start with an unbiased random bit R at the root of the tree and send it down the edges of T. On every edge the bit can be reversed with probability ε, and these errors occur independently. The goal is to reconstruct R from the values which arrive at the nth level of the tree. This model has been studied in information theory, genetics and statistical mechanics. We bound the reconstruction probability from above, using the maximum flow on T viewed as a capacitated network, and from below using the electrical conductance of T. For general infinite trees, we establish a sharp threshold: the probability of correct reconstruction tends to 1/2 as n → ∞ if 1 − 2ε 2 < p c T , but the reconstruction probability stays bounded away from 1/2 if the opposite inequality holds. Here p c T is the critical probability for percolation on T; in particular p c T = 1/b for the b + 1-regular tree. The asymptotic reconstruction problem is equivalent to purity of the "free boundary" Gibbs state for the Ising model on a tree. The special case of regular trees was solved in 1995 by Bleher, Ruiz and Zagrebnov; our extension to general trees depends on a coupling argument and on a reconstruction algorithm that weights the input bits by the electrical current flow from the root to the leaves.
We present a fairly general method for nding deterministic constructions obeying what we call krestrictions; this yields structures of size not much larger than the probabilistic bound. The structures constructed by our method include (n; k)-universal sets (a collection of binary vectors of length n such that for any subset of size k of the indices, all 2 k con gurations appear) and families of perfect hash functions. The near-optimal constructions of these objects imply the very e cient derandomization of algorithms in learning, of xed-subgraph nding algorithms, and of near optimal threshold formulae. In addition, they derandomize the reduction showing the hardness of approximation of set cover. They also yield deterministic constructions for a local-coloring protocol, and for exhaustive testing of circuits.
We investigate variants of Lloyd's heuristic for clustering high dimensional data in an attempt to explain its popularity (a half century after its introduction) among practitioners, and in order to suggest improvements in its application. We propose and justify a clusterability criterion for data sets. We present variants of Lloyd's heuristic that quickly lead to provably near-optimal clustering solutions when applied to well-clusterable instances. This is the first performance guarantee for a variant of Lloyd's heuristic. The provision of a guarantee on output quality does not come at the expense of speed: some of our algorithms are candidates for being faster in practice than currently used variants of Lloyd's method. In addition, our other algorithms are faster on well-clusterable instances than recently proposed approximation algorithms, while maintaining similar guarantees on clustering quality. Our main algorithmic contribution is a novel probabilistic seeding process for the starting configuration of a Lloyd-type iteration.
Abstract-We present simple, polynomial-time encodable and decodable codes which are asymptotically good for channels allowing insertions, deletions, and transpositions. As a corollary, they achieve exponential error probability in a stochastic model of insertion-deletion.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.