Related papers: Extracting subsets maximizing capacity and Folding…

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

In random sequential covering, identical objects are deposited randomly, irreversibly, and sequentially; only attempts increasing the coverage are accepted. A finite system eventually gets congested, and we study the statistics of congested…

We prove that the maximal and minimal displacement of branching random walks with mean offspring number $\rho>1$ on free products of finite groups grows linearly almost surely. More precisely, we establish that the linear speed for the…

In this note, we establish a functional central limit theorem for the capacity of the range for a class of $\alpha$-stable random walks on the integer lattice $\mathbb{Z}^d$ with $d > 5\alpha/2$. Using similar methods, we also prove an…

We study massive (reccurent) sets with respect to a certain random walk $S_\alpha $ defined on the integer lattice $\mathbb{Z} ^d$, $d=1,2$. Our random walk $S_\alpha $ is obtained from the simple random walk $S$ on $\mathbb{Z} ^d$ by the…

Consider a branching random walk $(V_u)_{u\in \mathcal T^{IGW}}$ in $\mathbb Z^d$ with the genealogy tree $\mathcal T^{IGW}$ formed by a sequence of i.i.d. critical Galton-Watson trees. Let $R_n $ be the set of points in $\mathbb Z^d$…

We consider real-valued branching random walks and prove a large deviation result for the position of the rightmost particle. The position of the rightmost particle is the maximum of a collection of a random number of dependent random…

We show that the range of a critical branching random walk conditioned to survive forever and the Minkowski sum of two independent simple random walk ranges are intersection-equivalent in any dimension $d\ge 5$, in the sense that they hit…

Let $\{Z_n\}_{n\geq 0 }$ be a critical $d$-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesgue measure on $\mathbb{R}^d$. Denote by…

We introduce a modified model of random walk, and then develop two novel clustering algorithms based on it. In the algorithms, each data point in a dataset is considered as a particle which can move at random in space according to the…

We consider $d$ random walks $\big(S_n^{(j)}\big)_{n\in\mathbb{N}}$, $1\leq j \leq d$, in the same random environment $\omega$ in $\mathbb{Z}$, and a recurrent simple random walk $(Z_n)_{n\in\mathbb{N}}$ on $\mathbb{Z}$. We assume that,…

For each $n, d \in \mathbb{N}$ and $0 < \alpha < 1$, we define a random subset of $\mathcal{A}^{\{1, 2, \dots, n\}^d}$ by independently including each element with probability $\alpha$ and excluding it with probability $1-\alpha$, and…

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 consider the covering of a ball in certain normed spaces by its congruent subsets and show that if the finite number of sets is not greater than the dimensionality of the space, then the centre of the ball either belongs to the interior…

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability…

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is a non-compact simple Lie group and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense subgroup.…

We study branching random walks in random environment on the $d$-dimensional square lattice, $d \geq 1$. In this model, the environment has finite range dependence, and the population size cannot decrease. We prove limit theorems (laws of…

We prove a law of large numbers for random walks in certain kinds of i.i.d. random environments in Z^d that is an extension of a result of Bolthausen, Sznitman and Zeitouni (2003). We use this result, along with the lace expansion for…

Let $R_n$ be the range of a critical branching random walk with $n$ particles on $\mathbb Z^d$, which is the set of sites visited by a random walk indexed by a critical Galton--Watson tree conditioned on having exactly $n$ vertices. For…

We show that for each $\lambda \in [\frac{1}{2}, 1]$, there exists a solvable group and a finitely supported measure such that the associated random walk has upper speed exponent $\lambda$.