相关论文: Exit Probabilities and Balayage of Constrained Ran…

We present an analytical approach to study simple symmetric random walks (RWs) on a crossing geometry consisting of a plane square lattice crossed by $n_l$ number of lines that all meet each other at a single point (the origin) on the…

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…

We present a new data-driven method to provide probabilistic stability guarantees for black-box switched linear systems. By sampling a finite number of observations of trajectories, we construct approximate Lyapunov functions and deduce the…

Let $X_1$, $X_2$, $...$ be a sequence of independently and identically distributed random variables with $\mathsf{E}X_1=0$, and let $S_0=0$ and $S_t=S_{t-1}+X_t$, $t=1,2,...$, be a random walk. Denote $\tau={cases}\inf\{t>1: S_t\leq0\},…

We present a novel approach to study the evolution of the size (i.e. the number of vertices) of the giant component of a random graph process. It is based on the exploration algorithm called simultaneous breadth-first walk, introduced by…

We are interested in recovering information on a stochastic block model from the subgraph discovered by an exploring random walk. Stochastic block models correspond to populations structured into a finite number of types, where two…

In a computing center with a huge amount of machines, when a job arrives, a dispatcher need to decide which machine to route this job to based on limited information. A classical method, called the power-of-$d$ choices algorithm is to pick…

We consider the dynamics of the disordered, one-dimensional, symmetric zero range process in which a particle from an occupied site $k$ hops to its nearest neighbour with a quenched rate $w(k)$. These rates are chosen randomly from the…

Let (Z_n)_{n\in\N_0} be a d-dimensional random walk in random scenery, i.e., Z_n=\sum_{k=0}^{n-1}Y_{S_k} with (S_k)_{k\in\N_0} a random walk in Z^d and (Y_z)_{z\in Z^d} an i.i.d. scenery, independent of the walk. We assume that the random…

We study the asymptotic behaviour of a $d$-dimensional self-interacting random walk $X_n$ ($n = 1,2,...$) which is repelled or attracted by the centre of mass $G_n = n^{-1} \sum_{i=1}^n X_i$ of its previous trajectory. The walk's trajectory…

This paper is concerned with the development of rigorous approximations to various expectations associated with Markov chains and processes having non-stationary transition probabilities. Such non-stationary models arise naturally in…

Recently, Wang and Landau proposed a new random walk algorithm that can be very efficiently applied to many problems. Subsequently, there has been numerous studies on the algorithm itself and many proposals for improvements were put…

Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…

We consider a modification of classical branching random walk, where we add i.i.d. perturbations to the positions of the particles in each generation. In this model, which was introduced and studied by Bandyopadhyay and Ghosh (2023),…

The contribution of this paper is to introduce change of measure based techniques for the rare-event analysis of heavy-tailed stochastic processes. Our changes-of-measure are parameterized by a family of distributions admitting a mixture…

We define the probability structure of a continuous-time time-homogeneous Markov jump process, on a finite graph, that represents the continuous-time counterpart of the so-called Ruelle-Bowen discrete-time random walk. It constitutes the…

Random walks on expanders play a crucial role in Markov Chain Monte Carlo algorithms, derandomization, graph theory, and distributed computing. A desirable property is that they are rapidly mixing, which is equivalent to having a spectral…

We analyze a one-dimensional intermittent random walk on an unbounded domain in the presence of stochastic resetting. In this process, the walker alternates between local intensive search, diffusion, and rapid ballistic relocations in which…

We study the stationary properties as well as the non-stationary dynamics of the one-dimensional partially asymmetric exclusion process with position dependent random hop rates. In a finite system of $L$ sites the stationary current, $J$,…

A discrete time quantum walk is considered in which the step lengths are chosen to be either $1$ or $2$ with the additional feature that the walker is persistent with a probability $p$. This implies that with probability $p$, the walker…