62,341 research outputs found
Random Metric Spaces and Universality
WWe define the notion of a random metric space and prove that with
probability one such a space is isometricto the Urysohn universal metric space.
The main technique is the study of universal and random distance matrices; we
relate the properties of metric (in particulary universal) space to the
properties of distance matrices. We show the link between those questions and
classification of the Polish spaces with measure (Gromov or metric triples) and
with the problem about S_{\infty}-invariant measures in the space of symmetric
matrices. One of the new effects -exsitence in Urysohn space so called
anarchical uniformly distributed sequences. We give examples of other
categories in which the randomness and universality coincide (graph, etc.).Comment: 38 PAGE
Complementary Lipschitz continuity results for the distribution of intersections or unions of independent random sets in finite discrete spaces
We prove that intersections and unions of independent random sets in finite
spaces achieve a form of Lipschitz continuity. More precisely, given the
distribution of a random set , the function mapping any random set
distribution to the distribution of its intersection (under independence
assumption) with is Lipschitz continuous with unit Lipschitz constant if
the space of random set distributions is endowed with a metric defined as the
norm distance between inclusion functionals also known as commonalities.
Moreover, the function mapping any random set distribution to the distribution
of its union (under independence assumption) with is Lipschitz continuous
with unit Lipschitz constant if the space of random set distributions is
endowed with a metric defined as the norm distance between hitting
functionals also known as plausibilities.
Using the epistemic random set interpretation of belief functions, we also
discuss the ability of these distances to yield conflict measures. All the
proofs in this paper are derived in the framework of Dempster-Shafer belief
functions. Let alone the discussion on conflict measures, it is straightforward
to transcribe the proofs into the general (non necessarily epistemic) random
set terminology
Polyhedral Combinatorics of UPGMA Cones
Distance-based methods such as UPGMA (Unweighted Pair Group Method with
Arithmetic Mean) continue to play a significant role in phylogenetic research.
We use polyhedral combinatorics to analyze the natural subdivision of the
positive orthant induced by classifying the input vectors according to tree
topologies returned by the algorithm. The partition lattice informs the study
of UPGMA trees. We give a closed form for the extreme rays of UPGMA cones on n
taxa, and compute the normalized volumes of the UPGMA cones for small n.
Keywords: phylogenetic trees, polyhedral combinatorics, partition lattic
Ptolemaic Indexing
This paper discusses a new family of bounds for use in similarity search,
related to those used in metric indexing, but based on Ptolemy's inequality,
rather than the metric axioms. Ptolemy's inequality holds for the well-known
Euclidean distance, but is also shown here to hold for quadratic form metrics
in general, with Mahalanobis distance as an important special case. The
inequality is examined empirically on both synthetic and real-world data sets
and is also found to hold approximately, with a very low degree of error, for
important distances such as the angular pseudometric and several Lp norms.
Indexing experiments demonstrate a highly increased filtering power compared to
existing, triangular methods. It is also shown that combining the Ptolemaic and
triangular filtering can lead to better results than using either approach on
its own
- …