Related papers: A Note on the Polynomial Ergodicity of the One-Dim…
The zigzag process is a Piecewise Deterministic Markov Process which can be used in a MCMC framework to sample from a given target distribution. We prove the convergence of this process to its target under very weak assumptions, and…
Ergodicity is a fundamental issue for a stochastic process. In this paper, we refine results on ergodicity for a general type of Markov chain to a specific type or the $GI/G/1$-type Markov chain, which has many interesting and important…
We examine the convergence of ergodic averages along polynomials in Toeplitz systems and prove that it is possible for averages along one polynomial to converge, and along another to diverge. We also study density of the polynomial orbits…
For affine processes on finite-dimensional cones, we give criteria for geometric ergodicity - that is exponentially fast convergence to a unique stationary distribution. Ergodic results include both the existence of exponential moments of…
Exploiting the recent work of Tao and Ziegler on a concatenation theorem on factors, we find explicit characteristic factors for multiple averages along polynomials on systems with commuting transformations, and use them to study criteria…
We study one-head machines through symbolic and topological dynamics. In particular, a subshift is associated to the subshift, and we are interested in its complexity in terms of realtime recognition. We emphasize the class of one-head…
The use of higher-order stochastic processes such as nonlinear Markov chains or vertex-reinforced random walks is significantly growing in recent years as they are much better at modeling high dimensional data and nonlinear dynamics in…
Novel Monte Carlo methods to generate samples from a target distribution, such as a posterior from a Bayesian analysis, have rapidly expanded in the past decade. Algorithms based on Piecewise Deterministic Markov Processes (PDMPs),…
We obtain explicit criteria for both exponential ergodicity and strong ergodicity for one-dimensional time-changed symmetric stable processes with $\alpha\in(1,2)$. Explicit lower bounds for ergodic convergence rates are given.
We prove that mixing on rank-one transformations is equivalent to the spacer sequence being slice-ergodic. Slice-ergodicity, introduced in this paper, generalizes the notion of ergodic sequence to the uniform convergence of ergodic averages…
We provide necessary and sufficient conditions for joint ergodicity results for systems of commuting measure preserving transformations for an iterated Hardy field function of polynomial growth. Our method builds on and improves recent…
The main goal of the paper is to prove convergence in norm and pointwise almost everywhere on $L^p$, $p\in (1,\infty)$, for certain multiparameter polynomial ergodic averages in the spirit of Dunford and Zygmund for continuous flows. We…
In this paper, we investigate the ergodicity in total variation of the process $X_t$ related to some integro-differential operator with unbounded coefficients and describe the speed of convergence to the respective invariant measure. Some…
The joint ergodicity classification problem aims to characterize those sequences which are jointly ergodic along an arbitrary dynamical system if and only if they satisfy two natural, simpler-to-verify conditions on this system. These two…
We study the ergodic theory of stationary directed nearest-neighbor polymer models on $\mathbb Z^2$, with i.i.d. weights. Such models are equivalent to specifying a stationary distribution on the space of weights and correctors that satisfy…
We obtain the lower bounds for ergodic convergence rates, including spectral gaps and convergence rates in strong ergodicity for time-changed symmetric L\'{e}vy processes by using harmonic function and reversible measure. As direct…
We examine multiple ergodic averages of commuting transformations with polynomial iterates in which the polynomials may be pairwise dependent. In particular, we show that such averages are controlled by the Gowers-Host-Kra seminorms…
We strengthen the maximal ergodic theorem for actions of groups of polynomial growth to a form involving jump quantity, which is the sharpest result among the family of variational or maximal ergodic theorems. As a consequence, we deduce in…
A problem based on the Extended Euclidean Algorithm applied to a class of polynomials with many factors is presented and believed to be hard. If so, it is a one-way function well suited for applications in digital signicatures.
NVIDIA researchers have pioneered an explicit method, position-based dynamics (PBD), for simulating systems with contact forces, gaining widespread use in computer graphics and animation. While the method yields visually compelling…