Related papers: Mixing for some non-uniformly hyperbolic systems
We give exact formulae for a wide family of complexity measures that capture the organization of hidden nonlinear processes. The spectral decomposition of operator-valued functions leads to closed-form expressions involving the full…
We analyze the connections between the non-Markovianity degree of the most general phase-damping qubit maps and their legitimate mixtures. Using the results for image non-increasing dynamical maps, we formulate the necessary and sufficient…
We investigate the convergence in distribution of sequential empirical processes of dependent data indexed by a class of functions F. Our technique is suitable for processes that satisfy a multiple mixing condition on a space of functions…
The paper is devoted to hyperbolic (generally speaking, non-Lagrangian and nonlinear) partial differential systems possessing a full set of differential operators that map any function of one independent variable into a symmetry of the…
We prove the one-dimensional almost sure invariance principle with essentially optimal rates for slowly (polynomially) mixing deterministic dynamical systems, such as Pomeau-Manneville intermittent maps, with H\"older continuous…
In 1970, Donald Ornstein proved a landmark result in dynamical systems, viz., two Bernoulli systems with the same entropy are isomorphic except for a measure 0 set. Keane and Smorodinsky gave a finitary proof of this result. They also…
The Law of the Iterated Logarithm for some Markov operators, which converge exponentially to the invariant measure, is established. The operators correspond to iterated function systems which, for example, may be used to generalize the cell…
We obtain large and moderate deviation estimates, as well as concentration inequalities, for a class of nonuniformly expanding maps with stretched exponential decay of correlations. In the large deviation regime, we also exhibit examples…
We study global-local mixing for a family of accessible skew products with an exponentially mixing base and non-compact fibers, preserving an infinite measure. For a dense set of almost periodic global observables, we prove rapid mixing;…
Up to now, the nonparametric analysis of multidimensional continuous-time Markov processes has focussed strongly on specific model choices, mostly related to symmetry of the semigroup. While this approach allows to study the performance of…
We prove a multifractal formalism for Birkhoff averages of continuous functions in the case of some non-uniformly hyperbolic maps, which includes interval examples such as the Manneville--Pomeau map.
New sampling algorithms based on simulating continuous-time stochastic processes called piece-wise deterministic Markov processes (PDMPs) have shown considerable promise. However, these methods can struggle to sample from multi-modal or…
It was recently proposed in https://journals.aps.org/pre/abstract/10.1103/PhysRevE.94.043322 [Herdeiro & Doyon Phys.,Rev.,E (2016)] a numerical method showing a precise sampling of the infinite plane 2d critical Ising model for finite…
In this paper, we seek to understand the behavior of dynamical systems that are perturbed by a parameter that changes discretely in time. If we impose certain conditions, we can study certain embedded systems within a hybrid system as…
A statistical inference method is developed and tested for pairwise interacting systems whose degrees of freedom are continuous angular variables, such as planar spins in magnetic systems or wave phases in optics and acoustics. We…
De-interleaving of the mixtures of Hidden Markov Processes (HMPs) generally depends on its representation model. Existing representation models consider Markov chain mixtures rather than hidden Markov, resulting in the lack of robustness to…
We introduce the notion of metric entropy for a nonautonomous dynamical system given by a sequence of probability spaces and a sequence of measure-preserving maps between these spaces. This notion generalizes the classical concept of metric…
Lifted Markov chains are Markov chains on graphs with added local "memory" and can be used to mix towards a target distribution faster than their memoryless counterparts. Upper and lower bounds on the achievable performance have been…
It has previously been hypothesized, and supported with some experimental evidence, that deeper representations, when well trained, tend to do a better job at disentangling the underlying factors of variation. We study the following related…
Intermittent maps of the interval are simple and widely-studied models for chaos with slow mixing rates, but have been notoriously resistant to numerical study. In this paper we present an effective framework to compute many ergodic…