Related papers: Hipster random walks, random series-parallel graph…
We prove the law of large numbers for the drift of random walks on the two-dimensional lamplighter group, under the assumption that the random walk has finite $(2+\epsilon)$-moment. This result is in contrast with classical examples of…
We study a symmetric random walk (RW) in one spatial dimension in environment, formed by several zones of finite width, where the probability of transition between two neighboring points and corresponding diffusion coefficient are…
We examine the stationary distribution of random walks on directed graphs. In particular, we focus on the {\em principal ratio}, which is the ratio of maximum to minimum values of vertices in the stationary distribution. We give an upper…
Inhomogeneous random graphs are fundamental models for real-world networks, where prescribed degrees are imposed as soft constraints. A common assumption in such models is that the degree distribution follows a power-law, capturing the…
We consider a state-dependent, time-dependent, discrete random walks $X_t^{\{a_n\}}$ defined on natural numbers $\mathbb{N}$ (bent to a "stair" in $\mathbb{N}^2$) where the random walk depends on input of a positive deterministic sequence…
We extend some properties of random walks on hyperbolic groups to random walks on convergence groups. In particular we prove that if a convergence group $G$ acts on a compact metrizable space $M$ with the convergence property then we can…
Motivated by the random Lorentz gas, we study deterministic walks in random environment and show that (in simple, yet relevant, cases) they can be reduced to a class of random walks in random environment where the jump probability depends…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
We prove a general result that if a Metropolis--Hastings algorithm has a proposal that is not geometrically ergodic and the acceptance rate approaches unity at a suitable rate as the state variable becomes large, then the Metropolised chain…
We consider a simple model for active random walk with general temporal correlations, and investigate the shape of the probability distribution function of the displacement during a short time interval. We find that under certain conditions…
Fix an irrational number $\alpha$. Let $X_1,X_2,\cdots$ be independent, identically distributed, integer-valued random variables with characteristic function $\varphi$, and let $S_n=\sum_{i=1}^n X_i$ be the partial sums. Consider the random…
This paper presents a sharp approximation of the density of long runs of a random walk conditioned on its end value or by an average of a function of its summands as their number tends to infinity. In the large deviation range of the…
We give general conditions for the central limit theorem and weak convergence to Brownian motion (the weak invariance principle / functional central limit theorem) to hold for observables of compact group extensions of nonuniformly…
In this paper we study extreme events for random walks on homogeneous spaces. We consider the following three cases. On the torus we study closest returns of a random walk to a fixed point in the space. For a random walk on the space of…
We consider the branching random walk in random environment with a random absorption wall. When we add this barrier, we discuss some topics related to the survival probability. We assume that the random environment is i.i.d., $S_i$ is a…
We present our recent work on stochastic particle systems on complex networks. As a noninteracting system we first consider the diffusive motion of a random walker on heterogeneous complex networks. We find that the random walker is…
A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…
In this article, we quantify the functional convergence of the rescaled random walk with heavy tails to a stable process.This generalizes the Generalized Central Limit Theorem for stable random variables infinite dimension. We show that…
We connect the mixing behaviour of random walks over a graph to the power of the local-consistency algorithm for the solution of the corresponding constraint satisfaction problem (CSP). We extend this connection to arbitrary CSPs and their…
Inspired by Benjamini et al (Ann. Inst. H. Poincar\'{e} Probab. Stat. 2010) and Windisch (Electron. J. Probab. 2010), we consider the entropy of the random walk range formed by a simple random walk on a discrete group. It is shown in this…