English
Related papers

Related papers: Quantitative recurrence properties of expanding ma…

200 papers

Let $K$ be a homogeneous self-similar set satisfying the strong separation condition. This paper is concerned with the quantitative recurrence properties of the natural map $T: K\rightarrow K$ induced by the shift. Let $\mu$ be the natural…

Dynamical Systems · Mathematics 2018-02-01 Yuanyang Chang , Min Wu , Wen Wu

Let A(n) be a sequence of i.i.d. topical (i.e. isotone and additively homogeneous) operators. Let $x(n,x_0)$ be defined by $x(0,x_0)=x_0$ and $x(n,x_0)=A(n)x(n-1,x_0)$. This can modelize a wide range of systems including, task graphs, train…

Probability · Mathematics 2007-05-23 Glenn Merlet

The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate…

Probability · Mathematics 2012-11-30 Christian Houdré , Zsolt Talata

The main objects under consideration in this thesis are called maps, a certain class of graphs embedded on surfaces. Our problems have a powerful relatively recent tool in common, the so-called topological recursion (TR) introduced by…

Mathematical Physics · Physics 2020-02-04 Elba Garcia-Failde

We consider a sequence of complex rational maps (f_n) of a fixed degree d at least 2. Building on the seminal work of Kiwi, we introduce the notion of generalized rescaling limits. These are rational maps possibly defined over a…

Dynamical Systems · Mathematics 2026-05-12 Charles Favre , Chen Gong

This paper discusses possible approaches to the escape rate in infinite lattices of weakly coupled maps with uniformly expanding repeller. It is proved that computed-via-volume rates of spatially periodic approximations grow linearly with…

Dynamical Systems · Mathematics 2010-07-26 Jean-Baptiste Bardet , Bastien Fernandez

This paper is a first step in the study of the recurrence behavior in random dynamical systems and randomly perturbed dynamical systems. In particular we define a concept of quenched and annealed return times for systems generated by the…

Dynamical Systems · Mathematics 2009-10-12 Philippe Marie , Jerome Rousseau

We consider the period-doubling and intermittency transitions in iterated nonlinear one-dimensional maps to corroborate unambiguously the validity of Tsallis' non-extensive statistics at these critical points. We study the map…

Statistical Mechanics · Physics 2013-08-29 A. Robledo

We establish the upper bound on the speed of convergence to the infinitely divisible limit density in the local limit theorem for triangular arrays of random variables $\{X_{k,n},\, k=1,..,a_n, \, n\in \nat\}$.

Probability · Mathematics 2013-04-04 V. Knopova

We study the properties of a sequence cn defined by the recursive relation \[\frac{c_0}{n + 1}+\frac{c_1}{n + 2}+\ldots+\frac{c_n}{2n + 1}=0\] for $n>1$ and $c_0=1$. This sequence also has an alternative definition in terms of certain norm…

Number Theory · Mathematics 2019-01-15 Alexander Kalmynin , Petr Kosenko

Suppose that $\mathcal{X}$ is a sequentially complete Hausdorff locally convex space over a scalar field $\mathbb{K}$, $V$ is a bounded subset of $\mathcal{X}$, $(a_n)_{n\ge 0}$ is a sequence in $\mathbb{K}\setminus\{0\}$ with the property\…

Functional Analysis · Mathematics 2012-03-22 Mohammad Sal Moslehian , Dorian Popa

We study random circle maps that are expanding on the average. Uniform bounds on neither expansion nor distortion are required. We construct a coupling scheme, which leads to exponential convergence of measures (memory loss) and exponential…

Dynamical Systems · Mathematics 2013-06-14 Mikko Stenlund , Henri Sulku

We study eigenfunction localization for higher dimensional cat maps, a popular model of quantum chaos. These maps are given by linear symplectic maps in ${\mathrm{Sp}}(2g,\mathbb Z)$, which we take to be ergodic. Under some natural…

Dynamical Systems · Mathematics 2025-09-03 Pär Kurlberg , Alina Ostafe , Zeev Rudnick , Igor E. Shparlinski

We study the size of connected components of random nearest-neighbor graphs with vertex set the points of a homogeneous Poisson point process in ${\mathbb{R}}^d$. The connectivity function is shown to decay superexponentially, and we…

Probability · Mathematics 2007-05-23 Iva Kozakova , Ronald Meester , Seema Nanda

We prove a conjecture of Calta, Kraaikamp and the author: For all $n\ge 3$, each member of their one-parameter family of interval maps, denoted $T_{3,n,\alpha}$, has its `first expansive return map' of natural extension given by the first…

Dynamical Systems · Mathematics 2025-11-18 Thomas A. Schmidt

We investigate a generalisation of the logistic map as $ x_{n+1}=1-ax_{n}\otimes_{q_{map}} x_{n}$ ($-1 \le x_{n} \le 1$, $0<a\le2$) where $\otimes_q$ stands for a generalisation of the ordinary product, known as $q$-product [Borges, E.P.…

Chaotic Dynamics · Physics 2011-12-20 Robson W. S. Pessoa , Ernesto P. Borges

Maximal repetition of a string is the maximal length of a repeated substring. This paper investigates maximal repetition of strings drawn from stochastic processes. Strengthening previous results, two new bounds for the almost sure growth…

Information Theory · Computer Science 2020-03-11 Łukasz Dębowski

In this paper we use the Recursion Theorem to show the existence of various infinite sequences and sets. Our main result is that there is an increasing sequence e_0, e_1, e_2 .. such that W_{e_n}={e_{n+1}} for every n. Similarly, we prove…

Logic · Mathematics 2008-01-15 Arnold W. Miller

The evolution of an isolated quantum system inevitably exhibits recurrence: the state returns to the vicinity of its initial condition after finite time. Despite its fundamental nature, a rigorous quantitative understanding of recurrence…

Quantum Physics · Physics 2026-01-21 Marcin Kotowski , Michał Oszmaniec

We describe an algorithm that takes as input a complex sequence $(u_n)$ given by a linear recurrence relation with polynomial coefficients along with initial values, and outputs a simple explicit upper bound $(v_n)$ such that $|u_n| \leq…

Symbolic Computation · Computer Science 2013-06-19 Marc Mezzarobba , Bruno Salvy
‹ Prev 1 3 4 5 6 7 10 Next ›