Related papers: A Lower Bound on the Growth Exponent for Loop-Eras…

We consider a continuous-time branching random walk on $\mathbb{Z}$ in a random non homogeneous environment. Particles can walk on the lattice points or disappear with random intensities. The process starts with one particle at initial time…

Let $M_n$ be the minimal position at generation $n$, of a real-valued branching random walk in the boundary case. As $n \to \infty$, $M_n- {3 \over 2} \log n$ is tight (see [1][9][2]). We establish here a law of iterated logarithm for the…

The $\lambda$-biased random walk on a binary tree of depth $n$ is the continuous-time Markov chain that has unit mean holding times and, when at a vertex other than the root or a leaf of the tree in question, has a probability of jumping to…

We examine diffusion-limited aggregation generated by a random walk on Z with long jumps. We derive upper and lower bounds on the growth rate of the aggregate as a function of the number moments a single step of the walk has. Under various…

We investigate a lattice model of comb polymers and derive bounds on the exponential growth rate of the number of embeddings of the comb. A comb is composed of a backbone that is a self-avoiding walk and a set of $t$ teeth, also modelled as…

We study records generated by Brownian particles in one dimension. Specifically, we investigate an ordinary random walk and define the record as the maximal position of the walk. We compare the record of an individual random walk with the…

We provide a new strategy to compute the exponential growth constant of enumeration sequences counting walks in lattice path models restricted to the quarter plane. The bounds arise by comparison with half-planes models. In many cases the…

We study the shrinking Pearson random walk in two dimensions and greater, in which the direction of the Nth is random and its length equals lambda^{N-1}, with lambda<1. As lambda increases past a critical value lambda_c, the endpoint…

We prove the limit theorem for paths of random walks with $n$ steps in $\mathbb{R}^d$ as $n$ and $d$ both go to infinity. For this, the paths are viewed as finite metric spaces equipped with the $\ell_p$-metric for $p\in[1,\infty)$. Under…

Excited random walks (ERWs) are a self-interacting non-Markovian random walk in which the future behavior of the walk is influenced by the number of times the walk has previously visited its current site. We study the speed of the walk,…

We study occupancy counts for the critical nearest-neighbor branching random walk on the $d$-dimensional lattice, conditioned on non-extinction. For $d\geq 3$, Lalley and Zheng (2011) showed that the properly scaled joint distribution of…

In a recent paper, K. Raschel and R. Garbit proved that the exponential decreasing rate of the probability that a random walk (with all exponential moments) stays in a $d$-dimensional orthant is given by the minimum on this orthant of the…

The motion of a lazy Pearson walker is studied with different probability ($p$) of jump in two and three dimensions. The probability of exit ($P_e$) from a zone of radius $r_e$, is studied as a function of $r_e$ with different values of…

We study the growth of typical groups from the family of $p$-groups of intermediate growth constructed by the second author. We find that, in the sense of category, a generic group exhibits oscillating growth with no universal upper bound.…

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…

The one-dimensional elephant random walk is a typical model of discrete-time random walk with step-reinforcement, and is introduced by Sch\"{u}tz and Trimper (2004). It has a parameter $\alpha \in (-1,1)$: The case $\alpha=0$ corresponds to…

We consider a supercritical symmetric continuous-time branching random walk on a multidimensional lattice with a finite number of particle generation sources of varying positive intensities without any restrictions on the variance of jumps…

We derive an annealed large deviation principle (LDP) for the normalised and rescaled local times of a continuous-time random walk among random conductances (RWRC) in a time-dependent, growing box in $\Z^d$. We work in the interesting case…

Self-repelling two-leg (biped) spider walk is considered where the local stochastic movements are governed by two independent control parameters $ \beta_d$ and $ \beta_h $, so that the former controls the distance ($ d $) between the legs…

We present a general approach to study a class of random growth models in $n$-dimensional Euclidean space. These models are designed to capture basic growth features which are expected to manifest at the mesoscopic level for several…