Related papers: Hitting and return times in ergodic dynamical syst…
We define a random walk adic transformation associated to an aperiodic random walk on $G=\mathbb{Z}^{k}\times\mathbb{R}^{D-k}$ driven by a $\beta$-transformation and study its ergodic properties. In particular, this transformation is…
A topological dynamical system $(X,T)$ is called CF-Nil($k$) if it is strictly ergodic and the maximal measurable and maximal topological $k$-step pro-nilfactors coincide as measure preserving systems. Through constructing specific…
Brownian yet non-Gaussian diffusion has recently been observed in numerous biological and active matter system. The cause of the non-Gaussian distribution have been elaborately studied in the idea of a superstatistical dynamics or a…
Let $X$ be a measure space and $T:X\to X$ a measurable transformation. For any measurable $E\subseteq X$ and $x\in E$, the possibly infinite return time is $n_E(x):=\inf\{n>0: T^n x\in E\}$. If $T$ is an ergodic tranformation of the…
Let B be a Brownian motion and T its first hitting time of the level 1. For U a uniform random variable independent of B, we study in depth the distribution of T^{-1/2}B_{UT}, that is the rescaled Brownian motion sampled at uniform time. In…
In this article we mainly aim to know what kind of asymptotic behavior of typical orbits can display. For example, we show in any transitive system, the emprical measures of a typical orbit can cover all emprical measures of dense orbits…
Random perturbations applied in tandem to an ensemble of oscillating objects can synchronize their motion. We study multiple copies of an arbitrary dynamical system in a stable limit cycle, described via a standard phase reduction picture.…
We show that for every ergodic and aperiodic probability preserving transformation and $\alpha\in (0,2)$ there exists a function whose associated time series is in the standard domain of attraction of a non-degenerate symmetric…
The probability that a max-stable process {\eta} in C[0, 1] with identical marginal distribution function F hits x \in R with 0 < F (x) < 1 is the hitting probability of x. We show that the hitting probability is always positive, unless the…
We show how to map the states of an ergodic Markov chain to Euclidean space so that the squared distance between states is the expected commuting time. We find a minimax characterization of commuting times, and from this we get monotonicity…
We consider random dynamical systems on manifolds modeled by a skew product which have certain geometric properties and whose measures satisfy quenched decay of correlations at a sufficient rate. We prove that the limiting distribution for…
In the boundary driven symmetric simple exclusion process consider an open set $\ms O$ of density profiles which does not contain the stationary density profile. We prove that the first time the empirical measure visits the set $\ms O$…
We compute the joint distribution of the site and the time at which a $d$-dimensional standard Brownian motion $B_t$ hits the surface of the ball $ U(a) =\{|{\bf x}|<a\}$ for the first time. The asymptotic form of its density is obtained…
For every $c\in(1,23/22)$ and every probability dynamical system $(X,\mathcal{B},\mu,T)$ we prove that for any $f,g\in L^{\infty}_{\mu}(X)$ the bilinear ergodic averages \[ \frac{1}{N}\sum_{n=1}^Nf(T^{\lfloor n^c\rfloor}x)g(T^{-\lfloor…
In this paper, following the paper ``On the average hitting times of the squares of cycles,'' we provide an explicit formula for the average hitting times of a simple random walk on a directed graph with $N$ vertices, where the graph…
The use of Lyapunov conditions for proving functional inequalities was initiated in [5]. It was shown in [4, 30] that there is an equivalence between a Poincar{\'e} inequality, the existence of some Lyapunov function and the exponential…
Let $X$ be the constrained random walk on $\mathbb{Z}_+^d$ $d >2$, having increments $e_1$, $-e_i+e_{i+1}$ $i=1,2,3,...,d-1$ and $-e_d$ with probabilities $\lambda$, $\mu_1$, $\mu_2$,...,$\mu_d$, where $\{e_1,e_2,..,e_d\}$ are the standard…
We provide a unified framework to proving pointwise convergence of sparse sequences, deterministic and random, at the $L^1(X)$ endpoint. Specifically, suppose that \[ a_n \in \{ \lfloor n^c \rfloor, \min\{ k : \sum_{j \leq k} X_j = n\} \}…
We study the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…