相关论文: Quantitative recurrence properties of expanding ma…
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…
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…
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…
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…
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…
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…
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…
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…
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\}$.
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…
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\…
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…
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…
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…
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…
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.…
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…
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…
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…
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…