15 research outputs found
Level-dependent interpolatory Hermite subdivision schemes and wavelets
We study many properties of level-dependent Hermite subdivision, focusing on
schemes preserving polynomial and exponential data. We specifically consider
interpolatory schemes, which give rise to level-dependent multiresolution
analyses through a prediction-correction approach. A result on the decay of the
associated multiwavelet coefficients, corresponding to a uniformly continuous
and differentiable function, is derived. It makes use of the approximation of
any such function with a generalized Taylor formula expressed in terms of
polynomials and exponentials
Manifold learning in Wasserstein space
This paper aims at building the theoretical foundations for manifold learning
algorithms in the space of absolutely continuous probability measures on a
compact and convex subset of , metrized with the Wasserstein-2
distance . We begin by introducing a natural construction of submanifolds
of probability measures equipped with metric , the
geodesic restriction of to . In contrast to other constructions,
these submanifolds are not necessarily flat, but still allow for local
linearizations in a similar fashion to Riemannian submanifolds of
. We then show how the latent manifold structure of
can be learned from samples of
and pairwise extrinsic Wasserstein distances only. In particular,
we show that the metric space can be asymptotically
recovered in the sense of Gromov--Wasserstein from a graph with nodes
and edge weights . In addition,
we demonstrate how the tangent space at a sample can be
asymptotically recovered via spectral analysis of a suitable "covariance
operator" using optimal transport maps from to sufficiently close and
diverse samples . The paper closes with some explicit
constructions of submanifolds and numerical examples on the recovery
of tangent spaces through spectral analysis
Linearized Wasserstein dimensionality reduction with approximation guarantees
We introduce LOT Wassmap, a computationally feasible algorithm to uncover
low-dimensional structures in the Wasserstein space. The algorithm is motivated
by the observation that many datasets are naturally interpreted as probability
measures rather than points in , and that finding low-dimensional
descriptions of such datasets requires manifold learning algorithms in the
Wasserstein space. Most available algorithms are based on computing the
pairwise Wasserstein distance matrix, which can be computationally challenging
for large datasets in high dimensions. Our algorithm leverages approximation
schemes such as Sinkhorn distances and linearized optimal transport to speed-up
computations, and in particular, avoids computing a pairwise distance matrix.
We provide guarantees on the embedding quality under such approximations,
including when explicit descriptions of the probability measures are not
available and one must deal with finite samples instead. Experiments
demonstrate that LOT Wassmap attains correct embeddings and that the quality
improves with increased sample size. We also show how LOT Wassmap significantly
reduces the computational cost when compared to algorithms that depend on
pairwise distance computations.Comment: 38 pages, 10 figures. Submitte
Long-term p21 and p53 trends regulate the frequency of mitosis events and cell cycle arrest
Radiation exposure of healthy cells can halt cell cycle temporarily or permanently. In this work, two single cell datasets that monitored the time evolution of p21 and p53, one subjected to gamma irradiation and the other to x-ray irradiation, are analyzed to uncover the dynamics of this process. New insights into the biological mechanisms were found by decomposing the p53 and p21 signals into transient and oscillatory components. Through the use of dynamic time warping on the oscillatory components of the two signals, we found that p21 signaling lags behind its lead signal, p53, by about 3.5 hours with oscillation periods of around 6 hours. Additionally, through various quantification methods, we showed how p21 levels, and to a lesser extent p53 levels, dictate whether the cells are arrested in their cell cycle and how fast these cells divide depending on their long-term trend in these signals
Periodicity Scoring of Time Series Encodes Dynamical Behavior of the Tumor Suppressor p53
In this paper we analyze the dynamical behavior of the tumor suppressor protein p53, an essential player in the cellular stress response, which prevents a cell from dividing if severe DNA damage is present. When this response system is malfunctioning, e.g. due to mutations in p53, uncontrolled cell proliferation may lead to the development of cancer. Understanding the behavior of p53 is thus crucial to prevent its failing. It has been shown in various experiments that periodicity of the p53 signal is one of the main descriptors of its dynamics, and that its pulsing behavior (regular vs. spontaneous) indicates the level and type of cellular stress. In the present work, we introduce an algorithm to score the local periodicity of a given time series (such as the p53 signal), which we call Detrended Autocorrelation Periodicity Scoring (DAPS). It applies pitch detection (via autocorrelation) on sliding windows of the entire time series to describe the overall periodicity by a distribution of localized pitch scores. We apply DAPS to the p53 time series obtained from single cell experiments and establish a correlation between the periodicity scoring of a cell’s p53 signal and the number of cell division events. In particular, we show that high periodicity scoring of p53 is correlated to a low number of cell divisions and vice versa. We show similar results with a more computationally intensive state-of-the-art periodicity scoring algorithm based on topology known as Sw1PerS. This correlation has two major implications: It demonstrates that periodicity scoring of the p53 signal is a good descriptor for cellular stress, and it connects the high variability of p53 periodicity observed in cell populations to the variability in the number of cell division events