
Improved Approximate Rips Filtrations with Shifted Integer Lattices
Rips complexes are important structures for analyzing topological featur...
read it

Improved Topological Approximations by Digitization
Čech complexes are useful simplicial complexes for computing and analyzi...
read it

Separating the Communication Complexity of Truthful and NonTruthful Combinatorial Auctions
We provide the first separation in the approximation guarantee achievabl...
read it

Krivine diffusions attain the GoemansWilliamson approximation ratio
Answering a question of AbbasiZadeh, Bansal, Guruganesh, Nikolov, Schwa...
read it

Adaptive Metrics for Adaptive Samples
In this paper we consider adaptive sampling's localfeature size, used i...
read it

Approximating Operator Norms via Generalized Krivine Rounding
We consider the (ℓ_p,ℓ_r)Grothendieck problem, which seeks to maximize ...
read it
Improved Approximate Rips Filtrations with Shifted Integer Lattices and Cubical Complexes
Rips complexes are important structures for analyzing topological features of metric spaces. Unfortunately, generating these complexes is expensive because of a combinatorial explosion in the complex size. For n points in ℝ^d, we present a scheme to construct a 2approximation of the filtration of the Rips complex in the L_∞norm, which extends to a 2d^0.25approximation in the Euclidean case. The kskeleton of the resulting approximation has a total size of n2^O(dlog k +d). The scheme is based on the integer lattice and simplicial complexes based on the barycentric subdivision of the dcube. We extend our result to use cubical complexes in place of simplicial complexes by introducing cubical maps between complexes. We get the same approximation guarantee as the simplicial case, while reducing the total size of the approximation to only n2^O(d) (cubical) cells. There are two novel techniques that we use in this paper. The first is the use of acyclic carriers for proving our approximation result. In our application, these are maps which relate the Rips complex and the approximation in a relatively simple manner and greatly reduce the complexity of showing the approximation guarantee. The second technique is what we refer to as scale balancing, which is a simple trick to improve the approximation ratio under certain conditions.
READ FULL TEXT
Comments
There are no comments yet.