English
Related papers

Related papers: Embedding minimal dynamical systems into Hilbert c…

200 papers

We construct a minimal dynamical system of mean dimension equal to $1$, which can be embedded in the shift action on the Hilbert cube $[0,1]^\mathbb{Z}$. This clarifies a seemingly plausible impression about embedding possibility in…

Dynamical Systems · Mathematics 2024-02-19 Lei Jin , Yixiao Qiao

We study the problem of embedding arbitrary $\mathbb{Z}^k$-actions into the shift action on the infinite dimensional cube $\left([0,1]^D\right)^{\mathbb{Z}^k}$. We prove that if a $\mathbb{Z}^k$-action satisfies the marker property (in…

Dynamical Systems · Mathematics 2017-09-04 Yonatan Gutman , Yixiao Qiao , Masaki Tsukamoto

Waist inequality is a fundamental inequality in geometry and topology. We apply it to the study of entropy and mean dimension of dynamical systems. We consider equivariant continuous maps between dynamical systems and assume that the mean…

Dynamical Systems · Mathematics 2022-11-21 Ruxi Shi , Masaki Tsukamoto

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…

Data Structures and Algorithms · Computer Science 2016-03-15 Samet Oymak

According to a conjecture of Lindenstrauss and Tsukamoto, a topological system $(X,T)$ embeds in the $d$-dimensional cubical shift $(([0,1]^d)^\mathbb{Z},$shift) if its mean dimension and periodic dimension verify mdim$(X,T)<d/2$ and…

Dynamical Systems · Mathematics 2017-02-23 Fanny Amyot

Let (X,Z) be a minimal dynamical system on a compact metric X and k an integer such that mdim X< k. We show that (X,Z) admits an equivariant embedding in the shift (D^k)^Z where D is a superdendrite.

Dynamical Systems · Mathematics 2023-12-14 Michael Levin

Johnson-Lindenstrauss embeddings are widely used to reduce the dimension and thus the processing time of data. To reduce the total complexity, also fast algorithms for applying these embeddings are necessary. To date, such fast algorithms…

Data Structures and Algorithms · Computer Science 2020-04-30 Stefan Bamberger , Felix Krahmer

According to the celebrated Jaworski Theorem, a finite dimensional aperiodic dynamical system $(X,T)$ embeds in the $1$-dimensional cubical shift $([0,1]^{\mathbb{Z}},shift)$. If $X$ admits periodic points (still assuming $\dim(X)<\infty$)…

Dynamical Systems · Mathematics 2017-05-17 Yonatan Gutman

Mean dimension is a topological invariant for dynamical systems that is meaningful for systems with infinite dimension and infinite entropy. Given a $\mathbb{Z}^k$-action on a compact metric space $X$, we study the following three problems…

Dynamical Systems · Mathematics 2015-10-07 Yonatan Gutman , Elon Lindenstrauss , Masaki Tsukamoto

According to a conjecture of Lindenstrauss and Tsukamoto, a topological dynamical system $(X,T)$ is embeddable in the $d$-cubical shift $(([0,1]^{d})^{\mathbb{Z}},\ shift)$ if both its mean dimension and periodic dimension are strictly…

Dynamical Systems · Mathematics 2013-11-21 Yonatan Gutman

We present a novel kernel-based machine learning algorithm for identifying the low-dimensional geometry of the effective dynamics of high-dimensional multiscale stochastic systems. Recently, the authors developed a mathematical framework…

Dynamical Systems · Mathematics 2020-02-04 Andreas Bittracher , Stefan Klus , Boumediene Hamzi , Péter Koltai , Christof Schütte

In this paper we prove two theorems. The first one is a structure result that describes the extrinsic geometry of an embedded surface with constant mean curvature (possibly zero) in a homogeneously regular Riemannian three-manifold, in any…

Differential Geometry · Mathematics 2014-01-10 William H. Meeks , Joaquín Pérez , Antonio Ros

Kernel mean embeddings are a popular tool that consists in representing probability measures by their infinite-dimensional mean embeddings in a reproducing kernel Hilbert space. When the kernel is characteristic, mean embeddings can be used…

Machine Learning · Computer Science 2021-06-29 Boris Muzellec , Francis Bach , Alessandro Rudi

Binary embedding is a nonlinear dimension reduction methodology where high dimensional data are embedded into the Hamming cube while preserving the structure of the original space. Specifically, for an arbitrary $N$ distinct points in…

Data Structures and Algorithms · Computer Science 2019-01-24 Xinyang Yi , Constantine Caramanis , Eric Price

A method is proposed to improve the accuracy of approximate techniques for strongly correlated electrons that use reduced Hilbert spaces. As a first step, the method involves a change of basis that incorporates exactly part of the short…

Statistical Mechanics · Physics 2009-10-30 E. Dagotto , G. B. Martins , J. Riera , A. L. Malvezzi , C. Gazza

Goemans showed that any $n$ points $x_1, \dotsc x_n$ in $d$-dimensions satisfying $\ell_2^2$ triangle inequalities can be embedded into $\ell_{1}$, with worst-case distortion at most $\sqrt{d}$. We extend this to the case when the points…

Data Structures and Algorithms · Computer Science 2015-12-15 Amit Deshpande , Prahladh Harsha , Rakesh Venkat

We study embedding a subset $K$ of the unit sphere to the Hamming cube $\{-1,+1\}^m$. We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\omega(K)$ of the set. For subspaces and several…

Machine Learning · Computer Science 2015-12-15 Samet Oymak , Ben Recht

A dynamical system $(X,T)$ is \emph{shift embeddable} if $(X,T)$ embeds continuously and equivariantly in the shift over $[0,1]^d$ for some finite $d$. Refuting a major conjecture in the field, in a recent result of Dranishnikov and Levin…

Dynamical Systems · Mathematics 2026-05-07 Tom Meyerovitch

We devise a new embedding technique, which we call measured descent, based on decomposing a metric space locally, at varying speeds, according to the density of some probability measure. This provides a refined and unified framework for the…

Data Structures and Algorithms · Computer Science 2007-05-23 Robert Krauthgamer , James R. Lee , Manor Mendel , Assaf Naor

This work studies an explicit embedding of the set of probability measures into a Hilbert space, defined using optimal transport maps from a reference probability density. This embedding linearizes to some extent the 2-Wasserstein space,…

Machine Learning · Statistics 2022-05-05 Quentin Mérigot , Alex Delalande , Frédéric Chazal
‹ Prev 1 2 3 10 Next ›