Related papers: Dynamical and arithmetic degrees for random iterat…
We exhibit a family of dynamical systems arising from rational points on elliptic curves in an attempt to mimic the familiar toral automorphisms. At the non-archimedean primes, a continuous map is constructed on the local elliptic curve…
We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the…
The statistics of persistent events, recently introduced in the context of phase ordering dynamics, is investigated in the case of the 1D lattice random walk in discrete time. We determine the survival probability of the random walker in…
One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…
This contribution summarizes recent work of the authors that combines methods from dynamical systems theory (discrete Painlev\'e equations) and asymptotic analysis of orthogonal polynomial recurrences, to address long-standing questions in…
In this paper we study the rate of convergence of the iterates of \iid random piecewise constant monotone maps to the time-$1$ transport map for the process of coalescing Brownian motions. We prove that the rate of convergence is given by a…
Let K be an algebraic number field. For a degree d rational morphism of projective n-space defined over K let R denote its minimal resultant ideal. For a fixed height function on the moduli space of dynamical systems this paper shows that…
Random embeddings project high-dimensional spaces to low-dimensional ones; they are careful constructions which allow the approximate preservation of key properties, such as the pair-wise distances between points. Often in the field of…
We construct a family of birational maps acting on two dimensional projective varieties, for which the growth of the degrees of the iterates is cubic. It is known that this growth can be bounded, linear, quadratic or exponential for such…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
We introduce a general class of algorithms and supply a number of general results useful for analysing these algorithms when applied to regular graphs of large girth. As a result, we can transfer a number of results proved for random…
A particular case of a causal set is considered that is a directed dyadic acyclic graph. This is a model of a discrete pregeometry on a microscopic scale. The dynamics is a stochastic sequential growth of the graph. New vertexes of the…
We consider both discrete and continuous "uncertain horizon" deterministic control processes, for which the termination time is a random variable. We examine the dynamic programming equations for the value function of such processes,…
We define a dynamic model of random networks, where new vertices are connected to old ones with a probability proportional to a sublinear function of their degree. We first give a strong limit law for the empirical degree distribution, and…
In this article we present an efficient algorithm to compute rotation intervals of circle maps of degree one. It is based on the computation of the rotation number of a monotone circle map of degree one with a constant section. The main…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
We provide an explicit formula on the growth rate of ample heights of rational points under iteration of endomorphisms on smooth projective varieties over number fields. As an application, we give a positive answer to a problem of Dynamical…
We discuss rescaling limits for sequences of complex rational maps in one variable which approach infinity in parameter space.It is shown that any given sequence of maps of degree $d \ge 2$ has at most $2d-2$ dynamically distinct rescaling…
Let $k$ be a finite field extension of the function field $\bfF_p(T)$ and $\bar{k}$ its algebraic closure. We count points in projective space $\Bbb P ^{n-1}(\bar{k})$ with given height and of fixed degree $d$ over the field $k$. If…
We study the Dominating set problem and Independent Set Problem for dynamic graphs in the vertex-arrival model. We say that a dynamic algorithm for one of these problems is $k$-stable when it makes at most $k$ changes to its output…