Related papers: On-off intermittency and chaotic walks
We study Markov chains on a lattice in a codimension-one stratified independent random environment, exploiting results established in [2]. First of all the random walk is transient in dimension at least three. Focusing on dimension two,…
The recurrence features of persistent random walks built from variable length Markov chains are investigated. We observe that these stochastic processes can be seen as L{\'e}vy walks for which the persistence times depend on some internal…
A switching random walk, commonly known under the misnomer `oscillating random walk', is a real-valued Markov chain whose distribution of increments is determined by the sign of the current position. We explicitly identify an invariant…
We report on structures in a scale-dependent Lyapunov exponent of an experimental chaotic map that arise due to discontinuities in the map. The chaos is realized in an autonomous Boolean network which is constructed using asynchronous logic…
This study examines the dynamical properties of the Ikeda map, with a focus on bifurcations and chaotic behavior. We investigate how variations in dissipation parameters influence the system, uncovering shrimp-shaped structures that…
Locally Markov walks are natural generalizations of classical Markov chains, where instead of a particle moving independently of the past, it decides where to move next depending on the last action performed at the current location. We…
The paper is concerned with asymptotic stability properties of linear switched systems. Under the hypothesis that all the subsystems share a non strict quadratic Lyapunov function, we provide a large class of switching signals for which a…
We compute the diffusion coefficient and the Lyapunov exponent for a diffusive intermittent map by means of cycle expansion of dynamical zeta functions. The asymptotic power law decay of the coefficients of the relevant power series are…
We propose a discrete time dynamical system (a map) as phenomenological model of excitable and spiking-bursting neurons. The model is a discontinuous two-dimensional map. We find condition under which this map has an invariant region on the…
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
We consider a class of doubly intermittent maps with critical points, unbounded derivative and regularly varying tails. Under some mild assumptions we prove the existence of a unique mixing absolutely continuous invariant measure and give…
Iterations of odd piecewise continuous maps with two discontinuities, i.e., symmetric discontinuous bimodal maps, are studied. Symbolic dynamics is introduced. The tools of kneading theory are used to study the homology of the discrete…
We introduce new machine-learning techniques for analyzing chaotic dynamical systems. The primary objectives of the study include the development of a new and simple method for calculating the Lyapunov exponent using only two trajectory…
The cutoff phenomenon describes a sharp transition in the convergence of a family of ergodic finite Markov chains to equilibrium. Many natural families of chains are believed to exhibit cutoff, and yet establishing this fact is often…
Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…
We review results on linearly edge-reinforced random walks. On finite graphs, the process has the same distribution as a mixture of reversible Markov chains. This has applications in Bayesian statistics and it has been used in studying the…
One dimensional intermittent maps with stretched exponential separation of nearby trajectories are considered. When time goes infinity the standard Lyapunov exponent is zero. We investigate the distribution of $\lambda_{\alpha}=…
We make a connection between the continuous time and lazy discrete time Markov chains through the comparison of cutoffs and mixing time in total variation distance. For illustration, we consider finite birth and death chains and provide a…
Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…
We present a recurrence-transience classification for discrete-time Markov chains on manifolds with negative curvature. Our classification depends only on geometric quantities associated to the increments of the chain, defined via the…