相关论文: Stochastic Ergodicity Breaking: a Random Walk Appr…
Necessary and sufficient conditions for a Markov chain to be ergodic are that the chain is irreducible and aperiodic. This result is manifest in the case of random walks on finite groups by a statement about the support of the driving…
Logarithmic aging phenomena are prevalent in various systems, including electronic materials and biological structures. This study utilizes a generalized continuous time random walk (CTRW) framework to investigate the mechanisms behind the…
We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…
Many stochastic time series can be modelled by discrete random walks in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$. In correlated discrete time random walks (CDTRWs), the…
We study the phenomenon of weak ergodicity breaking for a class of globally correlated random walk dynamics defined over a finite set of states. The persistence in a given state or the transition to another one depends on the whole previous…
Continuous Time Random Walk(CTRW) is a model where particle's jumps in space are coupled with waiting times before each jump. A Continuous Time Random Walk Limit(CTRWL) is obtained by a limit procedure on a CTRW and can be used to model…
Given two distinct subsets $A,B$ in the state space of some dynamical system, Transition Path Theory (TPT) was successfully used to describe the statistical behavior of transitions from $A$ to $B$ in the ergodic limit of the stationary…
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…
We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…
We determine the range of Furstenberg entropy for stationary ergodic actions of nonabelian free groups by an explicit construction involving random walks on random coset spaces.
It has been observed in numerous experiments, simulations, and various theoretical treatments that the spreading of particles can be modeled by the continuous-time random walk. We consider two well-known cases, i.e., Gaussian displacements…
Let $G$ be a connected graph of uniformly bounded degree. A $k$ non-backtracking random walk ($k$-NBRW) $(X_n)_{n =0}^{\infty}$ on $G$ evolves according to the following rule: Given $ (X_n)_{n =0}^{s}$, at time $s+1$ the walk picks at…
Anomalous transport is usually described either by models of continuous time random walks (CTRW) or, otherwise by fractional Fokker-Planck equations (FFPE). The asymptotic relation between properly scaled CTRW and fractional diffusion…
We introduce the continuous-time vertex-reinforced random walk (cVRRW) as a continuous-time version of the vertex-reinforced random walk (VRRW), which might open a new perspective on the study of the VRRW. It has been proved by Limic and…
The stochastic motion of a particle with long-range correlated increments (the moving phase) which is intermittently interrupted by immobilizations (the traping phase) in a disordered medium is considered in the presence of an external…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
This paper deals with ergodic theorems for particular time-inhomogeneous Markov processes, whose the time-inhomogeneity is asymptotically periodic. Under a Lyapunov/minorization condition, it is shown that, for any measurable bounded…
In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly…
The aim of this paper is to deepen the analysis of the asymptotic behavior of the so-called minimal random walk (MRW) using a new martingale approach. The MRW is a discrete-time random walk with infinite memory that has three regimes…
We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely…