3,841 research outputs found
Tropical Principal Component Analysis and its Application to Phylogenetics
Principal component analysis is a widely-used method for the dimensionality
reduction of a given data set in a high-dimensional Euclidean space. Here we
define and analyze two analogues of principal component analysis in the setting
of tropical geometry. In one approach, we study the Stiefel tropical linear
space of fixed dimension closest to the data points in the tropical projective
torus; in the other approach, we consider the tropical polytope with a fixed
number of vertices closest to the data points. We then give approximative
algorithms for both approaches and apply them to phylogenetics, testing the
methods on simulated phylogenetic data and on an empirical dataset of
Apicomplexa genomes.Comment: 28 page
Topology Discovery of Sparse Random Graphs With Few Participants
We consider the task of topology discovery of sparse random graphs using
end-to-end random measurements (e.g., delay) between a subset of nodes,
referred to as the participants. The rest of the nodes are hidden, and do not
provide any information for topology discovery. We consider topology discovery
under two routing models: (a) the participants exchange messages along the
shortest paths and obtain end-to-end measurements, and (b) additionally, the
participants exchange messages along the second shortest path. For scenario
(a), our proposed algorithm results in a sub-linear edit-distance guarantee
using a sub-linear number of uniformly selected participants. For scenario (b),
we obtain a much stronger result, and show that we can achieve consistent
reconstruction when a sub-linear number of uniformly selected nodes
participate. This implies that accurate discovery of sparse random graphs is
tractable using an extremely small number of participants. We finally obtain a
lower bound on the number of participants required by any algorithm to
reconstruct the original random graph up to a given edit distance. We also
demonstrate that while consistent discovery is tractable for sparse random
graphs using a small number of participants, in general, there are graphs which
cannot be discovered by any algorithm even with a significant number of
participants, and with the availability of end-to-end information along all the
paths between the participants.Comment: A shorter version appears in ACM SIGMETRICS 2011. This version is
scheduled to appear in J. on Random Structures and Algorithm
- …