Related papers: On some properties of transitions operators

We examine a class of random walks in random environments on $\mathbb{Z}$ with bounded jumps, a generalization of the classic one-dimensional model. The environments we study have i.i.d. transition probability vectors drawn from Dirichlet…

Consideration is given to the continuous-time supercritical branching random walk over a multidimensional lattice with a finite number of particle generation sources of the same intensity both with and without constraint on the variance of…

Let $X=(X,\mathcal{B},\mu)$ be a $\sigma$-finite measure space and \mbox{$f:X\to X$} be a measurable transformation such that the composition operator $T_f:\varphi\mapsto \varphi\circ f$ is a bounded linear operator acting on…

Symmetric heavily tailed random walks on $Z^d, d\geq 1,$ are considered. Under appropriate regularity conditions on the tails of the jump distributions, global (i.e., uniform in $x,t, |x|+t\to\infty,$) asymptotic behavior of the transition…

We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and…

We present a study demonstrating how random walk algorithms can be used for evolutionary image transition. We design different mutation operators based on uniform and biased random walks and study how their combination with a baseline…

The problem of a restricted random walk on graphs which keeps track of the number of immediate reversal steps is considered by using a transfer matrix formulation. A closed-form expression is obtained for the generating function of the…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

We consider random walks associated with conductances on Delaunay triangulations, Gabriel graphs and skeletons of Voronoi tilings which are generated by point processes in $\mathbb{R}^d$. Under suitable assumptions on point processes and…

Motivated by various recent experimental findings, we propose a dynamical model of intermittently self-propelled particles: active particles that recurrently switch between two modes of motion, namely an active run-state and a turn state,…

We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…

The foundational work of Karlin and McGregor established a powerful connection between random walks with tridiagonal transition matrices and the theory of orthogonal polynomials. We consider a particular extension of this framework, where…

This paper presents a study of the properties of a matrix model that was introduced to describe transitions between all Wigner surmises of Random Matrix theory. New results include closed-form exact analytical expressions for the…

Consider a simple random walk on the integers with the following transition mechanism. At each site $x$, the probability of jumping to the right is $\omega(x)\in[\frac12,1)$, until the first time the process jumps to the left from site $x$,…

Let $S_n$ be the simple random walk on the integer lattice $\mathbb{Z}^d$. For a Bernstein function $\phi$ we consider a random walk $S^\phi_n$ which is subordinated to $S_n$. Under a certain assumption on the behaviour of $\phi$ at zero we…

We establish recurrence and transience criteria for critical branching processes in random environment with immigration. These results are then applied to discuss recurrence and transience of a recurrent random walk in a random environment…

Motivated by its connection to the limit behaviour of imprecise Markov chains, we introduce and study the so-called convergence of upper transition operators: the condition that for any function, the orbit resulting from iterated…

We study the biased random walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to…

We consider a random walk with transition probabilities weakly dependent on an environment with a deterministic, but strongly chaotic, evolution. We prove that for almost all initial conditions of the environment the walk satisfies the CLT.