中文
相关论文

相关论文: Quantitative recurrence properties of expanding ma…

200 篇论文

In the setting of CAT(k) spaces, common fixed point iterations built from prox mappings (e.g. prox-prox, Krasnoselsky-Mann relaxations, nonlinear projected-gradients) converge locally linearly under the assumption of linear metric…

最优化与控制 · 数学 2021-12-13 Florian Lauster , D. Russell Luke

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

社会与信息网络 · 计算机科学 2015-02-10 Vladan Mlinar

This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…

数学物理 · 物理学 2014-12-15 B. Eynard

For a natural number $N\geq 2$ and a real $\alpha$ such that $0 < \alpha \leq \sqrt{N}-1$, we define $I_\alpha:=[\alpha,\alpha+1]$ and $I_\alpha^-:=[\alpha,\alpha+1)$ and investigate the continued fraction map $T_\alpha:I_\alpha \to…

数论 · 数学 2021-07-15 J. de Jonge , C. Kraaikamp , H. Nakada

Continual learning systems operating in fixed-dimensional spaces face a fundamental geometric barrier: the flat manifold problem. When experience is represented as a linear trajectory in Euclidean space, the geodesic distance between…

机器学习 · 计算机科学 2025-12-23 Xin Li

A simple sparse coding mechanism appears in the sensory systems of several organisms: to a coarse approximation, an input $x \in \R^d$ is mapped to much higher dimension $m \gg d$ by a random linear transformation, and is then sparsified by…

神经与进化计算 · 计算机科学 2020-06-09 Sanjoy Dasgupta , Christopher Tosh

In this paper we study the polynomial entropy of homeomorphism on compact metric space. We construct a homeomorphism on a compact metric space with vanishing polynomial entropy that it is not equicontinuous. Also we give examples with…

动力系统 · 数学 2018-01-29 Alfonso Artigue , Dante Carrasco-Olivera , Ignacio Monteverde

We study the functorial and growth properties of closed orbits for maps. By viewing an arbitrary sequence as the orbit-counting function for a map, iterates and Cartesian products of maps define new transformations between integer…

数论 · 数学 2009-09-22 Apisit Pakapongpun , Thomas Ward

Using experimental techniques, we study properties of the "circumcenter map", which, upon $n$ iterations sends an $n$-gon to a scaled and rotated copy of itself. We also explore the topology of area-expanding and area-contracting regions…

动力系统 · 数学 2022-05-17 Nicholas McDonald , Ronaldo Garcia , Dan Reznik

We study Poincar\'e recurrence for flows and observations of flows. For Anosov flow, we prove that the recurrence rates are linked to the local dimension of the invariant measure. More generally, we give for the recurrence rates for the…

动力系统 · 数学 2011-01-28 Jérôme Rousseau

We attach a ring of sequences to each number from a certain class of extremal real numbers, and we study the properties of this ring both from an analytic point of view by exhibiting elements with specific behaviors, and also from an…

数论 · 数学 2013-01-07 Damien Roy , Eric Villani

Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…

计算几何 · 计算机科学 2024-02-20 Bernd Gärtner , Fatime Rasiti , Patrick Schnider

A long-standing question is what invariant sets can be shared by two maps acting on the same space. A similar question stands for invariant measures. A particular interesting case are expanding Markov maps of the circle. If the two involved…

动力系统 · 数学 2021-11-04 Georgios Lamprinakis

In this paper we consider the problem of encoding data into \textit{repeat-free} sequences in which sequences are imposed to contain any $k$-tuple at most once (for predefined $k$). First, the capacity of the repeat-free constraint are…

信息论 · 计算机科学 2021-06-22 Ohad Elishco , Ryan Gabrys , Eitan Yaakobi , Muriel Médard

We consider the problem of estimating the graph size, where one is given only local access to the graph. We formally define a query model in which one starts with a \emph{seed} node and is allowed to make queries about neighbours of nodes…

数据结构与算法 · 计算机科学 2017-02-15 Varun Kanade , Frederik Mallmann-Trenn , Victor Verdugo

We investigate covariance shrinkage for Hotelling's $T^2$ in the regime where the data dimension $p$ and the sample size $n$ grow in a fixed ratio -- without assuming that the population covariance matrix is spiked or well-conditioned. When…

统计理论 · 数学 2025-06-13 Benjamin D. Robinson , Van Latimer

We give a new $(1+\epsilon)$-approximation for sparsest cut problem on graphs where small sets expand significantly more than the sparsest cut (sets of size $n/r$ expand by a factor $\sqrt{\log n\log r}$ bigger, for some small $r$; this…

数据结构与算法 · 计算机科学 2013-04-12 Sanjeev Arora , Rong Ge , Ali Kemal Sinop

We formulate a multi-valued version of the Tietze-Urysohn extension theorem. Precisely, we prove that any upper semicontinuous multi-valued map with nonempty closed convex values defined on a closed subset (resp. closed perfectly normal…

一般拓扑 · 数学 2008-10-20 Youcef Askoura

We prove the existence of the local limit of uniform random d-regular bipartite planar maps, for every $d\geq 3$, as the number of vertices tends to infinity. The proof relies on a bijection between maps and so-called blossoming trees…

概率论 · 数学 2026-04-28 Nicolas Tokka

We study the dependence of the topological entropy of piecewise monotonic maps with holes under perturbations, for example sliding a hole of fixed size at uniform speed or expanding a hole with uniform expansion. We show that under suitable…

动力系统 · 数学 2016-09-30 Oscar F. Bandtlow , Hans Henrik Rugh