55,648 research outputs found
Euclidean distance geometry and applications
Euclidean distance geometry is the study of Euclidean geometry based on the
concept of distance. This is useful in several applications where the input
data consists of an incomplete set of distances, and the output is a set of
points in Euclidean space that realizes the given distances. We survey some of
the theory of Euclidean distance geometry and some of the most important
applications: molecular conformation, localization of sensor networks and
statics.Comment: 64 pages, 21 figure
On the complexity of range searching among curves
Modern tracking technology has made the collection of large numbers of
densely sampled trajectories of moving objects widely available. We consider a
fundamental problem encountered when analysing such data: Given polygonal
curves in , preprocess into a data structure that answers
queries with a query curve and radius for the curves of that
have \Frechet distance at most to .
We initiate a comprehensive analysis of the space/query-time trade-off for
this data structuring problem. Our lower bounds imply that any data structure
in the pointer model model that achieves query time, where is
the output size, has to use roughly space in
the worst case, even if queries are mere points (for the discrete \Frechet
distance) or line segments (for the continuous \Frechet distance). More
importantly, we show that more complex queries and input curves lead to
additional logarithmic factors in the lower bound. Roughly speaking, the number
of logarithmic factors added is linear in the number of edges added to the
query and input curve complexity. This means that the space/query time
trade-off worsens by an exponential factor of input and query complexity. This
behaviour addresses an open question in the range searching literature: whether
it is possible to avoid the additional logarithmic factors in the space and
query time of a multilevel partition tree. We answer this question negatively.
On the positive side, we show we can build data structures for the \Frechet
distance by using semialgebraic range searching. Our solution for the discrete
\Frechet distance is in line with the lower bound, as the number of levels in
the data structure is , where denotes the maximal number of vertices
of a curve. For the continuous \Frechet distance, the number of levels
increases to
Local Equivalence and Intrinsic Metrics between Reeb Graphs
As graphical summaries for topological spaces and maps, Reeb graphs are
common objects in the computer graphics or topological data analysis
literature. Defining good metrics between these objects has become an important
question for applications, where it matters to quantify the extent by which two
given Reeb graphs differ. Recent contributions emphasize this aspect, proposing
novel distances such as {\em functional distortion} or {\em interleaving} that
are provably more discriminative than the so-called {\em bottleneck distance},
being true metrics whereas the latter is only a pseudo-metric. Their main
drawback compared to the bottleneck distance is to be comparatively hard (if at
all possible) to evaluate. Here we take the opposite view on the problem and
show that the bottleneck distance is in fact good enough {\em locally}, in the
sense that it is able to discriminate a Reeb graph from any other Reeb graph in
a small enough neighborhood, as efficiently as the other metrics do. This
suggests considering the {\em intrinsic metrics} induced by these distances,
which turn out to be all {\em globally} equivalent. This novel viewpoint on the
study of Reeb graphs has a potential impact on applications, where one may not
only be interested in discriminating between data but also in interpolating
between them
Recent progress on the notion of global hyperbolicity
Global hyperbolicity is a central concept in Mathematical Relativity. Here,
we review the different approaches to this concept explaining both, classical
approaches and recent results. The former includes Cauchy hypersurfaces, naked
singularities, and the space of the causal curves connecting two events. The
latter includes structural results on globally hyperbolic spacetimes, their
embeddability in Lorentz-Minkowski, and the recently revised notions of both,
causal and conformal boundaries. Moreover, two criteria for checking global
hyperbolicity are reviewed. The first one applies to general splitting
spacetimes. The second one characterizes accurately global hyperbolicity and
spacelike Cauchy hypersurfaces for standard stationary spacetimes, in terms of
a naturally associated Finsler metric.Comment: 18 pages, 1 figure. Extended and updated contribution to the meeting
"New Developments in Lorentzian Geometry" Berlin, Nov. 200
Visualization of AE's Training on Credit Card Transactions with Persistent Homology
Auto-encoders are among the most popular neural network architecture for
dimension reduction. They are composed of two parts: the encoder which maps the
model distribution to a latent manifold and the decoder which maps the latent
manifold to a reconstructed distribution. However, auto-encoders are known to
provoke chaotically scattered data distribution in the latent manifold
resulting in an incomplete reconstructed distribution. Current distance
measures fail to detect this problem because they are not able to acknowledge
the shape of the data manifolds, i.e. their topological features, and the scale
at which the manifolds should be analyzed. We propose Persistent Homology for
Wasserstein Auto-Encoders, called PHom-WAE, a new methodology to assess and
measure the data distribution of a generative model. PHom-WAE minimizes the
Wasserstein distance between the true distribution and the reconstructed
distribution and uses persistent homology, the study of the topological
features of a space at different spatial resolutions, to compare the nature of
the latent manifold and the reconstructed distribution. Our experiments
underline the potential of persistent homology for Wasserstein Auto-Encoders in
comparison to Variational Auto-Encoders, another type of generative model. The
experiments are conducted on a real-world data set particularly challenging for
traditional distance measures and auto-encoders. PHom-WAE is the first
methodology to propose a topological distance measure, the bottleneck distance,
for Wasserstein Auto-Encoders used to compare decoded samples of high quality
in the context of credit card transactions.Comment: arXiv admin note: substantial text overlap with arXiv:1905.0989
- …