Related papers: On-off intermittency and chaotic walks
We study a partially hyperbolic and topologically transitive local diffeomorphism $F$ that is a skew-product over a horseshoe map. This system is derived from a homoclinic class and contains infinitely many hyperbolic periodic points of…
Let $\Gamma$ be a graph and $P$ be a reversible random walk on $\Gamma$. From the $L^2$ analyticity of the Markov operator $P$, we deduce that an iterate of odd exponent of $P$ is `lazy', that is there exists an integer $k$ such that the…
Markov processes with stochastic resetting towards the origin generically converge towards non-equilibrium steady-states. Long dynamical trajectories can be thus analyzed via the large deviations at Level 2.5 for the joint probability of…
We consider random walks in dynamic random environments given by Markovian dynamics on $\mathbb{Z}^d$. We assume that the environment has a stationary distribution $\mu$ and satisfies the Poincar\'e inequality w.r.t. $\mu$. The random walk…
A random phase property establishing a link between quasi-one-dimensional random Schroedinger operators and full random matrix theory is advocated. Briefly summarized it states that the random transfer matrices placed into a normal system…
It has been shown classically that combining two chaotic random walks can yield an ordered(periodic) walk. Our aim in this paper is to find a quantum analog for this rather counter-intuitive result. We study chaotic and periodic nature of…
Conditions for the emergence of a statistical relationship between $T_r$, the chaotic transport (recurrence) time, and $T_L$, the local Lyapunov time (the inverse of the numerically measured largest Lyapunov characteristic exponent), are…
We address stability of a class of Markovian discrete-time stochastic hybrid systems. This class of systems is characterized by the state-space of the system being partitioned into a safe or target set and its exterior, and the dynamics of…
We extend in several ways a recently proposed method to construct one-dimensional chaotic maps with exactly known natural invariant measure [Sogo 1999, 2009]. First, we assume that the given invariant measure depends on a continuous…
We investigate the high dimensional Hamiltonian chaotic dynamics in $N$ coupled area-preserving maps. We show the existence of an enhanced trapping regime caused by trajectories performing a random walk {\em inside} the area corresponding…
We find that a symbolic walk (performed by a walker with memory given by a Bernoulli shift) is able to distinguish between the random or chaotic topology of a given network. We show this result by means of studying the undirected baker…
A new method based on the phenomenon of synchronization and the properties of chaos is proposed to reduce interference in the transferred chaotic signals of synchronized systems. In this paper, the interference is considered as a series of…
We consider dynamical systems given by interval maps with a finite number of turning points (including critical points, discontinuities) possibly of different critical orders from two sides. If such a map $f$ is continuous and piecewise…
We consider an additive functional driven by a time-inhomogeneous Markov chain with a finite state space. Our study focuses on the joint distribution of the two-sided exit time and the state of the driving Markov chain at the time of exit,…
We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
For a Markov chain $Y$ with values in a Polish space, consider the entrance chain, obtained by sampling $Y$ at the moments when it enters a fixed set $A$ from its complement $A^c$. Similarly, consider the exit chain, obtained by sampling…
This paper concerns the long-term behaviour of a system of interacting random walks labeled by vertices of a finite graph. The model is reversible which allows to use the method of electric networks in the study. In addition, examples of…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.