Related papers: On-off intermittency and chaotic walks

We study synchronization of random one-dimensional linear maps for which the Lyapunov exponent can be calculated exactly. Certain aspects of the dynamics of these maps are explained using their relation with a random walk. We confirm that…

We study asymptotic stability of continuous-time systems with mode-dependent guaranteed dwell time. These systems are reformulated as special cases of a general class of mixed (discrete-continuous) linear switching systems on graphs, in…

We generate new hierarchy of many-parameter family of maps of the interval [0,1] with an invariant measure, by composition of the chaotic maps of reference [1]. Using the measure, we calculate Kolmogorov-Sinai entropy, or equivalently…

Skew product systems with monotone one-dimensional fibre maps driven by piecewise expanding Markov interval maps may show the phenomenon of intermingled basins. To quantify the degree of intermingledness the uncertainty exponent and the…

We give conditions under which near-critical stochastic processes on the half-line have infinitely many or finitely many cutpoints, generalizing existing results on nearest-neighbour random walks to adapted processes with bounded increments…

The critical relations for statistical properties on saddle-node bifurcations are shown to display undulating fine structure, in addition to their known smooth dependence on the control parameter. A piecewise linear map with the type-I…

We address the stability problem for linear switching systems with mode-dependent restrictions on the switching intervals. Their lengths can be bounded as from below (the guaranteed dwell-time) as from above. The upper bounds make this…

In cellular vortical flows, namely arrays of counter-rotating vortices, short but flexible filaments can show simple random walks through their stretch-coil interactions with flow stagnation points. Here, we study the dynamics of semi-rigid…

Different mechanisms for the creation of strange non-chaotic dynamics in the quasiperiodically forced logistic map are studied. These routes to strange nonchaos are characterised through the behavior of the largest nontrivial Lyapunov…

We consider a linear skew product with the full shift in the base and nonzero Lyapunov exponent in the fiber. We provide a sharp estimate for the precision of shadowing for a typical pseudotrajectory of finite length. This result indicates…

A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.

We consider perturbations of interval maps with indifferent fixed points, which we refer to as wobbly interval intermittent maps, for which stable laws for general H\"older observables fail. We obtain limit laws for such maps and H\"older…

The cutoff phenomenon describes a sharp transition in the convergence of an ergodic finite Markov chain to equilibrium. Of particular interest is understanding this convergence for the simple random walk on a bounded-degree expander graph.…

A sequence of Markov chains is said to exhibit (total variation) cutoff if the convergence to stationarity in total variation distance is abrupt. We consider reversible lazy chains. We prove a necessary and sufficient condition for the…

We develop a general geometric method to establish the existence of positive Lyapunov exponents for a class of skew products. The technique is applied to show non-uniform hyperbolicity of some conservative partially hyperbolic…

A network of $N$ elements is studied in terms of a deterministic globally coupled map which can be chaotic. There exists a range of values for the parameters of the map where the number of different macroscopic configurations is very large,…

We prove that for a random walk on the real line whose increments have zero mean and are either integer-valued or spread out (i.e. the distributions of the steps of the walk are eventually non-singular), the Markov chain of overshoots above…

A finite ergodic Markov chain is said to exhibit cutoff if its distance to stationarity remains close to 1 over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Discovered in the context of card…

We consider regular lattices of coupled chaotic maps. Depending on lattice size, there may exist a window in parameter space where complete synchronization is eventually attained after a transient regime. Close outside this window, an…

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…