相关论文: Almost sure rates of mixing for random intermitten…

We study quenched mixing rates for two classes of random interval maps characterized by the presence of two indifferent fixed points and singular points. Using a random tower construction we prove the existence of an equivariant absolutely…

In this paper, we study the random dynamical system $f_\omega^n$ generated by a family of maps $\{f_{\omega_0}: \mathbb{S}^1 \to \mathbb{S}^1\}_{\omega_0 \in [-\varepsilon,\varepsilon]},$ $f_{\omega_0}(x) = \alpha \xi (x+\omega_0) +a\…

We consider non-uniformly expanding maps on compact Riemannian manifolds of arbitrary dimension, possibly having discontinuities and/or critical sets, and show that under some general conditions they admit an induced Markov tower structure…

We study random transformations built from intermittent maps on the unit interval that share a common neutral fixed point. We focus mainly on random selections of Pomeu-Manneville-type maps $T_\alpha$ using the full parameter range $0<…

In this paper we prove two results. First we show that dynamical systems with a $\phi$-mixing measure have in the limit Poisson distributed return times almost everywhere. We use the Chen-Stein method to also obtain rates of convergence.…

We consider an independently identically distributed random dynamical system generated by finitely many, non-uniformly expanding Markov interval maps with a finite number of branches. Assuming a topologically mixing condition and the…

We introduce a family of area preserving generalized baker's transformations acting on the unit square and having sharp polynomial rates of mixing for Holder data. The construction is geometric, relying on the graph of a single variable…

We consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an…

We obtain quenched almost sure invariance principle (with convergence rate) for Random Young Tower. We apply our result to i.i.d perturbations of non-uniformly expanding maps. In particular, we answer one open question in \cite{BBM}.

We prove that a class of one-dimensional maps with an arbitrary number of non-degenerate critical and singular points admits an induced Markov tower with exponential return time asymptotics. In particular the map has an absolutely…

Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…

We prove that, for any finite set of minimal $r$-graph patterns, there is a finite family $\mathcal F$ of forbidden $r$-graphs such that the extremal Tur\'an constructions for $\mathcal F$ are precisely the maximum $r$-graphs obtainable…

A class of examples is constructed to show that for strictly stationary Markov chains that are reversible, the simultaneous mixing rates for the $\rho$-mixing and strong mixing ($\alpha$-mixing) conditions can be fairly arbitrary, within…

This paper is about the rate of convergence of the Markov chain $X_{n+1}=AX_{n}+B_{n}$ (mod $p$), where $A$ is an integer matrix with nonzero eigenvalues and ${B_{n}}_{n}$ is a sequence of independent and identically distributed integer…

In this paper, we establish a coupling lemma for standard families in the setting of piecewise expanding interval maps with countably many branches. Our method merely requires that the expanding map satisfies Chernov's one-step expansion at…

In this paper we propose a model of random compositions of cylinder maps, which in the simplified form is as follows: $(\theta,r)\in \mathbb T\times \mathbb R=\mathbb A$ and \begin{eqnarray} \nonumber f_{\pm 1}:…

For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is…

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…

Two landmark results in combinatorial random matrix theory, due to Koml\'os and Costello-Tao-Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph…

We consider the time dependent probability distribution of a coarse grained observable Y whose evolution is governed by a discrete time map. If the map is mixing, the time dependent one-step transition probabilities converge in the long…